Sciweavers

KDD
2005
ACM
157views Data Mining» more  KDD 2005»
14 years 9 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
14 years 9 months ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li
KDD
2005
ACM
182views Data Mining» more  KDD 2005»
14 years 9 months ago
Making holistic schema matching robust: an ensemble approach
The Web has been rapidly "deepened" by myriad searchable databases online, where data are hidden behind query interfaces. As an essential task toward integrating these m...
Bin He, Kevin Chen-Chuan Chang
KDD
2005
ACM
90views Data Mining» more  KDD 2005»
14 years 9 months ago
Variable latent semantic indexing
Anirban Dasgupta, Ravi Kumar, Prabhakar Raghavan, ...
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
14 years 9 months ago
Scalable discovery of hidden emails from large folders
The popularity of email has triggered researchers to look for ways to help users better organize the enormous amount of information stored in their email folders. One challenge th...
Giuseppe Carenini, Raymond T. Ng, Xiaodong Zhou
KDD
2005
ACM
170views Data Mining» more  KDD 2005»
14 years 9 months ago
Parallel mining of closed sequential patterns
Discovery of sequential patterns is an essential data mining task with broad applications. Among several variations of sequential patterns, closed sequential pattern is the most u...
Shengnan Cong, Jiawei Han, David A. Padua
KDD
2005
ACM
141views Data Mining» more  KDD 2005»
14 years 9 months ago
Fast window correlations over uncooperative time series
Richard Cole, Dennis Shasha, Xiaojian Zhao
KDD
2005
ACM
142views Data Mining» more  KDD 2005»
14 years 9 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
2005
ACM
112views Data Mining» more  KDD 2005»
14 years 9 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
2006
ACM
253views Data Mining» more  KDD 2006»
14 years 9 months ago
Adaptive Website Design Using Caching Algorithms
Visitors enter a website through a variety of means, including web searches, links from other sites, and personal bookmarks. In some cases the first page loaded satisfies the visi...
Justin Brickell, Inderjit S. Dhillon, Dharmendra S...