Browsing CALIBER 2005:Kochi by Subject "Data Mining"
Now showing items 1-3 of 3
-
Hemalatha, R; Krishnan, A; Hemamathi, R (INFLIBNET Centre, February 2, 2005)[more][less]
Abstract: Correlated The discovery of association rules is an important problem in data mining. It is a two-step process consisting of finding the frequent itemsets and generating association rules from them. Most of the research attention is focused on efficient methods of finding frequent itemsets because it is computationally the most expensive step. This paper presents a new data structure and a more efficient algorithm for mining frequent itemsets from typical data sets. The improvement is achieved by scanning the database just once and by reducing item traversals within transactions. The performance comparisons of the algorithm against the fastest Apriori implementation and the recently developed H-Mine algorithm are given here. These results show that the algorithm outperforms both Apriori and H-mine on several widely used test data sets. URI: http://hdl.handle.net/1944/1536 Files in this item: 1
34.pdf (44.98Kb) -
Hemalatha, R; Krishnan, A; Senthamarai, C; Hemamalini, R (INFLIBNET Centre, February 2, 2005)[more][less]
Abstract: Correlated pattern mining has become increasingly important recently as an alternative or an augmentation of association rule mining. Though correlated pattern mining discloses the correlation relationships among data objects and reduces significantly the number of patterns produced by the association mining, it still generates quite a large number of patterns. This paper proposes closed correlated pattern mining to reduce the number of the correlated patterns produced without information loss. A new notion of the confidenceclosed correlated patterns is proposed first, and then an efficient algorithm is present, called CCMine, for mining those patterns. Confidence closed pattern mining reduces the number of patterns by at least an order of magnitude. It also shows that CCMine outperforms a simple method making use of the traditional closed pattern miner. Confidence-closed pattern mining is a valuable approach to condensing correlated patterns. URI: http://hdl.handle.net/1944/1535 Files in this item: 1
33.pdf (136.3Kb) -
Verma, Keshri; Vyas, O P (INFLIBNET Centre, February 2, 2005)[more][less]
Abstract: Associationship is an important component of data mining. In real world, the knowledge used for mining rule is almost time varying. The items have the dynamic characteristic in terms of transaction, which have seasonal selling rate and it holds time-based associationship with another item. In database, some items which are infrequent in whole dataset may be frequent in a particular time period. If these items are ignored then associationship result will no longer be accurate. To restrict the time based associationship, calendar based pattern can be used [5]. Calendar units such as months and days, clock units, such as hours and seconds & specialized units , such as business days and academic years, play a major role in a wide range of information system applications.[11] Our focus is to find effective time sensitive algorithm for mining associationship by extending frequent pattern tree approach [3]. This algorithm reduces the time complexity of existing technique[5]. It also uses the advantages of divide & conquer method to decompose the mining task into a smaller tasks for database. URI: http://hdl.handle.net/1944/1537 Files in this item: 1
35.pdf (233.0Kb)
Now showing items 1-3 of 3