Sciweavers

12863 search results - page 934 / 2573
» Dynamic Data Mining
Sort
View
KDD
2006
ACM
146views Data Mining» more  KDD 2006»
16 years 8 months ago
Structure and evolution of online social networks
In this paper, we consider the evolution of structure within large online social networks. We present a series of measurements of two such networks, together comprising in excess ...
Ravi Kumar, Jasmine Novak, Andrew Tomkins
KDD
2005
ACM
112views Data Mining» more  KDD 2005»
16 years 8 months ago
Model-based overlapping clustering
While the vast majority of clustering algorithms are partitional, many real world datasets have inherently overlapping clusters. Several approaches to finding overlapping clusters...
Arindam Banerjee, Chase Krumpelman, Joydeep Ghosh,...
KDD
2005
ACM
142views Data Mining» more  KDD 2005»
16 years 8 months ago
Towards exploratory test instance specific algorithms for high dimensional classification
In an interactive classification application, a user may find it more valuable to develop a diagnostic decision support method which can reveal significant classification behavior...
Charu C. Aggarwal
KDD
2009
ACM
169views Data Mining» more  KDD 2009»
16 years 2 months ago
On burstiness-aware search for document sequences
As the number and size of large timestamped collections (e.g. sequences of digitized newspapers, periodicals, blogs) increase, the problem of efficiently indexing and searching su...
Theodoros Lappas, Benjamin Arai, Manolis Platakis,...
ICDM
2009
IEEE
109views Data Mining» more  ICDM 2009»
16 years 2 months ago
Finding Associations and Computing Similarity via Biased Pair Sampling
Sampling-based methods have previously been proposed for the problem of finding interesting associations in data, even for low-support items. While these methods do not guarantee ...
Andrea Campagna, Rasmus Pagh