Sciweavers

4085 search results - page 222 / 817
» Benchmarking Data Mining Algorithms
Sort
View
135
Voted
ICCS
2007
Springer
15 years 9 months ago
Mining Frequent Closed Unordered Trees Through Natural Representations
Abstract. Many knowledge representation mechanisms consist of linkbased structures; they may be studied formally by means of unordered trees. Here we consider the case where labels...
José L. Balcázar, Albert Bifet, Anto...
151
Voted
HPCC
2005
Springer
15 years 9 months ago
High Performance Subgraph Mining in Molecular Compounds
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...
Giuseppe Di Fatta, Michael R. Berthold
100
Voted
ICDM
2009
IEEE
109views Data Mining» more  ICDM 2009»
15 years 10 months ago
Finding Associations and Computing Similarity via Biased Pair Sampling
Sampling-based methods have previously been proposed for the problem of finding interesting associations in data, even for low-support items. While these methods do not guarantee ...
Andrea Campagna, Rasmus Pagh
157
Voted
SDM
2007
SIAM
137views Data Mining» more  SDM 2007»
15 years 5 months ago
Semi-supervised Feature Selection via Spectral Analysis
Feature selection is an important task in effective data mining. A new challenge to feature selection is the so-called “small labeled-sample problem” in which labeled data is...
Zheng Zhao, Huan Liu
ICDM
2009
IEEE
154views Data Mining» more  ICDM 2009»
15 years 1 months ago
GSML: A Unified Framework for Sparse Metric Learning
There has been significant recent interest in sparse metric learning (SML) in which we simultaneously learn both a good distance metric and a low-dimensional representation. Unfor...
Kaizhu Huang, Yiming Ying, Colin Campbell