Sciweavers

KDD
2005
ACM
139views Data Mining» more  KDD 2005»
14 years 9 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
KDD
2005
ACM
122views Data Mining» more  KDD 2005»
14 years 9 months ago
Pattern lattice traversal by selective jumps
Regardless of the frequent patterns to discover, either the full frequent patterns or the condensed ones, either closed or maximal, the strategy always includes the traversal of t...
Osmar R. Zaïane, Mohammad El-Hajj
KDD
2005
ACM
143views Data Mining» more  KDD 2005»
14 years 9 months ago
SVM selective sampling for ranking with application to data retrieval
Learning ranking (or preference) functions has been a major issue in the machine learning community and has produced many applications in information retrieval. SVMs (Support Vect...
Hwanjo Yu
KDD
2005
ACM
146views Data Mining» more  KDD 2005»
14 years 9 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
145views Data Mining» more  KDD 2005»
14 years 9 months ago
Streaming feature selection using alpha-investing
Jing Zhou, Dean P. Foster, Robert A. Stine, Lyle H...
KDD
2005
ACM
137views Data Mining» more  KDD 2005»
14 years 9 months ago
A generalized framework for mining spatio-temporal patterns in scientific data
In this paper, we present a general framework to discover spatial associations and spatio-temporal episodes for scientific datasets. In contrast to previous work in this area, fea...
Hui Yang, Srinivasan Parthasarathy, Sameep Mehta
KDD
2005
ACM
109views Data Mining» more  KDD 2005»
14 years 9 months ago
A new scheme on privacy-preserving data classification
We address privacy-preserving classification problem in a distributed system. Randomization has been the approach proposed to preserve privacy in such scenario. However, this appr...
Nan Zhang 0004, Shengquan Wang, Wei Zhao
KDD
2005
ACM
92views Data Mining» more  KDD 2005»
14 years 9 months ago
Summarizing itemset patterns: a profile-based approach
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
Xifeng Yan, Hong Cheng, Jiawei Han, Dong Xin
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
14 years 9 months ago
CLICKS: an effective algorithm for mining subspace clusters in categorical datasets
We present a novel algorithm called Clicks, that finds clusters in categorical datasets based on a search for k-partite maximal cliques. Unlike previous methods, Clicks mines subs...
Mohammed Javeed Zaki, Markus Peters, Ira Assent, T...
KDD
2005
ACM
109views Data Mining» more  KDD 2005»
14 years 9 months ago
Formulating distance functions via the kernel trick
Tasks of data mining and information retrieval depend on a good distance function for measuring similarity between data instances. The most effective distance function must be for...
Gang Wu, Edward Y. Chang, Navneet Panda