Sciweavers

KDD
2006
ACM
156views Data Mining» more  KDD 2006»
14 years 5 months ago
Discovering significant OPSM subspace clusters in massive gene expression data
Order-preserving submatrixes (OPSMs) have been accepted as a biologically meaningful subspace cluster model, capturing the general tendency of gene expressions across a subset of ...
Byron J. Gao, Obi L. Griffith, Martin Ester, Steve...
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
14 years 5 months ago
Estimating the global pagerank of web communities
Localized search engines are small-scale systems that index a particular community on the web. They offer several benefits over their large-scale counterparts in that they are rel...
Jason V. Davis, Inderjit S. Dhillon
KDD
2006
ACM
174views Data Mining» more  KDD 2006»
14 years 5 months ago
Onboard classifiers for science event detection on a remote sensing spacecraft
Typically, data collected by a spacecraft is downlinked to Earth and pre-processed before any analysis is performed. We have developed classifiers that can be used onboard a space...
Ashley Davies, Benjamin Cichy, Dominic Mazzoni, Ng...
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
14 years 5 months ago
Single-pass online learning: performance, voting schemes and online feature selection
To learn concepts over massive data streams, it is essential to design inference and learning methods that operate in real time with limited memory. Online learning methods such a...
Vitor R. Carvalho, William W. Cohen
KDD
2006
ACM
123views Data Mining» more  KDD 2006»
14 years 5 months ago
Mining rank-correlated sets of numerical attributes
We study the mining of interesting patterns in the presence of numerical attributes. Instead of the usual discretization methods, we propose the use of rank based measures to scor...
Toon Calders, Bart Goethals, Szymon Jaroszewicz
11
Voted
KDD
2006
ACM
170views Data Mining» more  KDD 2006»
14 years 5 months ago
Classification features for attack detection in collaborative recommender systems
Collaborative recommender systems are highly vulnerable to attack. Attackers can use automated means to inject a large number of biased profiles into such a system, resulting in r...
Robin D. Burke, Bamshad Mobasher, Chad Williams, R...
KDD
2006
ACM
107views Data Mining» more  KDD 2006»
14 years 5 months ago
Out-of-core frequent pattern mining on a commodity PC
In this work we focus on the problem of frequent itemset mining on large, out-of-core data sets. After presenting a characterization of existing out-of-core frequent itemset minin...
Gregory Buehrer, Srinivasan Parthasarathy, Amol Gh...
KDD
2006
ACM
153views Data Mining» more  KDD 2006»
14 years 5 months ago
Model compression
Often the best performing supervised learning models are ensembles of hundreds or thousands of base-level classifiers. Unfortunately, the space required to store this many classif...
Cristian Bucila, Rich Caruana, Alexandru Niculescu...
KDD
2006
ACM
130views Data Mining» more  KDD 2006»
14 years 5 months ago
Efficient anonymity-preserving data collection
The output of a data mining algorithm is only as good as its inputs, and individuals are often unwilling to provide accurate data about sensitive topics such as medical history an...
Justin Brickell, Vitaly Shmatikov
KDD
2006
ACM
170views Data Mining» more  KDD 2006»
14 years 5 months ago
Computer aided detection via asymmetric cascade of sparse hyperplane classifiers
This paper describes a novel classification method for computer aided detection (CAD) that identifies structures of interest from medical images. CAD problems are challenging larg...
Jinbo Bi, Senthil Periaswamy, Kazunori Okada, Tosh...