2600 search results - page 120 / 520 » Clustering with or without the Approximation |
145
click to vote
KDD
1998
ACM
15 years 10 months ago
1998
ACM
With the increase in information on the World Wide Web it has become difficult to quickly find desired information without using multiple queries or using a topic-specific search ...
192
click to vote
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
187
click to vote
ALMOB
2006
15 years 6 months ago
2006
Background: The sparse connectivity of protein-protein interaction data sets makes identification of functional modules challenging. The purpose of this study is to critically eva...
154
click to vote
ICDM
2003
IEEE
15 years 11 months ago
2003
IEEE
PixelMaps are a new pixel-oriented visual data mining technique for large spatial datasets. They combine kerneldensity-based clustering with pixel-oriented displays to emphasize c...
210
click to vote
DASFAA
2008
IEEE
16 years 27 days ago
2008
IEEE
Abstract. Recently, we have proposed a novel method for the compression of time series based on mathematical models that explore dependencies between different time series. This r...