CN101452704B - Speaker clustering method based on information transfer - Google Patents
Speaker clustering method based on information transfer Download PDFInfo
- Publication number
- CN101452704B CN101452704B CN2007101783634A CN200710178363A CN101452704B CN 101452704 B CN101452704 B CN 101452704B CN 2007101783634 A CN2007101783634 A CN 2007101783634A CN 200710178363 A CN200710178363 A CN 200710178363A CN 101452704 B CN101452704 B CN 101452704B
- Authority
- CN
- China
- Prior art keywords
- data segment
- value
- cluster centre
- cluster
- twos
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 67
- 238000012986 modification Methods 0.000 claims description 3
- 230000004048 modification Effects 0.000 claims description 3
- 230000011218 segmentation Effects 0.000 description 5
- 230000005540 biological transmission Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 230000015572 biosynthetic process Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 230000002045 lasting effect Effects 0.000 description 1
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a speaker clustering method based on information transfer, which comprises the following steps: 1) the similarity s(i, k) between each two data segments is calculated, wherein the k is not equal to i; 2) the data segments are set as priority s(k, k) of a clustering center, wherein the k represents the kth data segment, and all a values a(i, k) are initialized to zero; 3) a r value r(i, k) between each two data segments is calculated according to the a value between each two data segments and the priority of the data segments, then the a value between each two data segments is calculated according to the r value between each two data segments; 4) the r value and the a value are merged, and the merging value is used to decide the clustering center; and 5) step 3) and step 4) are repeatedly executed until the steady clustering center is found, the clustering is finished, and the clustering number is counted. The method considers each data segment as a potential clustering center and has stronger robustness. At the same time, the method only needs to calculate the distance between each two segments at one time and has quicker operation speed.
Description
Technical field
The invention belongs to the speech recognition technology field, specifically, the present invention relates to a kind of speaker clustering method.
Background technology
Speaker's cluster is one of field of voice signal research focus in recent years, is widely used in fields such as speech recognition and Speaker Identification.This technology is used with speaker's segmentation usually, just usually said speaker's segmentation cluster.Speaker's cluster is exactly with the voice data classification after the segmentation, and different speakers' speech data is assigned in the different classes.
The existing so far many methods of speaker's cluster can be divided into two classes: supervise algorithm and no supervise algorithm are arranged.There is the supervision cluster generally to be meant the number of speaker in the known dialogue, carries out cluster according to speaker's number; Do not have number the unknown that supervision speaker cluster generally is meant speaker in the dialogue, the clusters number that cluster process finds an optimum with and corresponding cluster result.At present, speaker's cluster field is the algorithm that is based on the hierarchical clustering framework of widespread use the most, all voice segments distance is between any two calculated in the hierarchical clustering initialization, seek nearest two sections and be merged into one section, and the distance between other voice segments of update calculation and this newspeak segment, repeat this process up to obtaining needed clusters number or satisfying a certain overall criterion.But this algorithm robustness is still waiting to improve.Simultaneously, the distance (similarity) between all kinds of and new class of this algorithm needs calculating repeatedly, this has increased running time of algorithm.Therefore, existing a lot of methods all are based on the improvement on the method, and purpose is the robustness and the speed of enhancement algorithms.
Summary of the invention
The objective of the invention is to overcome the deficiencies in the prior art, characteristics at voice signal, by r value between each data segment of continuous iterative computation and a value, with these two values as two kinds of interactive information between two sections, formation information is transmitted, thereby proposes a kind of robust and new fast and effectively nothing supervision and the supervision speaker clustering method is arranged.
For achieving the above object, the speaker clustering method that transmits based on information provided by the invention (can with reference to figure 1) comprises initialization procedure and seeks the cluster centre process;
Wherein initialization procedure comprises the steps:
1) calculate in twos the similarity s between the speech data section (hereinafter to be referred as data segment) (i, k), k ≠ i wherein;
2) set each data segment as the relative importance value s of cluster centre (k, k), wherein k represents k data segment, (i k) is initialized as zero, hereinafter abbreviates effective value (availability) as a value with all effective value a;
Seek the cluster centre process and comprise following substep:
3) according to the relative importance value of a value between the data segment in twos and each data segment, (i k), hereinafter abbreviates responsibility value (responsibility) as the r value to calculate in twos the responsibility value r between the data segment; According to the r value of each data segment, calculate a value between the data segment in twos;
4) merge r value and a value, with this merging value decision-making cluster centre;
5) repeated execution of steps 3), 4), up to finding stable cluster centre, finish cluster, the statistics clusters number;
More than in each step, i, k represent i and k data segment respectively.
In the technique scheme, in the described step 1), described similarity is drawn by the distance of data segment in twos, and described distance can be Euclidean distance, mahalanobis distance, KL distance or GLR distance.
In the technique scheme, described step 2) in, (k k) all is set at the intermediate value of all similarities to described each data segment as the relative importance value s of cluster centre.
In the technique scheme, in the described step 3), calculate in twos the responsibility value r between the data segment (i, method k) is as follows:
(N represents the number of voice segments to r in the following formula for i, k) the r value of i data segment of expression and k data segment.
In the technique scheme, in the described step 3), it is as follows to calculate in twos between the data segment method of a value:
When k=i
When k ≠ i
A in the following formula (i, k) a value of i data segment of expression and k data segment.
In the technique scheme, described initialization procedure also comprises: set maximum iteration time (MaxitNum) and convergent iterations number of times (iteration) in the cluster process;
In the technique scheme, in the described step 5), the determination methods of described stable cluster centre is as follows: when iterations reaches maximum iteration time, think that the cluster centre of this moment is stable cluster centre.
In the technique scheme, in the described step 5), the determination methods of described stable cluster centre is as follows: when the result of decision of cluster centre continues the iterations of some when constant, think that the cluster centre of this moment is stable cluster centre.
In the technique scheme, in the described step 5), the determination methods of described stable cluster centre is as follows: when the result of decision of cluster centre continues the iterations of some when constant, perhaps when iterations reaches maximum iteration time, think that the cluster centre of this moment is stable cluster centre.
In the technique scheme, described searching cluster centre process also comprises the steps: after step 5) is finished
6) comparison step 5) in the clusters number and the predefined known speaker clusters number of statistics, when the two is unequal, revise the relative importance value of each data segment, and with a value zero setting again of each data segment; Wherein, the modification of the relative importance value of each data segment is carried out according to following formula:
s
n+1(k，k)＝s
n(k，k)-Step×(C
n-C
exp)
S in the formula
n(k, the relative importance value of k data segment when k) being the n time cluster, C
nThe clusters number that obtains when being the n time cluster, C
ExpBe predefined known speaker clusters number (i.e. the clusters number that expectation obtains), step is the self-adaptation factor.
The present invention has following technique effect: compared with prior art, the present invention has adopted a kind of and traditional distinct method of methods such as hierarchical clustering.Think when this method is initial that each data segment all is potential cluster centre, think that promptly each data segment is the same as the probability of final cluster centre, can avoid some bad Clustering Decision-Making to a certain extent like this, so this method has stronger robustness.Simultaneously this method only needs the distance between good per two sections of the one-time calculation in operational process, in the process of seeking cluster centre, do not need extra computation distance again, hierarchical clustering not only will calculate the distance between per two sections, also needs to bring in constant renewal in the distance of calculating between new section and other section.And what clustering method was had the greatest impact is the calculating of distance, so this method has quicker operation speed than hierarchical clustering.The present invention also can be used for doing does not have the supervision cluster.
Description of drawings
Below, describe embodiments of the invention in conjunction with the accompanying drawings in detail, wherein:
Fig. 1 is a clustering algorithm block diagram of the present invention;
Fig. 2 is that an embodiment of the present invention does not have supervision speaker cluster detail flowchart.
Embodiment
The invention will be further described below in conjunction with drawings and Examples.
Embodiment 1
The supervision speaker clustering method that has based on the information transmission provided by the invention comprises the steps:
Step 101 reads the segment information that obtains after speaker's segmentation.
Step 102 is determined the number N of voice segments, sets the maximum iteration time (MaxitNum) in the cluster process, the convergent iterations number of times (iteration) when judging convergence.In the present embodiment, maximum iteration time is made as 500, and the convergent iterations number of times is made as 50.
Step 103 is extracted feature vector sequence from input speech signal, adopt the LSP feature of 14 dimensions in the present embodiment.
Step 104 is calculated the similarity between the voice segments in twos.Will be apart from the similarity (this is those skilled in the art's the practice commonly used) that adds behind the negative sign as input.In actual applications, with the similarity of i data segment and k data segment with s (i, k) expression, wherein k ≠ i.Distance commonly used has Euclidean distance, mahalanobis distance, and the KL distance, and the GLR distance etc.Can measure according to the different situations chosen distance in the practical process.
Adopt the GLR distance to come the distance between the voice segments the most in twos in the present embodiment.Concrete computing formula is as follows:
s(i，k)＝-d
GLR(x
i，x
k)，i≠k
(i promptly is needed similarity k) to s in the following formula, the similarity degree between having represented two sections.d
GLR(x
i, x
k) be the GLR distance between i section and the k section.x
i, x
kBe respectively the proper vector of i section and k section, they can characterize with two Gauss models: N (μ
Xi, ∑
Xi), N (μ
Xk, ∑
Xk).The concrete computing formula of GLR distance is as follows:
Wherein, L (*) is a likelihood function, y representation feature vector x
iAnd x
kCombination, y is with mixed Gaussian N (μ
y, ∑
y) characterize.
Step 105 is chosen relative importance value, all voice segments all is set at the intermediate value of all similarities as the relative importance value of cluster centre.Among the present invention, the selected probability of doing cluster centre of each data segment equates, so the relative importance value of all voice segments (preference) all is made as same value, i.e. and the intermediate value of all similarities.The magnitude relationship of these relative importance values by changing this value, can obtain different clusters number to the number of final cluster classification.The present invention is exactly the cluster classification number that obtains expecting by this condition.(k k) represents relative importance value with s in formula.All relative importance value s (k, k) all calculate by following formula:
s(k，k)＝median
i＝1：N，j＝1：n，i≠j[s(i，k)]
Median symbolic representation intermediate value wherein.
Step 106 is initialized as zero with all effective values (a value); (i k) represents a value of i data segment and k data segment with a.This a value has reflected that other all data segments except that k data segment compare, and i data segment selected the appropriate level of k data segment as its cluster centre.
Step 107, calculate the r value according to following formula:
R in the following formula (i, k) the r value of i data segment of expression and k data segment.This r value has reflected that k data segment compare with the potential cluster centre of other i data segment, and k data segment is as the appropriateness of the cluster centre of i data segment.
Calculate a value according to following formula:
When k=i
When k ≠ i
Step 108, calculate all r (i, k)+a (i, value k), to each i seek make accordingly r (i, k)+a (i, k) Zui Da k.Concerning i data segment, make r (i, k)+a (when i, that data segment k=i of value maximum k), illustrates that i data segment is cluster centre, if k ≠ i illustrates that k data segment is the cluster centre of i data segment.
Step 109, repeated execution of steps 107, step 108, find stable cluster centre according to certain criterion after, finish one time cluster, the statistics clusters number.When described criterion remains unchanged for the iterations that continues some when the result of decision of cluster centre (in lasting 50 iteration, the result of decision remains unchanged), when perhaps iterations reaches maximum iteration time, think that the Clustering Decision-Making of this moment is reliable and stable, thereby stop this time cluster.
Step 110 if the clusters number that obtains in the step 109 is not the number of appointment, is then revised the relative importance value of each voice segments, and this relative importance value has influence on the class number that each iteration cluster obtains.Repeating step 106), 107), 108), 109), identical up to the clusters number that obtains with the clusters number of appointment, then export cluster result this moment.The modification of the relative importance value of each voice segments is according to following formula in this step:
s
n+1(k，k)＝s
n(k，k)-step×(C
n-C
exp)
S in the following formula
n(k, the relative importance value of each data segment when k) being the n time cluster, C
nThe clusters number that obtains when being the n time cluster, C
ExpBe the clusters number that expectation obtains, step is the self-adaptation factor, can set according to experiment or experience.
Just can finish supervision speaker cluster by above step.
Embodiment 2
As shown in Figure 2, the nothing supervision speaker clustering method based on the information transmission provided by the invention comprises the steps (in the present embodiment to tell most of step identical with embodiment 1, so these steps are not remake detailed explanation):
Step 101 reads the segment information that obtains after speaker's segmentation.
Step 102 is determined the number of voice segments, sets the maximum iteration time in the cluster process, the iterations when judging convergence, and decay factor.
Step 103 is extracted feature vector sequence from input speech signal.
Step 104 is calculated the similarity between the voice segments in twos.
Step 105 is chosen relative importance value.
Step 106 is zero with all a value initializations;
Step 107, calculate r value and a value according to formula:
Step 108, calculate all r (i, k)+(i, value k) are sought cluster centre to a.
Step 109, repeated execution of steps 108, find stable cluster centre according to criterion after, stop cluster.
Therefore the part that this nothing supervision speaker cluster can be used as supervision speaker cluster is treated.It is exactly constantly to repeat not have supervision speaker cluster process that supervision speaker cluster is arranged, and each voice segments is sought suitable relative importance value, thereby the clusters number that obtains expecting realizes having the supervision cluster.
At last, it should be noted last that above embodiment is only unrestricted in order to technical scheme of the present invention to be described.Although the present invention is had been described in detail with reference to embodiment, those of ordinary skill in the art is to be understood that, technical scheme of the present invention is made amendment or is equal to replacement, do not break away from the spirit and scope of technical solution of the present invention, it all should be encompassed in the middle of the claim scope of the present invention.
Claims (6)
1. a speaker clustering method that transmits based on information comprises initialization procedure and seeks the cluster centre process;
Wherein initialization procedure comprises the steps:
1) calculate in twos the similarity s between the data segment (i, k), k ≠ i wherein;
2) set each data segment as the relative importance value s of cluster centre (k, k), wherein k represents k data segment, (i k) is initialized as zero with all effective value a;
Seek the cluster centre process and comprise following substep:
3) according to the effective value between the data segment in twos and each data segment relative importance value, calculate in twos the responsibility value r between the data segment (i, k); According to the responsibility value between the data segment in twos, calculate the effective value between the data segment in twos more then;
4) corresponding responsibility value and effective value are merged draw merging value r (i, k)+a (i, k), with this merging value decision-making cluster centre;
5) repeated execution of steps 3), 4), up to finding stable cluster centre, finish cluster, the statistics clusters number;
More than in each step, i, k represent i and k data segment respectively;
Described step 2) in, (k k) all is set at the intermediate value of all similarities to described each data segment as the relative importance value s of cluster centre;
In the described step 3), calculate in twos the responsibility value r between the data segment (i, method k) is as follows:
(N represents the number of data segment to r in the following formula for i, k) the r value of i data segment of expression and k data segment;
In the described step 3), the method for calculating the effective value between the data segment in twos is as follows:
When k=i
When k ≠ i
(N represents the number of data segment to a in the following formula for i, k) a value of i data segment of expression and k data segment;
In the described step 4), calculate all r (i, k)+a (i, value k), to each i seek make accordingly r (i, k)+a (i, k) Zui Da k; Concerning i data segment, make r (i, k)+a (when i, that data segment k=i of value maximum k), illustrates that i data segment is cluster centre, if k ≠ i illustrates that k data segment is the cluster centre of i data segment.
2. the speaker clustering method that transmits based on information according to claim 1 is characterized in that, in the described step 1), described similarity is drawn by the distance of data segment in twos, and described distance can be Euclidean distance, mahalanobis distance, KL distance or GLR distance.
3. the speaker clustering method that transmits based on information according to claim 1 is characterized in that described initialization procedure also comprises: set maximum iteration time and convergent iterations number of times in the cluster process.
4. the speaker clustering method that transmits based on information according to claim 3, it is characterized in that, in the described step 5), the determination methods of described stable cluster centre is as follows: when iterations reaches maximum iteration time, think that the cluster centre of this moment is stable cluster centre.
5. the speaker clustering method that transmits based on information according to claim 3, it is characterized in that, in the described step 5), the determination methods of described stable cluster centre is as follows: when the iterations that continues some when the result of decision of cluster centre remains unchanged, think that the cluster centre of this moment is stable cluster centre, described some is the convergent iterations number of times that sets.
6. the speaker clustering method that transmits based on information according to claim 1 is characterized in that described searching cluster centre process also comprises the steps: after step 5) is finished
6) comparison step 5) in the clusters number and the predefined known speaker clusters number of statistics, when the two is unequal, revise the relative importance value of each data segment, and with the effective value zero setting again of each data segment; Wherein, the modification of the relative importance value of each data segment is carried out according to following formula:
s
n+1(k，k)＝s
n(k，k)-step×(C
n-C
exp)
S in the formula
n(k, the relative importance value of k data segment when k) being the n time cluster, C
nThe clusters number that obtains when being the n time cluster, C
ExpBe predefined known speaker clusters number, step is the self-adaptation factor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101783634A CN101452704B (en) | 2007-11-29 | 2007-11-29 | Speaker clustering method based on information transfer |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101783634A CN101452704B (en) | 2007-11-29 | 2007-11-29 | Speaker clustering method based on information transfer |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101452704A CN101452704A (en) | 2009-06-10 |
| CN101452704B true CN101452704B (en) | 2011-05-11 |
Family
ID=40734904
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007101783634A Expired - Fee Related CN101452704B (en) | 2007-11-29 | 2007-11-29 | Speaker clustering method based on information transfer |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101452704B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102074236B (en) * | 2010-11-29 | 2012-06-06 | 清华大学 | Speaker clustering method for distributed microphone |
| CN104282303B (en) * | 2013-07-09 | 2019-03-29 | 威盛电子股份有限公司 | The method and its electronic device of speech recognition are carried out using Application on Voiceprint Recognition |
| CN105469784B (en) * | 2014-09-10 | 2019-01-08 | 中国科学院声学研究所 | A kind of speaker clustering method and system based on probability linear discriminant analysis model |
| CN105161093B (en) * | 2015-10-14 | 2019-07-09 | 科大讯飞股份有限公司 | A kind of method and system judging speaker's number |
| CN110335621A (en) * | 2019-05-28 | 2019-10-15 | 深圳追一科技有限公司 | Method, system and the relevant device of audio processing |
| CN111240942A (en) * | 2019-12-02 | 2020-06-05 | 华为技术有限公司 | Log abnormity detection method and device |
| CN110930984A (en) * | 2019-12-04 | 2020-03-27 | 北京搜狗科技发展有限公司 | Voice processing method and device and electronic equipment |
| CN112562693B (en) * | 2021-02-24 | 2021-05-28 | 北京远鉴信息技术有限公司 | Speaker determining method and device based on clustering and electronic equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1455389A (en) * | 2002-09-30 | 2003-11-12 | 中国科学院声学研究所 | Voice identifying system and compression method of characteristic vector set for voice identifying system |
| CN1455388A (en) * | 2002-09-30 | 2003-11-12 | 中国科学院声学研究所 | Voice identifying system and compression method of characteristic vector set for voice identifying system |
| WO2004001720A1 (en) * | 2002-06-19 | 2003-12-31 | Koninklijke Philips Electronics N.V. | A mega speaker identification (id) system and corresponding methods therefor |
| CN1540623A (en) * | 2003-11-04 | 2004-10-27 | 清华大学 | Threshold self-adaptive speech sound detection system |
-
2007
- 2007-11-29 CN CN2007101783634A patent/CN101452704B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2004001720A1 (en) * | 2002-06-19 | 2003-12-31 | Koninklijke Philips Electronics N.V. | A mega speaker identification (id) system and corresponding methods therefor |
| CN1455389A (en) * | 2002-09-30 | 2003-11-12 | 中国科学院声学研究所 | Voice identifying system and compression method of characteristic vector set for voice identifying system |
| CN1455388A (en) * | 2002-09-30 | 2003-11-12 | 中国科学院声学研究所 | Voice identifying system and compression method of characteristic vector set for voice identifying system |
| CN1540623A (en) * | 2003-11-04 | 2004-10-27 | 清华大学 | Threshold self-adaptive speech sound detection system |
Non-Patent Citations (7)
| Title |
|---|
| Liu D, Kubala F.《Online Speaker Clustering》.《IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2004》.2004,333-336. * |
| LiuD Kubala F.《Online Speaker Clustering》.《IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS |
| Padmanabhan M, Bahl LR,Picheny MA..《 Speaker clustering and transformation for speaker adaptation in large vocabulary speech recognition systems》.《IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 1996》.1996,701-704. |
| Padmanabhan M, Bahl LR,Picheny MA..《 Speaker clustering and transformation for speaker adaptation in large vocabulary speech recognition systems》.《IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 1996》.1996,701-704. * |
| 何磊,方棣棠,吴文虎.《18说话人聚类与模型自适应结合的说话人自适应方法》.《第六届全国人机语音通讯学术会议 》.2001,全文. * |
| 林琳，王树勋.《基于遗传-模糊聚类的说话人识别方法及其仿真研究》.《系统仿真学报》.2006,全文. * |
| 王炜,吕萍,颜永红.《基于假设检验的的自动说话人聚类算法》.《第八届全国人机语音通讯学术会议(NCMMSC8) 》.2005,全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101452704A (en) | 2009-06-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101452704B (en) | Speaker clustering method based on information transfer | |
| TWI794157B (en) | Automatic multi-threshold feature filtering method and device | |
| CN106383877B (en) | Social media online short text clustering and topic detection method | |
| Shum et al. | On the use of spectral and iterative methods for speaker diarization | |
| CN108875933B (en) | Over-limit learning machine classification method and system for unsupervised sparse parameter learning | |
| CN105550211A (en) | Social network and item content integrated collaborative recommendation system | |
| CN109299263B (en) | Text classification method and electronic equipment | |
| CN111539444B (en) | Gaussian mixture model method for correction type pattern recognition and statistical modeling | |
| Tu et al. | Variational domain adversarial learning with mutual information maximization for speaker verification | |
| CN112487482B (en) | Deep learning differential privacy protection method of self-adaptive cutting threshold | |
| CN111563373B (en) | Attribute-level emotion classification method for focused attribute-related text | |
| CN103279746A (en) | Method and system for identifying faces based on support vector machine | |
| CN115409124B (en) | Small sample sensitive information identification method based on fine tuning prototype network | |
| CN103035239B (en) | Speaker recognition method based on partial learning | |
| CN113672718A (en) | Dialog intention recognition method and system based on feature matching and field self-adaption | |
| CN107688822B (en) | Newly added category identification method based on deep learning | |
| Deng et al. | Feature Selection for Handling Label Ambiguity using Weighted Label-fuzzy Relevancy and Redundancy | |
| Huang et al. | Maximin separation probability clustering | |
| CN116883746A (en) | Graph node classification method based on partition pooling hypergraph neural network | |
| CN116776173A (en) | Power measurement data desensitization method based on convolutional neural network | |
| US20140343944A1 (en) | Method of visual voice recognition with selection of groups of most relevant points of interest | |
| US20140343945A1 (en) | Method of visual voice recognition by following-up the local deformations of a set of points of interest of the speaker's mouth | |
| CN115630304A (en) | Event segmentation and extraction method and system in text extraction task | |
| CN114547264A (en) | News diagram data identification method based on Mahalanobis distance and comparison learning | |
| CN110942089A (en) | Key stroke identification method based on multi-level decision |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20110511 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |