172 search results - page 1 / 35 » Graph-Based Data Clustering with Overlaps |
COCOON
2009
Springer
13 years 12 months ago
2009
Springer
We introduce overlap cluster graph modification problems where, other than in most previous work, the clusters of the target graph may overlap. More precisely, the studied graph p...
SIAMDM
2010
13 years 2 days ago
2010
ICDM
2007
IEEE
13 years 11 months ago
2007
IEEE
This paper introduces a new technique of document clustering based on frequent senses. The proposed system, GDClust (Graph-Based Document Clustering) works with frequent senses ra...
AAIM
2009
Springer
13 years 12 months ago
2009
Springer
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
ICDM
2006
IEEE
13 years 11 months ago
2006
IEEE
Most clustering algorithms are partitional in nature, assigning each data point to exactly one cluster. However, several real world datasets have inherently overlapping clusters i...