732 search results - page 40 / 147 » Efficient Frequent Pattern Mining in Relational Databases |
COMPUTE
2010
ACM
14 years 1 days ago
2010
ACM
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
AUSDM
2007
Springer
14 years 1 months ago
2007
Springer
Frequent subtree mining has attracted a great deal of interest among the researchers due to its application in a wide variety of domains. Some of the domains include bio informati...
SIGKDD
2010
13 years 2 months ago
2010
This paper suggests a framework for mining subjectively interesting pattern sets that is based on two components: (1) the encoding of prior information in a model for the data min...
SPAA
1997
ACM
13 years 12 months ago
1997
ACM
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
KDD
2010
ACM
13 years 11 months ago
2010
ACM
Concise representations of frequent itemsets sacrifice readability and direct interpretability by a data analyst of the concise patterns extracted. In this paper, we introduce an...