Sciweavers

2071 search results - page 254 / 415
» An Empirical Evaluation of LFG-DOP
Sort
View
KDD
2008
ACM
120views Data Mining» more  KDD 2008»
16 years 1 months ago
Multi-class cost-sensitive boosting with p-norm loss functions
We propose a family of novel cost-sensitive boosting methods for multi-class classification by applying the theory of gradient boosting to p-norm based cost functionals. We establ...
Aurelie C. Lozano, Naoki Abe
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
16 years 1 months ago
SCAN: a structural clustering algorithm for networks
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, Thomas A. J...
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
16 years 1 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
KDD
2004
ACM
302views Data Mining» more  KDD 2004»
16 years 1 months ago
Redundancy based feature selection for microarray data
In gene expression microarray data analysis, selecting a small number of discriminative genes from thousands of genes is an important problem for accurate classification of diseas...
Lei Yu, Huan Liu
KDD
2003
ACM
135views Data Mining» more  KDD 2003»
16 years 1 months ago
Efficiently handling feature redundancy in high-dimensional data
High-dimensional data poses a severe challenge for data mining. Feature selection is a frequently used technique in preprocessing high-dimensional data for successful data mining....
Lei Yu, Huan Liu