Sciweavers

156 search results - page 2 / 32
» The UCI KDD Archive of Large Data Sets for Data Mining Resea...
Sort
View
KDD
1997
ACM
92views Data Mining» more  KDD 1997»
13 years 9 months ago
Increasing the Efficiency of Data Mining Algorithms with Breadth-First Marker Propagation
This paper describes how to increase the efficiency of inductive data mining algorithms by replacing the central matching operation with a marker propagation technique. Breadth-fi...
John M. Aronis, Foster J. Provost
KDD
2003
ACM
152views Data Mining» more  KDD 2003»
14 years 5 months ago
Interactive exploration of coherent patterns in time-series gene expression data
Discovering coherent gene expression patterns in time-series gene expression data is an important task in bioinformatics research and biomedical applications. In this paper, we pr...
Daxin Jiang, Jian Pei, Aidong Zhang
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
ICPR
2006
IEEE
14 years 5 months ago
Feature selection for linear support vector machines
Feature selection is attracted much interest from researchers in many fields such as pattern recognition and data mining. In this paper, a novel algorithm for feature selection is...
Zhizheng Liang, Tuo Zhao
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
13 years 8 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar