Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVerma, Keshri-
dc.contributor.authorVyas, O P-
dc.description.abstractAssociationship 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.en_US
dc.publisherINFLIBNET Centreen_US
dc.subjectData Miningen_US
dc.subjectTemporal Data Miningen_US
dc.subjectTemporal Association Ruleen_US
dc.subjectFrequent Pattern Approachen_US
dc.titleTemporal Association Rule Using Without Candidate Generationen_US
Appears in Collections:CALIBER 2005:Kochi

Files in This Item:
File Description SizeFormat 
35.pdf227.63 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.