Sciweavers

4085 search results - page 314 / 817
» Benchmarking Data Mining Algorithms
Sort
View
CINQ
2004
Springer
133views Database» more  CINQ 2004»
15 years 8 months ago
Inductive Querying for Discovering Subgroups and Clusters
We introduce the problem of cluster-grouping and show that it integrates several important data mining tasks, i.e. subgroup discovery, mining correlated patterns and aspects from c...
Albrecht Zimmermann, Luc De Raedt
SDM
2008
SIAM
121views Data Mining» more  SDM 2008»
15 years 5 months ago
Integration of Multiple Networks for Robust Label Propagation
Transductive inference on graphs such as label propagation algorithms is receiving a lot of attention. In this paper, we address a label propagation problem on multiple networks a...
Tsuyoshi Kato, Hisashi Kashima, Masashi Sugiyama
GECCO
2010
Springer
338views Optimization» more  GECCO 2010»
15 years 2 months ago
Multiobjective evolutionary community detection for dynamic networks
A multiobjective genetic algorithm for detecting communities in dynamic networks, i.e., networks that evolve over time, is proposed. The approach leverages on the concept of evolu...
Francesco Folino, Clara Pizzuti
SDM
2004
SIAM
207views Data Mining» more  SDM 2004»
15 years 5 months ago
BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
Jianyong Wang, George Karypis
ICDM
2008
IEEE
96views Data Mining» more  ICDM 2008»
15 years 10 months ago
Filling in the Blanks - Krimp Minimisation for Missing Data
Many data sets are incomplete. For correct analysis of such data, one can either use algorithms that are designed to handle missing data or use imputation. Imputation has the bene...
Jilles Vreeken, Arno Siebes