Sciweavers

947 search results - page 108 / 190
» Evaluation of Sampling for Data Mining of Association Rules
Sort
View
SIGSOFT
2005
ACM
15 years 6 months ago
PR-Miner: automatically extracting implicit programming rules and detecting violations in large software code
Programs usually follow many implicit programming rules, most of which are too tedious to be documented by programmers. When these rules are violated by programmers who are unawar...
Zhenmin Li, Yuanyuan Zhou
101
Voted
ICDM
2007
IEEE
148views Data Mining» more  ICDM 2007»
15 years 4 months ago
Sample Selection for Maximal Diversity
The problem of selecting a sample subset sufficient to preserve diversity arises in many applications. One example is in the design of recombinant inbred lines (RIL) for genetic a...
Feng Pan, Adam Roberts, Leonard McMillan, David Th...
CINQ
2004
Springer
157views Database» more  CINQ 2004»
15 years 4 months ago
Inductive Databases and Multiple Uses of Frequent Itemsets: The cInQ Approach
Inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. With an IDB the user/analyst performs a set of very different operat...
Jean-François Boulicaut
107
Voted
ICDIM
2007
IEEE
15 years 7 months ago
Pattern-based decision tree construction
Learning classifiers has been studied extensively the last two decades. Recently, various approaches based on patterns (e.g., association rules) that hold within labeled data hav...
Dominique Gay, Nazha Selmaoui, Jean-Françoi...
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
15 years 4 months ago
A new version of the ant-miner algorithm discovering unordered rule sets
The Ant-Miner algorithm, first proposed by Parpinelli and colleagues, applies an ant colony optimization heuristic to the classification task of data mining to discover an ordered...
James Smaldon, Alex Alves Freitas