Sciweavers

KDD
2007
ACM
144views Data Mining» more  KDD 2007»
14 years 5 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
KDD
2007
ACM
155views Data Mining» more  KDD 2007»
14 years 5 months ago
A framework for community identification in dynamic social networks
We propose frameworks and algorithms for identifying communities in social networks that change over time. Communities are intuitively characterized as "unusually densely kni...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf, D...
KDD
2007
ACM
149views Data Mining» more  KDD 2007»
14 years 5 months ago
Partial example acquisition in cost-sensitive learning
It is often expensive to acquire data in real-world data mining applications. Most previous data mining and machine learning research, however, assumes that a fixed set of trainin...
Victor S. Sheng, Charles X. Ling
KDD
2007
ACM
170views Data Mining» more  KDD 2007»
14 years 5 months ago
From frequent itemsets to semantically meaningful visual patterns
Data mining techniques that are successful in transaction and text data may not be simply applied to image data that contain high-dimensional features and have spatial structures....
Junsong Yuan, Ying Wu, Ming Yang
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
14 years 5 months ago
SCAN: a structural clustering algorithm for networks
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, Thomas A. J...
KDD
2007
ACM
153views Data Mining» more  KDD 2007»
14 years 5 months ago
Exploiting duality in summarization with deterministic guarantees
Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic q...
Panagiotis Karras, Dimitris Sacharidis, Nikos Mamo...
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 5 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
KDD
2007
ACM
136views Data Mining» more  KDD 2007»
14 years 5 months ago
Information genealogy: uncovering the flow of ideas in non-hyperlinked document databases
We now have incrementally-grown databases of text documents ranging back for over a decade in areas ranging from personal email, to news-articles and conference proceedings. While...
Benyah Shaparenko, Thorsten Joachims
KDD
2007
ACM
112views Data Mining» more  KDD 2007»
14 years 5 months ago
Statistical change detection for multi-dimensional data
This paper deals with detecting change of distribution in multi-dimensional data sets. For a given baseline data set and a set of newly observed data points, we define a statistic...
Xiuyao Song, Mingxi Wu, Christopher M. Jermaine, S...