{"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}
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.