92 search results - page 3 / 19 » On the Relative Hardness of Clustering Corpora |
CP
2010
Springer
13 years 3 months ago
2010
Springer
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
NAACL
2003
13 years 7 months ago
2003
e by placing terms in an abstract ‘information space’ based on their occurrences in text corpora, and then allowing a user to visualize local regions of this information space....
KDD
2007
ACM
14 years 6 months ago
2007
ACM
Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such...
CEC
2008
IEEE
14 years 7 days ago
2008
IEEE
—Correlation clustering problem is a NP hard problem and technologies for the solving of correlation clustering problem can be used to cluster given data set with relation matrix...
FLAIRS
2006
13 years 7 months ago
2006
Text categorization involves mapping of documents to a fixed set of labels. A similar but equally important problem is that of assigning labels to large corpora. With a deluge of ...