Sciweavers

1051 search results - page 153 / 211
» An algorithm for the principal component analysis of large d...
Sort
View
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
14 years 5 months ago
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-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
ICDE
2007
IEEE
182views Database» more  ICDE 2007»
14 years 9 months ago
Discriminative Frequent Pattern Analysis for Effective Classification
The application of frequent patterns in classification appeared in sporadic studies and achieved initial success in the classification of relational data, text documents and graph...
Hong Cheng, Xifeng Yan, Jiawei Han, Chih-Wei Hsu
ICMCS
2009
IEEE
140views Multimedia» more  ICMCS 2009»
13 years 6 months ago
Resource-adaptive multimedia analysis on stream mining systems
Large-scale multimedia semantic concept detection requires realtime identification of a set of concepts in streaming video or large image datasets. The potentially high data volum...
Deepak S. Turaga, Rong Yan, Olivier Verscheure, Br...
IPPS
2008
IEEE
14 years 2 months ago
Parallel mining of closed quasi-cliques
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
Yuzhou Zhang, Jianyong Wang, Zhiping Zeng, Lizhu Z...
CORR
2011
Springer
183views Education» more  CORR 2011»
13 years 3 days ago
Learning When Training Data are Costly: The Effect of Class Distribution on Tree Induction
For large, real-world inductive learning problems, the number of training examples often must be limited due to the costs associated with procuring, preparing, and storing the tra...
Foster J. Provost, Gary M. Weiss