521 search results - page 19 / 105 » Coring method for clustering a graph |
156
click to vote
PAMI
2008
15 years 4 months ago
2008
Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity meas...
115
click to vote
ICDM
2003
IEEE
15 years 9 months ago
2003
IEEE
Text document clustering plays an important role in providing intuitive navigation and browsing mechanisms by organizing large sets of documents into a small number of meaningful ...
154
click to vote
TVCG
2008
15 years 3 months ago
2008
Graphs have been widely used to model relationships among data. For large graphs, excessive edge crossings make the display visually cluttered and thus difficult to explore. In thi...
140
click to vote
KDD
2009
ACM
16 years 4 months ago
2009
ACM
In traditional text clustering methods, documents are represented as "bags of words" without considering the semantic information of each document. For instance, if two ...
130
click to vote
LATIN
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...