Sciweavers

1683 search results - page 328 / 337
» Learning with Mixtures of Trees
Sort
View
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 8 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
14 years 8 months ago
Camouflaged fraud detection in domains with complex relationships
We describe a data mining system to detect frauds that are camouflaged to look like normal activities in domains with high number of known relationships. Examples include accounti...
Sankar Virdhagriswaran, Gordon Dakin
KDD
2003
ACM
149views Data Mining» more  KDD 2003»
14 years 8 months ago
Knowledge-based data mining
We describe techniques for combining two types of knowledge systems: expert and machine learning. Both the expert system and the learning system represent information by logical d...
Søren Damgaard, Sholom M. Weiss, Shubir Kap...
WSDM
2009
ACM
161views Data Mining» more  WSDM 2009»
14 years 2 months ago
Predicting the readability of short web summaries
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
Tapas Kanungo, David Orr
ICB
2007
Springer
683views Biometrics» more  ICB 2007»
14 years 1 months ago
Face Detection Based on Multi-Block LBP Representation
Effective and real-time face detection has been made possible by using the method of rectangle Haar-like features with AdaBoost learning since Viola and Jones’ work [12]. In this...
Lun Zhang, Rufeng Chu, Shiming Xiang, ShengCai Lia...