利用析取树模式一次性挖掘单个序列

K. Shimizu, T. Miura
{"title":"利用析取树模式一次性挖掘单个序列","authors":"K. Shimizu, T. Miura","doi":"10.1109/HIS.2006.46","DOIUrl":null,"url":null,"abstract":"Frequent disjunctive patterns is known to be a sophisticated method of text mining in a single document that satisfies anti-monotonicity, by which we can discuss efficient algorithms such as APRIORI. In this work, we propose a new technique for mining frequent disjunctive tree patterns based on Online analysis approach, by which we can improve mining a collection of single sequences in parallel, and discuss some experimental results.","PeriodicalId":150732,"journal":{"name":"2006 Sixth International Conference on Hybrid Intelligent Systems (HIS'06)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Mining Single Sequence at Once Using Disjunctive Tree Patterns\",\"authors\":\"K. Shimizu, T. Miura\",\"doi\":\"10.1109/HIS.2006.46\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Frequent disjunctive patterns is known to be a sophisticated method of text mining in a single document that satisfies anti-monotonicity, by which we can discuss efficient algorithms such as APRIORI. In this work, we propose a new technique for mining frequent disjunctive tree patterns based on Online analysis approach, by which we can improve mining a collection of single sequences in parallel, and discuss some experimental results.\",\"PeriodicalId\":150732,\"journal\":{\"name\":\"2006 Sixth International Conference on Hybrid Intelligent Systems (HIS'06)\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-12-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 Sixth International Conference on Hybrid Intelligent Systems (HIS'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HIS.2006.46\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Sixth International Conference on Hybrid Intelligent Systems (HIS'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HIS.2006.46","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

频繁析取模式是一种复杂的文本挖掘方法,它在单个文档中满足反单调性,通过它我们可以讨论有效的算法,如APRIORI。在本文中,我们提出了一种基于在线分析方法的频繁析取树模式挖掘新技术,该技术可以提高对单个序列集合的并行挖掘,并讨论了一些实验结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Mining Single Sequence at Once Using Disjunctive Tree Patterns
Frequent disjunctive patterns is known to be a sophisticated method of text mining in a single document that satisfies anti-monotonicity, by which we can discuss efficient algorithms such as APRIORI. In this work, we propose a new technique for mining frequent disjunctive tree patterns based on Online analysis approach, by which we can improve mining a collection of single sequences in parallel, and discuss some experimental results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信