587 search results - page 29 / 118 » Clustering Improves the Exploration of Graph Mining Results |
ICML
2010
IEEE
15 years 25 days ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
PKDD
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Recent results on robust density-based clustering have indicated that the uncertainty associated with the actual measurements can be exploited to locate objects that are ...
127
click to vote
SDM
2011
SIAM
14 years 2 months ago
2011
SIAM
When multiple data sources are available for clustering, an a priori data integration process is usually required. This process may be costly and may not lead to good clusterings,...
ICDM
2006
IEEE
15 years 5 months ago
2006
IEEE
The entity resolution (ER) problem, which identifies duplicate entities that refer to the same real world entity, is essential in many applications. In this paper, in particular,...
BPM
2009
Springer
15 years 6 months ago
2009
Springer
The goal of performance analysis of business processes is to gain insights into operational processes, for the purpose of optimizing them. To intuitively show which parts of the pr...