通过应用多个约束挖掘基于间隔的事件的顺序模式

Q4 Computer Science

International Journal of Computer Science and Applications Pub Date : 2014-08-31 DOI:10.5121/IJCSA.2014.4406

Kalaivany M, U. V.

{"title":"通过应用多个约束挖掘基于间隔的事件的顺序模式","authors":"Kalaivany M, U. V.","doi":"10.5121/IJCSA.2014.4406","DOIUrl":null,"url":null,"abstract":"Sequential pattern mining finds the frequent subsequences or patterns from the given sequences. TPrefixSpan algorithm finds the relevant frequent patterns from the given sequential patterns formed using interval based events. In our proposed work, we add multiple constraints like item, length and aggregate to the interval based TPrefixSpan algorithm. By adding these constraints the efficiency and effectiveness of the algorithm improves. The proposed constraint based algorithm CTPrefixSpan has been applied to synthetic medical dataset. The algorithm can be applied for stock market analysis, DNA sequences analysis etc.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"22 1","pages":"59-66"},"PeriodicalIF":0.0000,"publicationDate":"2014-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Mining Sequential Patterns for interval based events by applying multiple constraints\",\"authors\":\"Kalaivany M, U. V.\",\"doi\":\"10.5121/IJCSA.2014.4406\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Sequential pattern mining finds the frequent subsequences or patterns from the given sequences. TPrefixSpan algorithm finds the relevant frequent patterns from the given sequential patterns formed using interval based events. In our proposed work, we add multiple constraints like item, length and aggregate to the interval based TPrefixSpan algorithm. By adding these constraints the efficiency and effectiveness of the algorithm improves. The proposed constraint based algorithm CTPrefixSpan has been applied to synthetic medical dataset. The algorithm can be applied for stock market analysis, DNA sequences analysis etc.\",\"PeriodicalId\":39465,\"journal\":{\"name\":\"International Journal of Computer Science and Applications\",\"volume\":\"22 1\",\"pages\":\"59-66\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-08-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computer Science and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5121/IJCSA.2014.4406\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Science and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5121/IJCSA.2014.4406","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Computer Science","Score":null,"Total":0}

引用次数: 1

摘要

序列模式挖掘从给定序列中查找频繁子序列或模式。TPrefixSpan算法从使用基于间隔的事件形成的给定序列模式中找到相关的频繁模式。在我们提出的工作中，我们在基于区间的TPrefixSpan算法中添加了多个约束，如条目、长度和聚合。通过加入这些约束，提高了算法的效率和有效性。提出的基于约束的CTPrefixSpan算法已应用于合成医学数据集。该算法可用于股票市场分析、DNA序列分析等。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Mining Sequential Patterns for interval based events by applying multiple constraints

Sequential pattern mining finds the frequent subsequences or patterns from the given sequences. TPrefixSpan algorithm finds the relevant frequent patterns from the given sequential patterns formed using interval based events. In our proposed work, we add multiple constraints like item, length and aggregate to the interval based TPrefixSpan algorithm. By adding these constraints the efficiency and effectiveness of the algorithm improves. The proposed constraint based algorithm CTPrefixSpan has been applied to synthetic medical dataset. The algorithm can be applied for stock market analysis, DNA sequences analysis etc.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Journal of Computer Science and Applications Computer Science-Computer Science Applications

自引率

0.00%

发文量

期刊介绍： IJCSA is an international forum for scientists and engineers involved in computer science and its applications to publish high quality and refereed papers. Papers reporting original research and innovative applications from all parts of the world are welcome. Papers for publication in the IJCSA are selected through rigorous peer review to ensure originality, timeliness, relevance, and readability.