Impact Factor:6.549
 Scopus Suggested Journal: UNDER REVIEW for TITLE INCLUSSION

International Journal
of Computer Engineering in Research Trends (IJCERT)

Scholarly, Peer-Reviewed, Open Access and Multidisciplinary

Welcome to IJCERT

International Journal of Computer Engineering in Research Trends. Scholarly, Peer-Reviewed,Open Access and Multidisciplinary

ISSN(Online):2349-7084                 Submit Paper    Check Paper Status    Conference Proposal

Back to Current Issues

Social Mining to Improve the Computational Efficiency Using MapReduce

Ms. Babbitha.M, Dr. Angelina Geetha, Mr. Mohammed Jaffer.A.R, ,
M.Tech, Software Engineering (CSE), B.S. AbdurRahman University, Chennai, India
Associate Professor, Computer Science and Engineering, B.S. AbdurRahman University, Chennai, India
M.Tech, Software Engineering (CSE), B.S. AbdurRahman University, Chennai, India

Graphs are widely used in large scale social network analysis. Graph mining increasingly important in modelling complicated structures such as circuits, images, web, biological networks and social networks. The major problems occur in this graph mining are computational efficiency (CE) and frequent sub graph mining (FSM). Computational Efficiency describes the extent to which the time, effort or efficiency which use computing technology in information processing. Frequent Subgraph Mining is the mechanism of candidate generation without duplicates. FSM faces the problem on counting the instances of the patterns in the dataset and counting of instances for graphs. The main objective of this project is to address CE and FSM problems. The paper cited in the reference proposes an algorithm called Mirage algorithm to solve queries using sub graph mining. The proposed work focuses on enhancing An Iterative MapReduce based Frequent Subgraph Mining Algorithm (MIRAGE) to consider optimum computational efficiency. The test data to be considered for this mining algorithm can be from any domains such as medical, text and social data’s (twitter).The major contributions are: an iterative MapReduce based frequent subgraph mining algorithm called MIRAGE used to address the frequent subgraph mining problem. Computational Efficiency will be increased through MIRAGE algorithm over Matrix Vector Multiplication. Performance of the MIRAGE will be demonstrated through different synthetic as well as real world datasets. The main aim is to improvise the existing algorithm to enhance Computational Efficiency.

Ms. Babbitha.M,Dr. Angelina Geetha,Mr. Mohammed Jaffer.A.R."Social Mining to Improve the Computational Efficiency Using MapReduce". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 05,pp.288-292, May - 2015, URL :,

Keywords : Computational Efficiency, Data Mining, Frequent SubgraphMining, Graphs, Map Reduce, Text Mining, Social Networks.

[1] Mansurul A Bhuiyan and Mohammad Al
Hasan, ―MIRAGE: An Iterative MapReduce based
Frequent Subgraph Mining Algorithm‖, ACM
Computing Research Repository, arXiv: 1307.5894,
Volume 1, 2013.
[2] Yi-Chen Lo, Hung-CheLai, Cheng-Te Li and
Shou-De Lin,‖ Mining and Generating Large Scaled
Social Networks via MapReduce‖, Springer-Verlag
Advances in Social Networks Analysis and Mining, pp -
1449–1469, 2013.
[3] SabaSehrish, Grant Mackey, Pengju Shang, Jun
Wang and John Bent,‖Supporting HPC Analytics
Applications with Access Patterns Using Data
Restructuringand Data-Centric Scheduling
TechniquesinMapReduce‖ IEEE Transactions on Parallel
and Distributed Systems, Volume 24, 2013.


Download :

Refbacks : Currently there are no Refbacks


Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors. 

News & Events

Latest issue :Volume 10 Issue 1 Articles In press

A plagiarism check will be implemented for all the articles using world-renowned software. Turnitin.

Digital Object Identifier will be assigned for all the articles being published in the Journal from September 2016 issue, i.e. Volume 3, Issue 9, 2016.

IJCERT is a member of the prestigious.Each of the IJCERT articles has its unique DOI reference.
DOI Prefix : 10.22362/ijcert

IJCERT is member of The Publishers International Linking Association, Inc. (“PILA”)

Emerging Sources Citation Index (in process)

IJCERT title is under evaluation by Scopus.

Key Dates

☞   LAST DATE OF SUBMISSION : 31st March 2023
In 7 Days

Important Announcements

All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.

Citation Index

Citations Indices All
Citations 1026
h-index 14
i10-index 20
Source: Google Scholar

Acceptance Rate (By Year)

Acceptance Rate (By Year)
Year Rate
2021 10.8%
2020 13.6%
2019 15.9%
2018 14.5%
2017 16.6%
2016 15.8%
2015 18.2%
2014 20.6%

Important Links

Conference Proposal