961 search results - page 32 / 193 » Significance-Driven Graph Clustering |
107
click to vote
CORR
2002
Springer
15 years 12 days ago
2002
Springer
This paper describes the results of some experiments exploring statistical methods to infer syntactic categories from a raw corpus in an unsupervised fashion. It shares certain po...
112
Voted
ICCV
2009
IEEE
14 years 10 months ago
2009
IEEE
In this work, we address the problem of building recognition across two camera views with large changes in scales and viewpoints. The main idea is to construct a semantically rich...
130
click to vote
DASFAA
2007
IEEE
15 years 7 months ago
2007
IEEE
Subspace clustering (also called projected clustering) addresses the problem that different sets of attributes may be relevant for different clusters in high dimensional feature sp...
124
Voted
PR
2008
15 years 15 days ago
2008
Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with ...
90
Voted
AAIM
2008
Springer
15 years 7 months ago
2008
Springer
A promising approach to compare two graph clusterings is based on using measurements for calculating the distance between them. Existing measures either use the structure of cluste...