{"title":"频繁根连续有向子图的高效挖掘","authors":"G J Sreenivasa, V. S. Ananthanarayana","doi":"10.1109/ADCOM.2006.4289953","DOIUrl":null,"url":null,"abstract":"Mining frequent rooted continuous directed (RCD) subgraphs is very useful in Web usage mining domain. We formulate the problem of mining RCD subgraphs in a database of rooted labeled continuous directed graphs. We propose a novel approach of merging like RCD subgraphs. This approach builds a Pattern Super Graph (PSG) structure.This PSG is a compact structure and ideal for extracting frequent patterns in the form of RCD subgraphs. The PSG based mine avoids costly, repeated database scans and there is no generation of candidates. Results obtained are appreciating the approach proposed.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Efficient Mining of Frequent Rooted Continuous Directed Subgraphs\",\"authors\":\"G J Sreenivasa, V. S. Ananthanarayana\",\"doi\":\"10.1109/ADCOM.2006.4289953\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mining frequent rooted continuous directed (RCD) subgraphs is very useful in Web usage mining domain. We formulate the problem of mining RCD subgraphs in a database of rooted labeled continuous directed graphs. We propose a novel approach of merging like RCD subgraphs. This approach builds a Pattern Super Graph (PSG) structure.This PSG is a compact structure and ideal for extracting frequent patterns in the form of RCD subgraphs. The PSG based mine avoids costly, repeated database scans and there is no generation of candidates. Results obtained are appreciating the approach proposed.\",\"PeriodicalId\":296627,\"journal\":{\"name\":\"2006 International Conference on Advanced Computing and Communications\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 International Conference on Advanced Computing and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ADCOM.2006.4289953\",\"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 International Conference on Advanced Computing and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ADCOM.2006.4289953","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Efficient Mining of Frequent Rooted Continuous Directed Subgraphs
Mining frequent rooted continuous directed (RCD) subgraphs is very useful in Web usage mining domain. We formulate the problem of mining RCD subgraphs in a database of rooted labeled continuous directed graphs. We propose a novel approach of merging like RCD subgraphs. This approach builds a Pattern Super Graph (PSG) structure.This PSG is a compact structure and ideal for extracting frequent patterns in the form of RCD subgraphs. The PSG based mine avoids costly, repeated database scans and there is no generation of candidates. Results obtained are appreciating the approach proposed.