Sciweavers

IPPS
2010
IEEE
13 years 2 months ago
Attack-resistant frequency counting
We present collaborative peer-to-peer algorithms for the problem of approximating frequency counts for popular items distributed across the peers of a large-scale network. Our alg...
Bo Wu, Jared Saia, Valerie King
SIGKDD
2002
83views more  SIGKDD 2002»
13 years 4 months ago
Towards Effective and Interpretable Data Mining by Visual Interaction
The primary aim of most data mining algorithms is to facilitate the discovery of concise and interpretable information from large amounts of data. However, many of the current for...
Charu C. Aggarwal
KAIS
2008
99views more  KAIS 2008»
13 years 4 months ago
Privacy-preserving SVM classification
Classical data mining algorithms implicitly assume complete access to all data, either in centralized or federated form. However, privacy and security concerns often prevent sharin...
Jaideep Vaidya, Hwanjo Yu, Xiaoqian Jiang
KDD
1998
ACM
190views Data Mining» more  KDD 1998»
13 years 8 months ago
Mining Segment-Wise Periodic Patterns in Time-Related Databases
Periodicity search, that is, searchfor cyclicity in time-related databases, is an interesting data mining problem. Mostprevious studies have been on finding full-cycle periodicity...
Jiawei Han, Wan Gong, Yiwen Yin
ICDM
2003
IEEE
141views Data Mining» more  ICDM 2003»
13 years 9 months ago
Association Rule Mining in Peer-to-Peer Systems
We extend the problem of association rule mining – a key data mining problem – to systems in which the database is partitioned among a very large number of computers that are ...
Ran Wolff, Assaf Schuster
ICDM
2008
IEEE
175views Data Mining» more  ICDM 2008»
13 years 11 months ago
Overlapping Matrix Pattern Visualization: A Hypergraph Approach
In this work, we study a visual data mining problem: Given a set of discovered overlapping submatrices of interest, how can we order the rows and columns of the data matrix to bes...
Ruoming Jin, Yang Xiang, David Fuhry, Feodor F. Dr...
MLDM
2009
Springer
13 years 11 months ago
The Needles-in-Haystack Problem
We consider a new data mining problem of detecting the members of a rare class of data, the needles, that have been hidden in a set of records, the haystack. Besides the haystack, ...
Katherine Moreland, Klaus Truemper
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
14 years 5 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
146views Data Mining» more  KDD 2005»
14 years 5 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
91views Data Mining» more  KDD 2005»
14 years 5 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