Published in:   Vol. 6 Issue 2 Date of Publication:   December 2017

Page(s):   69-75 ISSN:   2278-2397

DOI:   10.20894/IJCOA.101.006.002.005 Publisher:   Integrated Intelligent Research (IIR)

• Abstract
• Authors
• Keywords
• Citation
• References

Lee, Jinsoo, Wook-Shin Han, Romans Kasperovics, and Jeong-Hoon Lee,   "An in-depth comparison of subgraph isomorphism algorithms in graph databases",   In Proceedings of the VLDB Endowment   ,Vol.6   ,Issue 2   ,2012
View Artical


Adhiselvam, A., E. Kirubakaran, and R. Sukumar,   "A Study On Frequent Subgraph Mining Algorithm and Techniques for Software Bug Localization",   International Quarterly Journal in Scientific Tran   ,Vol.8   ,Issue 4   ,2015
View Artical


Elseidy, Mohammed, Ehab Abdelhamid, Spiros Skiadopoulos, and Panos Kalnis,   "Grami: Frequent subgraph and pattern mining in a single large graph",   Proceedings of the VLDB Endowment   ,Vol.7   ,Issue 7   ,2014
View Artical


Huan, Jun, Wei Wang, and Jan Prins,   "Efficient mining of frequent subgraphs in the presence of isomorphism",    In?Data Mining, 2003. ICDM 2003. Third IEEE Inter   ,2003
View Artical


Schaeffer, Satu Elisa,   "Graph clustering.",   Computer Science Review?   ,Vol.1   ,Issue 1   ,2007
View Artical


Lin, Chuan, Young-rae Cho, Woo-chang Hwang, Pengjun Pei, and Aidong Zhang,   "Clustering methods in protein-protein interaction network.",   Knowledge Discovery in Bioinformatics: techniques,   ,2007
View Artical


??Kim, Jinha, Hyungyu Shin, Wook-Shin Han, Sungpack Hong, and Hassan Chafi. ,   "Taming subgraph isomorphism for RDF query processing",   Proceedings of the VLDB Endowment   ,Vol.8   ,Issue 11   ,2015
View Artical


Bringmann, Bj?rn, and Siegfried Nijssen,   "What is frequent in a single graph?",    In?Advances in Knowledge Discovery and Data Minin   ,2008
View Artical


Lakshmi, K. ,   "Frequent Subgraph Mining Algorithms--A Survey And Framework For Classification.   ,2012
View Artical


Cleve, J?rgen, Uwe L?mmel, and Stefan Wissuwa,   "Data Mining on Transaction Data",   Global Markets in Dynamic Environments, Lisboa   ,2005
View Artical


Silvestri, Claudio, and Salvatore Orlando.,   "Approximate mining of frequent patterns on streams",   ?Intelligent Data Analysis   ,Vol.11   ,Issue 1   ,2007
View Artical


Cheng, Jiefeng, Jeffrey Xu Yu, and Bolin Ding,   "Multi Reachability Query Processing   ,2008
View Artical


Woeginger, Gerhard J.,   "Exact algorithms for NP-hard problems: A survey",   InCombinatorial Optimization?Eureka, You Shrink   ,2003
View Artical


Dor, Dorit, and Michael Tarsi. ,   "A simple algorithm to construct a consistent extension of a partially oriented graph",   Technicial Report   ,Vol.185   ,1992
View Artical


Liu, Zhe,   "Algorithms for Constraint Satisfaction Problems (CSPs).",   PhD diss., University of Waterloo   ,1998
View Artical


Wang, Qingguo, Mian Pan, Yi Shang, and Dmitry Korkin,   "A Fast Heuristic Search Algorithm for Finding the Longest Common Subsequence of Multiple Strings   ,2010
View Artical


Qian, Qi, Rong Jin, Jinfeng Yi, Lijun Zhang, and Shenghuo Zhu,   "Efficient distance metric learning by adaptive sampling and mini-batch stochastic gradient descent (",   Machine Learning?99   ,Vol.3   ,2015
View Artical


Thomas, David B., Wayne Luk, Philip HW Leong, and John D. Villasenor,   "Gaussian random number generators",   ACM Computing Surveys (CSUR)?   ,Vol.39   ,Issue 4   ,2007
View Artical


Fiedler, Mathias, and Christian Borgelt,   "Support Computation for Mining Frequent Subgraphs in a Single Graph",    In?MLG   ,2007
View Artical


Ugander, Johan, Lars Backstrom, and Jon Kleinberg.,   "Subgraph frequencies: Mapping the empirical and extremal geography of large graph collections",    InProceedings of the 22nd international conferenc   ,2013
View Artical


Chekuri, Chandra, and Nitish Korula,   "Pruning 2-connected graphs.",   Algorithmica?62   ,Vol.1   ,Issue 2   ,2012
View Artical


Cook, Diane J., and Lawrence B. Holder.,   "Substructure discovery using minimum description length and background knowledge",   Journal of Artificial Intelligence Research?   ,1994
View Artical


?He, Huahai, and Ambuj K. Singh.,   "Graphs-at-a-time: query language and access methods for graph databases",   In?Proceedings of the 2008 ACM SIGMOD internationa   ,2008
View Artical


Lee, Jinsoo, Wook-Shin Han, Romans Kasperovics, and Jeong-Hoon Lee,   "An in-depth comparison of subgraph isomorphism algorithms in graph databases",    In?Proceedings of the VLDB Endowment   ,Vol.6   ,Issue 2   ,2012
View Artical


Cortadella, Jordi, and Gabriel Valiente,   "A Relational View of Subgraph Isomorphism." ",   In?RelMiCS   ,2000
View Artical


Robardet, C?line,   "Constraint-based pattern mining in dynamic graphs.",   InData Mining, 2009. ICDM'09. Ninth IEEE Internati   ,2009
View Artical


Yan, Xifeng, Hong Cheng, Jiawei Han, and Philip S. Yu.,   " In?Proceedings of the 2008 ACM SIGMOD international conference on Management of data,   ,2008
View Artical


Chen, Chen, Xifeng Yan, Feida Zhu, and Jiawei Han,   "gapprox: Mining frequent approximate patterns from a massive network.",   Seventh IEEE International Conference   ,2007
View Artical


Lakshmi, K., and T. Meyyappan,   "A comparative study of frequent subgraph mining algorithms",   International Journal of Information Technology Co   ,Vol.2   ,Issue 2   ,2013
View Artical


Zou, Zhaonian, Jianzhong Li, Hong Gao, and Shuo Zhang,   "Frequent subgraph pattern mining on uncertain graph data",   In?Proceedings of the 18th ACM conference on Infor   ,2009
View Artical


Adhiselvam, A., E. Kirubakaran, and R. Sukumar. ,   "An Enhanced Approach for Software Bug Localization using Map Reduce Technique based Apriori (MRTBA) ",   Indian Journal of Science and Technology   ,Vol.8   ,Issue 35   ,2015
View Artical


??Adhiselvam, A., E. Kirubakaran, and R. Sukumar.,   "A Study On Frequent Subgraph Mining Algorithm and Techniques for Software Bug Localization.",   ?International Quarterly Journal in Scientific Tra   ,Vol.8   ,Issue 4   ,2015
View Artical