Sciweavers

4085 search results - page 400 / 817
» Benchmarking Data Mining Algorithms
Sort
View
CINQ
2004
Springer
138views Database» more  CINQ 2004»
15 years 10 months ago
Relevancy in Constraint-Based Subgroup Discovery
This chapter investigates subgroup discovery as a task of constraint-based mining of local patterns, aimed at describing groups of individuals with unusual distributional character...
Nada Lavrac, Dragan Gamberger
SAC
2005
ACM
15 years 10 months ago
Rearranging data objects for efficient and stable clustering
When a partitional structure is derived from a data set using a data mining algorithm, it is not unusual to have a different set of outcomes when it runs with a different order of...
Gyesung Lee, Xindong Wu, Jinho Chon
PKDD
2004
Springer
90views Data Mining» more  PKDD 2004»
15 years 10 months ago
Shape and Size Regularization in Expectation Maximization and Fuzzy Clustering
The more sophisticated fuzzy clustering algorithms, like the Gustafson–Kessel algorithm [11] and the fuzzy maximum likelihood estimation (FMLE) algorithm [10] offer the possibil...
Christian Borgelt, Rudolf Kruse
158
Voted
PRIB
2009
Springer
100views Bioinformatics» more  PRIB 2009»
15 years 11 months ago
Evidence-Based Clustering of Reads and Taxonomic Analysis of Metagenomic Data
Abstract. The rapidly emerging field of metagenomics seeks to examine the genomic content of communities of organisms to understand their roles and interactions in an ecosystem. I...
Gianluigi Folino, Fabio Gori, Mike S. M. Jetten, E...
149
Voted
CIKM
2008
Springer
15 years 6 months ago
REDUS: finding reducible subspaces in high dimensional data
Finding latent patterns in high dimensional data is an important research problem with numerous applications. The most well known approaches for high dimensional data analysis are...
Xiang Zhang, Feng Pan, Wei Wang 0010