Sciweavers

319 search results - page 48 / 64
» Algorithms for Mining Distance-Based Outliers in Large Datas...
Sort
View
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
15 years 10 months ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
14 years 7 months ago
Efficient and Numerically Stable Sparse Learning
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
Sihong Xie, Wei Fan, Olivier Verscheure, Jiangtao ...
ADMA
2010
Springer
271views Data Mining» more  ADMA 2010»
14 years 5 months ago
Exploiting Concept Clumping for Efficient Incremental E-Mail Categorization
We introduce a novel approach to incremental e-mail categorization based on identifying and exploiting "clumps" of messages that are classified similarly. Clumping reflec...
Alfred Krzywicki, Wayne Wobcke
ICDM
2009
IEEE
120views Data Mining» more  ICDM 2009»
15 years 4 months ago
Least Square Incremental Linear Discriminant Analysis
Abstract—Linear discriminant analysis (LDA) is a wellknown dimension reduction approach, which projects highdimensional data into a low-dimensional space with the best separation...
Li-Ping Liu, Yuan Jiang, Zhi-Hua Zhou
ICDM
2010
IEEE
127views Data Mining» more  ICDM 2010»
14 years 8 months ago
Learning Markov Network Structure with Decision Trees
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
Daniel Lowd, Jesse Davis