Sciweavers

110 search results - page 16 / 22
» kdd 2005
Sort
View
KDD
2005
ACM
91views Data Mining» more  KDD 2005»
14 years 10 months ago
On mining cross-graph quasi-cliques
Joint mining of multiple data sets can often discover interesting, novel, and reliable patterns which cannot be obtained solely from any single source. For example, in cross-marke...
Jian Pei, Daxin Jiang, Aidong Zhang
KDD
2005
ACM
147views Data Mining» more  KDD 2005»
14 years 3 months ago
Combining proactive and reactive predictions for data streams
Mining data streams is important in both science and commerce. Two major challenges are (1) the data may grow without limit so that it is difficult to retain a long history; and (...
Ying Yang, Xindong Wu, Xingquan Zhu
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
14 years 10 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
146views Data Mining» more  KDD 2005»
14 years 10 months ago
Anonymity-preserving data collection
Protection of privacy has become an important problem in data mining. In particular, individuals have become increasingly unwilling to share their data, frequently resulting in in...
Zhiqiang Yang, Sheng Zhong, Rebecca N. Wright
KDD
2005
ACM
149views Data Mining» more  KDD 2005»
14 years 3 months ago
A distributed learning framework for heterogeneous data sources
We present a probabilistic model-based framework for distributed learning that takes into account privacy restrictions and is applicable to scenarios where the different sites ha...
Srujana Merugu, Joydeep Ghosh