Sciweavers

853 search results - page 133 / 171
» Are many small sets explicitly small
Sort
View
WWW
2006
ACM
14 years 11 months ago
Interactive wrapper generation with minimal user effort
While much of the data on the web is unstructured in nature, there is also a significant amount of embedded structured data, such as product information on e-commerce sites or sto...
Utku Irmak, Torsten Suel
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
14 years 11 months ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...
KDD
2008
ACM
264views Data Mining» more  KDD 2008»
14 years 11 months ago
Stable feature selection via dense feature groups
Many feature selection algorithms have been proposed in the past focusing on improving classification accuracy. In this work, we point out the importance of stable feature selecti...
Lei Yu, Chris H. Q. Ding, Steven Loscalzo
KDD
2004
ACM
118views Data Mining» more  KDD 2004»
14 years 11 months ago
Parallel computation of high dimensional robust correlation and covariance matrices
The computation of covariance and correlation matrices are critical to many data mining applications and processes. Unfortunately the classical covariance and correlation matrices...
James Chilson, Raymond T. Ng, Alan Wagner, Ruben H...
KDD
2004
ACM
144views Data Mining» more  KDD 2004»
14 years 11 months ago
IncSpan: incremental mining of sequential patterns in large database
Many real life sequence databases, such as customer shopping sequences, medical treatment sequences, etc., grow incrementally. It is undesirable to mine sequential patterns from s...
Hong Cheng, Xifeng Yan, Jiawei Han