Sciweavers

513 search results - page 25 / 103
» Efficient search for association rules
Sort
View
79
Voted
APPINF
2003
14 years 11 months ago
Fast Frequent Itemset Mining using Compressed Data Representation
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
Raj P. Gopalan, Yudho Giri Sucahyo
AUSAI
2005
Springer
15 years 3 months ago
K-Optimal Pattern Discovery: An Efficient and Effective Approach to Exploratory Data Mining
Most data-mining techniques seek a single model that optimizes an objective function with respect to the data. In many real-world applications several models will equally optimize...
Geoffrey I. Webb
BMCBI
2010
149views more  BMCBI 2010»
14 years 9 months ago
KID - an algorithm for fast and efficient text mining used to automatically generate a database containing kinetic information o
Background: The amount of available biological information is rapidly increasing and the focus of biological research has moved from single components to networks and even larger ...
Stephanie Heinen, Bernhard Thielen, Dietmar Schomb...
KDD
2002
ACM
150views Data Mining» more  KDD 2002»
15 years 10 months ago
Querying multiple sets of discovered rules
Rule mining is an important data mining task that has been applied to numerous real-world applications. Often a rule mining system generates a large number of rules and only a sma...
Alexander Tuzhilin, Bing Liu
ICSE
2008
IEEE-ACM
15 years 9 months ago
Formal concept analysis applied to fault localization
One time-consuming task in the development of software is debugging. Recent work in fault localization crosschecks traces of correct and failing execution traces, it implicitly se...
Peggy Cellier