165 search results - page 28 / 33 » Discovering Frequent Closed Itemsets for Association Rules |
DKE
2002
13 years 7 months ago
2002
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
KDD
2005
ACM
14 years 1 months ago
2005
ACM
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
ADC
2003
Springer
14 years 28 days ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
We present a prototype of an inductive database. Our system enables the user to query not only the data stored in the database but also generalizations (e.g. rules or trees) over ...
AI
2003
Springer
14 years 28 days ago
2003
Springer
Discovering association rules is one of the important tasks in data mining. While most of the existing algorithms are developed for efficient mining of frequent patterns, it has be...