|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Sixth IEEE International Conference on Data Mining (ICDM'06)
MARGIN: Maximal Frequent Subgraph Mining
Hong Kong
December 18-December 22
ISBN: 0-7695-2701-9
| ASCII Text | x | ||
| Lini T Thomas, Satyanarayana R Valluri, Kamalakar Karlapalem, "MARGIN: Maximal Frequent Subgraph Mining," Data Mining, IEEE International Conference on, pp. 1097-1101, Sixth IEEE International Conference on Data Mining (ICDM'06), 2006. | |||
| BibTex | x | ||
| @article{ 10.1109/ICDM.2006.102, author = {Lini T Thomas and Satyanarayana R Valluri and Kamalakar Karlapalem}, title = {MARGIN: Maximal Frequent Subgraph Mining}, journal ={Data Mining, IEEE International Conference on}, volume = {0}, year = {2006}, issn = {1550-4786}, pages = {1097-1101}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDM.2006.102}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Data Mining, IEEE International Conference on TI - MARGIN: Maximal Frequent Subgraph Mining SN - 1550-4786 SP1097 EP1101 A1 - Lini T Thomas, A1 - Satyanarayana R Valluri, A1 - Kamalakar Karlapalem, PY - 2006 KW - null VL - 0 JA - Data Mining, IEEE International Conference on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDM.2006.102
The exponential number of possible subgraphsmakes the problem of frequent subgraph mining a challenge. The set of maximal frequent subgraphs is much smaller to that of the set of frequent subgraphs, thus providing ample scope for pruning. MARGIN is a maximal subgraph mining algorithm that moves among promising nodes of the search space along the "border" of the infrequent and frequent subgraphs. This drastically reduces the number of candidate patterns considered in the search space. Experimental results validate the efficiency and utility of the technique proposed.
Citation:
Lini T Thomas, Satyanarayana R Valluri, Kamalakar Karlapalem, "MARGIN: Maximal Frequent Subgraph Mining," icdm, pp.1097-1101, Sixth IEEE International Conference on Data Mining (ICDM'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.