V. Radhakrishna, Puligadda Veereswara Kumar, V. Janaki
{"title":"A Novel Approach for Mining Similarity Profiled Temporal Association Patterns Using Venn Diagrams","authors":"V. Radhakrishna, Puligadda Veereswara Kumar, V. Janaki","doi":"10.1145/2832987.2833071","DOIUrl":null,"url":null,"abstract":"The problem of mining frequent patterns in a static database is studied extensively in the literature by many researchers. Conventional frequent pattern algorithms are not applicable to find frequent patterns from the temporal database. Temporal database is a database which can store past, present and future information. A temporal relation may be viewed as a database of time invariant and time variant relation instances. The objective of this research is to come up with a novel approach so as to find the temporal association patterns similar to a given reference support sequence and user defined threshold using the concept of Venn diagrams. The proposed approach scans the temporal database only once to find the temporal association patterns and hence reduces the huge overhead incurred when the database is scanned multiple times.","PeriodicalId":416001,"journal":{"name":"Proceedings of the The International Conference on Engineering & MIS 2015","volume":"216 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"61","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the The International Conference on Engineering & MIS 2015","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2832987.2833071","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 61
Abstract
The problem of mining frequent patterns in a static database is studied extensively in the literature by many researchers. Conventional frequent pattern algorithms are not applicable to find frequent patterns from the temporal database. Temporal database is a database which can store past, present and future information. A temporal relation may be viewed as a database of time invariant and time variant relation instances. The objective of this research is to come up with a novel approach so as to find the temporal association patterns similar to a given reference support sequence and user defined threshold using the concept of Venn diagrams. The proposed approach scans the temporal database only once to find the temporal association patterns and hence reduces the huge overhead incurred when the database is scanned multiple times.