🕔 Call For Paper — Vol. 13 | Issue 4 | April 2026 | Deadline: 30-Apr-2026
Track Paper Submit Paper Home
📢 NOTICE
📢 Call for Papers — Volume 12, Issue 4 (April 2026) | Submission Deadline: April 30, 2026 | Rapid peer review: 2–3 days | Impact Factor: 7.37 (SJIF 2026)

Paper Details

📄 IJAERD-OJS-2356

Anonymous User identification across multiple social networks

Author(s):Ankita Kutal, Gauri Gholap, Pragati mali, Neha Takawale
Institution:Department of Computer Engineering , D. Y. Patil college of Engineering, Lohagoan, Pune
Published In:Vol. 4, Issue 5 — May 2017
Page No.:777-784
Domain:Engineering
Type:Research Paper
ISSN (Online):2348-4470
ISSN (Print):2348-6406
Abstract

The previous couple of years have witnessed the emergence and evolution of a vivacious analysis stream onan outsized form of on-line Social Media Network (SMN)platforms. Recognizing anonymous, however identical usersamong multiple SMNs remains associate refractory drawback. Clearly, cross-platform exploration might facilitate solveseveral issues in social computing in each theory and applications. Since public profiles will be duplicated and simplyimpersonated by users with completely different functions, most current user identification resolutions, that chiefly targettext mining of users’ public profiles, square measure fragile. Some studies have tried to match users supported thesituation and temporal order of user content still as literary genre. However, the locations square measure thin withinthe majority of SMNs, and literary genre is tough to tell apart from the short sentences of leading SMNs like S in a veryMicroblog and Twitter. Moreover, since on-line SMNs square measure quite cruciform, existing user identificationschemes supported network structure aren't effective. The real-world friend cycle is very individual and nearly no 2 usersshare a congruent friend cycle. Therefore, it's a lot of correct to use a friendly relationship structure to research crossplatform SMNs. Since identical users tend to line up partial similar friendly relationship structures in several SMNs, wehave a tendency to planned the Friend Relationship-Based User Identification (FRUI)algorithm. FRUI calculates amatch degree for all candidate User Matched Pairs (UMPs), and solely UMPs with prime ranks square measurethought-about as identical users. we have a tendency to additionally developed 2 propositions to boost the potency of thealgorithmic program. Results of intensive experiments demonstrate that FRUI performs far better than current networkstructure-based algorithms

🗎 Download PDF 🏆 Get Certificate
🕮 How to Cite

Ankita Kutal, Gauri Gholap, Pragati mali, Neha Takawale, “Anonymous User identification across multiple social networks”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 4, Issue 5, pp. 777-784, May 2017.

Related Papers

📄 Submit Your Paper

Open Access • Peer Reviewed • CrossRef DOI
UGC Approved • Monthly Publication

Submit Now →
📅 Submission Deadline
30 Apr 2026
Vol. 13 | Issue 4
April 2026