732 search results - page 38 / 147 » Efficient Frequent Pattern Mining in Relational Databases |
JCST
2008
13 years 7 months ago
2008
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
DASFAA
2007
IEEE
2007
IEEE
LAPIN: Effective Sequential Pattern Mining Algorithms by Last Position Induction for Dense Databases
14 years 2 months ago
Sequential pattern mining is very important because it is the basis of many applications. Although there has been a great deal of effort on sequential pattern mining in recent year...
JCIT
2008
13 years 7 months ago
2008
This paper presents an efficient One Pass Association Mining technique i.e. OPAM, which finds all the frequent itemsets without generating any candidate sets. OPAM is basically an...
ADBIS
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. One of the most important data mining tasks is discovery of frequently occurring patterns in sequences of events. Many algorithms for finding various patterns in sequenti...
ADBIS
2003
Springer
14 years 28 days ago
2003
Springer
Data mining queries are often submitted concurrently to the data mining system. The data mining system should take advantage of overlapping of the mined datasets. In this paper we ...