http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-103279556-B
Outgoing Links
Predicate | Object |
---|---|
classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06K9-66 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F17-30 |
filingDate | 2013-06-09-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
grantDate | 2016-08-24-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
publicationDate | 2016-08-24-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
publicationNumber | CN-103279556-B |
titleOfInvention | Iteration Text Clustering Method based on self adaptation sub-space learning |
abstract | The invention discloses a kind of iteration Text Clustering Method based on self adaptation sub-space learning, comprise the following steps: (1) initializes: corpus of text is expressed as text vector space, using affine propagation clustering method to produce initial K cluster, the cluster category table of all texts is shown as initial classes ownership oriental matrix.(2) iteration between subspace projection and cluster: initial classes is belonged to oriental matrix as priori, to maximize average neighborhood edge for object solving subspace projection matrix, by text vector space projection to subspace, and use affine propagation clustering method to produce K cluster in subspace, thus update class ownership oriental matrix;Belong to oriental matrix based on subspace projection matrix and class and calculate convergent function, until function convergence, exit iteration, complete text cluster.The present invention is unrestricted to size and the distribution of text data, and subspace solution and cluster are fused under Unified frame, is obtained the cluster result of global optimum by the strategy of iteration. |
priorityDate | 2013-06-09-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Predicate | Subject |
---|---|
isDiscussedBy | http://rdf.ncbi.nlm.nih.gov/pubchem/compound/CID25572 http://rdf.ncbi.nlm.nih.gov/pubchem/substance/SID415713197 |
Total number of triples: 12.