Sciweavers

917 search results - page 23 / 184
» Mining interesting sets and rules in relational databases
Sort
View
KDD
1997
ACM
135views Data Mining» more  KDD 1997»
13 years 11 months ago
Brute-Force Mining of High-Confidence Classification Rules
This paper investigates a brute-force technique for mining classification rules from large data sets. We employ an association rule miner enhanced with new pruning strategies to c...
Roberto J. Bayardo Jr.
ECAI
2000
Springer
14 years 21 hour ago
Data Set Editing by Ordered Projection
In this paper, an editing algorithm based on the projection of the examples in each dimension is presented. The algorithm, that we have called EOP (Editing by Ordered Projection) h...
Jesús S. Aguilar-Ruiz, José Crist&oa...
ICTAI
2007
IEEE
14 years 2 months ago
Exploratory Quantitative Contrast Set Mining: A Discretization Approach
Contrast sets have been shown to be a useful tool for describing differences between groups. A contrast set is a set of association rules for which the antecedents describe distin...
Mondelle Simeon, Robert J. Hilderman
GFKL
2005
Springer
105views Data Mining» more  GFKL 2005»
14 years 1 months ago
Implications of Probabilistic Data Modeling for Mining Association Rules
Mining association rules is an important technique for discovering meaningful patterns in transaction databases. In the current literature, the properties of algorithms to mine ass...
Michael Hahsler, Kurt Hornik, Thomas Reutterer
IDEAL
2003
Springer
14 years 27 days ago
Experiences of Using a Quantitative Approach for Mining Association Rules
In recent years interest has grown in “mining” large databases to extract novel and interesting information. Knowledge Discovery in Databases (KDD) has been recognised as an em...
L. Dong, Christos Tjortjis