Sciweavers

156 search results - page 6 / 32
» The UCI KDD Archive of Large Data Sets for Data Mining Resea...
Sort
View
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
14 years 8 months ago
Cleaning disguised missing data: a heuristic approach
In some applications such as filling in a customer information form on the web, some missing values may not be explicitly represented as such, but instead appear as potentially va...
Ming Hua, Jian Pei
KDD
2004
ACM
147views Data Mining» more  KDD 2004»
14 years 1 months ago
Clustering time series from ARMA models with clipped data
Clustering time series is a problem that has applications in a wide variety of fields, and has recently attracted a large amount of research. In this paper we focus on clustering...
Anthony J. Bagnall, Gareth J. Janacek
KDD
2006
ACM
142views Data Mining» more  KDD 2006»
14 years 8 months ago
Mining distance-based outliers from large databases in any metric space
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
Yufei Tao, Xiaokui Xiao, Shuigeng Zhou
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
14 years 8 months ago
Mining coherent gene clusters from gene-sample-time microarray data
Extensive studies have shown that mining microarray data sets is important in bioinformatics research and biomedical applications. In this paper, we explore a novel type of genesa...
Daxin Jiang, Jian Pei, Murali Ramanathan, Chun Tan...
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
14 years 8 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth