An Efficient Map Reduce-Based System to find Userlikeness on Social Networks

α
D. Ravikiran
D. Ravikiran
σ
Dr. S.V.N Srinivasu
Dr. S.V.N Srinivasu
α Acharya Nagarjuna University Acharya Nagarjuna University

Send Message

To: Author

An Efficient Map Reduce-Based System to find Userlikeness on Social Networks

Article Fingerprint

ReserarchID

CSTSDE42892

An Efficient Map Reduce-Based System to find Userlikeness on Social Networks Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

Abstract

Day to day Social network information growth pursues an exponential pattern, and Present DB management systems cannot manage efficiently such a huge volume of data. It is essential to employ a “big data” solution for Social network problems. One of the most important problems in Social network is finding User likeness (ULi). Current methods for finding ULi are not flexible and do not sustain all data sources, nor can them accomplish user necessities for a query tool. In this paper, we propose a reliable and data available method to solve ULi problems over MapReduce design. RiDaULi supports storage and retrieval of all kinds of data sources in an appropriate manner. The dynamic nature of the proposed method helps users to define conditions on all entered fields. Our assessment shows that we can use this method as high confidence in less execution time.

References

20 Cites in Article
  1. Santo Fortunato (2010). Community detection in graphs.
  2. M Newman (2004). BDetecting community structure in networks.
  3. Facebook Data Tracker.
  4. M Newman,M Girvan (2004). BFinding and evaluating community structure in networks.
  5. M Newman (2006). Modularity and community structure in networks.
  6. Wayne Zachary (1977). An Information Flow Model for Conflict and Fission in Small Groups.
  7. M Girvan,M Newman (2002). BCommunity structure in social and biological networks.
  8. J Dean,S Ghemawat (2008). BMapReduce: Simplified data processing on large clusters.
  9. Jimmy Lin,Michael Schatz (2010). Design patterns for efficient graph algorithms in MapReduce.
  10. S Brin,L Page (1998). BThe anatomy of a large-scale hypertextual Web search engine1.
  11. Alan Mislove,Massimiliano Marcon,Krishna Gummadi,Peter Druschel,Bobby Bhattacharjee (2007). Measurement and analysis of online social networks.
  12. C Wilson,B Boe,A Sala,K Puttaswamy,B Zhao (2009). BUser interactions in social networks and their implications.
  13. The OSN Data Set.
  14. Satu Schaeffer (2007). Graph clustering.
  15. W Xue,J Shi,B Yang (2010). BX-RIME: Cloud-based large scale social network analysis.
  16. B Kernighan,S Lin (1970). BAn efficient heuristic procedure for partitioning graphs.
  17. Joshua Tyler,Dennis Wilkinson,Bernardo Huberman (2005). E-Mail as Spectroscopy: Automated Discovery of Community Structure within Organizations.
  18. M Rattigan,M Maier,D Jensen (2006). BUsing structure indices for efficient approximation of network properties.
  19. U Brandes,D Delling,M Gaertler,R Go¨ Rke,M Hoefer,Z Nikoloski,D Wagner (2008). BOn modularity clustering.
  20. Nam Nguyen,Thang Dinh,Ying Xuan,My Thai (2011). Adaptive algorithms for detecting community structure in dynamic social networks.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

D. Ravikiran. 2015. \u201cAn Efficient Map Reduce-Based System to find Userlikeness on Social Networks\u201d. Global Journal of Computer Science and Technology - C: Software & Data Engineering GJCST-C Volume 15 (GJCST Volume 15 Issue C7): .

Download Citation

Issue Cover
GJCST Volume 15 Issue C7
Pg. 29- 36
Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
GJCST-C Classification: K.6.3, D.2.12
Version of record

v1.2

Issue date

November 6, 2015

Language
en
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 8071
Total Downloads: 2149
2026 Trends
Related Research

Published Article

Day to day Social network information growth pursues an exponential pattern, and Present DB management systems cannot manage efficiently such a huge volume of data. It is essential to employ a “big data” solution for Social network problems. One of the most important problems in Social network is finding User likeness (ULi). Current methods for finding ULi are not flexible and do not sustain all data sources, nor can them accomplish user necessities for a query tool. In this paper, we propose a reliable and data available method to solve ULi problems over MapReduce design. RiDaULi supports storage and retrieval of all kinds of data sources in an appropriate manner. The dynamic nature of the proposed method helps users to define conditions on all entered fields. Our assessment shows that we can use this method as high confidence in less execution time.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

An Efficient Map Reduce-Based System to find Userlikeness on Social Networks

D. Ravikiran
D. Ravikiran Acharya Nagarjuna University
Dr. S.V.N Srinivasu
Dr. S.V.N Srinivasu

Research Journals