521 search results - page 17 / 105 » Coring method for clustering a graph |
157
Voted
SDM
2003
SIAM
15 years 5 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
138
click to vote
PAKDD
2007
ACM
15 years 10 months ago
2007
ACM
This work presents a kernel method for clustering the nodes of a weighted, undirected, graph. The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel...
136
Voted
ACL
2006
15 years 5 months ago
2006
This paper presents an unsupervised learning approach to disambiguate various relations between name entities by use of various lexical and syntactic features from the contexts. I...
137
click to vote
MICAI
2007
Springer
15 years 10 months ago
2007
Springer
Among various document clustering algorithms that have been proposed so far, the most useful are those that automatically reveal the number of clusters and assign each target docum...
123
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
Central and subspace clustering methods are at the core of many segmentation problems in computer vision. However, both methods fail to give the correct segmentation in many pract...