The primary point of this venture is secure the client login and information sharing among the interpersonal organizations like Gmail, Face book and furthermore find unknown client utilizing this systems. On the off chance that the first client not accessible in the systems, but rather their companions or mysterious client knows their login points of interest implies conceivable to abuse their talks. In this venture we need to defeat the mysterious client utilizing the system without unique client information. Unapproved client utilizing the login to talk, share pictures or recordings and so on. This is the issue to be overcome in this venture .That implies client initially enlist their subtle elements with one secured question and reply. Since the unknown client can erase their talk or information. In this by utilizing the secured questions we need to recuperate the unapproved client talk history or imparting subtle elements to their IP address or MAC address. So in this venture they have discovered an approach to keep the mysterious clients abuse the first client login points.

1. 53 International Journal for Modern Trends in Science and Technology
Identical Users in Different Social Media
Provides Uniform Network Structure based
User Identification Management
P.Jasmine1
| G.Balaram2
1PG Scholar, Department of CSE, Anurag Group of Institutions, Ghatkesar, Telangana, India.
2Associate Professor, Department of CSE, Anurag Group of Institutions, Ghatkesar, Telangana, India.
To Cite this Article
P.Jasmine and G.Balaram, “Identical Users in Different Social Media Provides Uniform Network Structure based User
Identification Management”, International Journal for Modern Trends in Science and Technology, Vol. 03, Issue 10, October
2017, pp.-53-59.
The primary point of this venture is secure the client login and information sharing among the interpersonal
organizations like Gmail, Face book and furthermore find unknown client utilizing this systems. On the off
chance that the first client not accessible in the systems, but rather their companions or mysterious client
knows their login points of interest implies conceivable to abuse their talks. In this venture we need to defeat
the mysterious client utilizing the system without unique client information. Unapproved client utilizing the
login to talk, share pictures or recordings and so on. This is the issue to be overcome in this venture .That
implies client initially enlist their subtle elements with one secured question and reply. Since the unknown
client can erase their talk or information. In this by utilizing the secured questions we need to recuperate the
unapproved client talk history or imparting subtle elements to their IP address or MAC address. So in this
venture they have discovered an approach to keep the mysterious clients abuse the first client login points.
KEYWORDS: Social Media Network, Data mining, User Identification, Cross-Platform, Anonymous Identical
Users.
Copyright © 2017 International Journal for Modern Trends in Science and Technology
All rights reserved.
I. INTRODUCTION
Information mining is an interdisciplinary
subfield of software engineering. It is the
computational procedure of finding designs in
substantial informational collections ("big data")
including techniques at the convergence of
manmade brainpower, machine learning,
measurements, and database frameworks.
The most usually utilized strategies in information
mining are:
Artificial neural systems: Non-straight prescient
models that learn through preparing and look like
organic neural systems in structure.
Decision trees: Tree-molded structures that speak
to sets of choices. These choices create rules for the
order of a dataset. Particular choice tree strategies
incorporate Classification And Regression Trees
(CART) and Chi Square Automatic Interaction
Detection (CHAID).
Hereditary calculations: Optimization procedures
that utilization procedures, for example, hereditary
blend, transformation, and characteristic choice in
a plan in view of the ideas of advancement.
Closest neighbor strategy: A method that groups
each record in a dataset in view of a mix of the
classes of the k record(s) most like it in a verifiable
dataset (where k ³ 1). In some cases called the
k-closest neighbor method.
ABSTRACT
Available online at: http://www.ijmtst.com/vol3issue10.html
International Journal for Modern Trends in Science and Technology
ISSN: 2455-3778 :: Volume: 03, Issue No: 10, October 2017

2. 54 International Journal for Modern Trends in Science and Technology
P.Jasmine and G.Balaram : Identical Users in Different Social Media Provides Uniform Network Structure based User
Identification Management
Govern acceptance: The extraction of valuable
if-then guidelines from information in light of
measurable hugeness.
An Architecture for Data Mining
To best apply these propelled strategies, they
should be completely incorporated with an
information distribution center and additionally
adaptable intelligent business examination
apparatuses. Numerous information mining
apparatuses at present work outside of the
distribution center, requiring additional means for
separating, bringing in, and investigating the
information. At the point when new bits of
knowledge require operational usage, mix with the
distribution center improves the utilization of
results from information mining. The subsequent
logical information distribution center can be
connected to enhance business forms all through
the association, in zones, for example, limited time
crusade administration, misrepresentation
identification, new item rollout, et cetera. Figure 1
delineates engineering for cutting edge
investigation in an extensive information
distribution center.
Figure 1.1 - Integrated Data Mining Architecture
The perfect beginning stage is an information
distribution center containing a blend of inner
information following all client contact combined
with outer market information about contender
action. Foundation data on potential clients
likewise gives a phenomenal premise to
prospecting. This distribution center can be
actualized in an assortment of social database
frameworks: Sybase, Oracle, Redbrick, et cetera,
and ought to be upgraded for adaptable and quick
information get to.
An OLAP (On-Line Analytical Processing) server
empowers a more modern end-client plan of action
to be connected while exploring the information
distribution center. The multidimensional
structures enable the client to examine the
information as they need to see their business
condensing by product offering, district, and other
key viewpoints of their business. The information
mining server must be coordinated with the
information distribution center and the OLAP
server to insert ROI-centered business
investigation specifically into this framework. A
propelled, handle driven metadata format
characterizes the information digging destinations
for particular business issues like crusade
administration, prospecting, and advancement
enhancement. Mix with the information stockroom
empowers operational choices to be
straightforwardly executed and followed. As the
stockroom develops with new choices and results,
the association can constantly mine the prescribed
procedures and apply them to future choices. This
plan speaks to a principal move from regular choice
emotionally supportive networks. Instead of
essentially conveying information to the end client
through question and announcing programming,
the Advanced Analysis Server applies clients' plans
of action specifically to the stockroom and returns
a proactive examination of the most applicable
data. These outcomes improve the metadata in the
OLAP Server by giving a dynamic metadata layer
that speaks to a refined perspective of the
information. Detailing, perception, and different
examination apparatuses would then be able to be
connected to design future activities and affirm the
effect of those plans. Web-based social networking
are PC interceded apparatuses that enable
individuals or organizations to make, offer, or trade
data, profession interests, thoughts, and
pictures/recordings in virtual groups and systems.
Web-based social networking is characterized as "a
gathering of Internet-construct applications that
work with respect to the ideological mechanical
establishments of Web 2.0, and that permit the
creation and trade of client produced content.
Cross-Platform, Multi-Platform, or Platform
Independent, is a credit presented to PC
programming or figuring techniques and ideas that
are executed and between work on different
processing stages. Cross-Platform programming
might be separated into two sorts; one requires
singular building or gathering for every stage that it
underpins, and the other one can be specifically
keep running on any stage without exceptional
arrangement, e.g., programming written in a
deciphered dialect or pre-ordered convenient byte
code for which the translators or run-time bundles
are normal or standard segments of all stages.

3. 55 International Journal for Modern Trends in Science and Technology
P.Jasmine and G.Balaram : Identical Users in Different Social Media Provides Uniform Network Structure based User
Identification Management
Fig 1.2 Cross Platform Identification
Unknown is an inexactly related worldwide
system of lobbyist and hacktivist substances. A site
ostensibly connected with the gathering depicts it
as "an Internet gathering" with "a free and
decentralized summon structure that works on
thoughts as opposed to orders". The gathering
wound up plainly known for a progression of very
much plugged attention stunts and conveyed
disavowal of-benefit (DDoS) assaults on
government, religious, and corporate sites.
In our examination of cross stage SMNs, we
profoundly mined companion relationship and
system structures. In this present reality,
individuals have a tendency to have for the most
part similar companions in various SMNs, or the
companion cycle is exceedingly person. The more
matches in two unmapped clients' known
companions, the higher the likelihood that they
have a place with a similar individual in this
present reality. In light of this reality, we proposed
the FRUI calculation. Since FRUI utilizes a brought
together companion relationship, it is adept to
recognize clients from a heterogeneous system
structure. Not at all like existing calculations. FRUI
picks competitor coordinating sets from at present
known indistinguishable clients as opposed to
unmapped ones. Client Identification alludes to
now a day's an ever increasing number of
individuals have their virtual characters on the
Web. It is normal that individuals are clients of
more than one informal community and
furthermore their companions might be enlisted on
different sites. An office to total our online
companions into a solitary coordinated condition
would empower the client to stay up with the latest
with their virtual contacts all the more effectively,
and in addition to give enhanced office to inquiry to
individuals crosswise over various sites. In this
paper, we propose a technique to recognize clients
in view of profile coordinating. We utilize
information from two mainstream interpersonal
organizations to ponder the likeness of profile
definition. We assess the significance of fields in
the web profile and build up a profile correlation
instrument. We show the viability and effectiveness
of our instrument in distinguishing and uniting
copied clients on various sites. The grapple
content, interface mark, connect content, or
connection title is the obvious, interactive content
in a hyperlink. The words contained in the stay
content can decide the positioning that the page
will get via web crawlers. Since 1998, some web
programs have added the capacity to demonstrate
a tooltip for a hyperlink before it is chosen. Not all
connections have grapple writings since it might be
evident where the connection will lead because of
the setting in which it is utilized. Grapple messages
typically stay beneath 60 characters. Diverse
programs will show stay messages in an
unexpected way. As a rule, web indexes examine
grapple content from hyperlinks on site pages.
Different administrations apply the essential
standards of stay content investigation too. For
example, scholarly web indexes may utilize
reference setting to group scholastic articles, and
stay content from records connected as a top
priority maps might be utilized as well. A
computerized impression is a trail of information
you make while utilizing the Internet. In
incorporates the sites you visit, messages you
send, and data you submit to online
administrations. An "aloof computerized
impression" is an information trail you accidentally
leave on the web. Computerized Footprints are
arranged into detached and dynamic. A uninvolved
advanced impression is made when information is
gathered without the proprietor knowing, though
dynamic computerized impressions are made when
individual information is discharged intentionally
by a client with the end goal of sharing data around
oneself by methods for sites or online networking.
Detached computerized impressions can be put
away from numerous points of view contingent
upon the circumstance. In an online domain an
impression might be put away in an online
information base as a "hit". This impression may
track the client IP address, when it was made, and
where they originated from; with the impression
later being examined. In a disconnected situation,
an impression might be put away in documents,
which can be gotten to by executives to see the
activities performed on the machine, without
having the capacity to see who performed them.
Crawlers expend assets on the frameworks they
visit and frequently visit locales without implied
endorsement. Issues of timetable, load, and
"respectfulness" become an integral factor when
expansive accumulations of pages are gotten to.

4. 56 International Journal for Modern Trends in Science and Technology
P.Jasmine and G.Balaram : Identical Users in Different Social Media Provides Uniform Network Structure based User
Identification Management
Instruments exist for open locales not wishing to be
slithered to make this known to the creeping
specialist.
Fig.1.3 Architecture of web crawler
II. RELATED WORK
Canister Zhou Jian Pei [1] proposed safeguarding
protection in informal communities against
neighborhood assaults by a strategy called
anonymization calculation. The assaults in need to
plant an arrangement of deliberative structures
before the interpersonal organization information
is anonymized, which is an undertaking hard to
accomplish in a few circumstances. As appeared
some time recently, even without planting
deliberative structures, the discharged informal
community information is still in peril, as
neighborhood assaults are as yet conceivable. One
of the security concerned issues is distributing
micro data for open utilize, which has been broadly
considered as of late. As informal organization
information is substantially more confounded than
social information, protection safeguarding in
interpersonal organizations is a great deal
additionally difficult and needs numerous genuine
endeavors. Displaying antagonistic assaults and
creating protection conservation procedures are
basic. "Protecting Privacy in Social Networks
Against Neighborhood Attacks".
Xiangnan Kong, et al [2] proposed inducing
grapple interfaces over various heterogeneous
informal organizations by a procedure called multi
arrange mooring. The proposed Multi-Network
Anchoring (MNA) technique reliably out performs
other benchmark strategies. This outcome bolsters
the instinct of this paper: Multiple heterogeneous
interpersonal organizations can give diverse sorts
of data about the clients. The immovability of the
issue, existing techniques as a rule depend on
viable heuristics to take care of the arrangement
issue. By expressly consider the clients
heterogeneous information inside the systems. It
demonstrates that by fusing the coordinated
imperative in the deduction procedure can
additionally enhance the execution of stay interface
forecast. "Gathering Anchor Links over Multiple
Heterogeneous Social Networks".
Reza Zafarani [3] proposed interfacing comparing
characters crosswise over groups by a strategy
called connect investigation calculation. The
connection between usernames chosen by a
solitary individual in various groups, and on a
portion of the web marvels with respect to
usernames and groups. The unrevealing idea of the
web and the way that most groups protect the
obscurity of clients by enabling them to openly
choose usernames rather than their genuine
personalities and the way that distinctive sites
utilize diverse username and validation
frameworks. By the by, if there exists a mapping
between usernames crosswise over various groups
and the genuine personalities behind them, at that
point associating groups over the web turns into a
straight forward errand. "Interfacing
Corresponding Identities Across Communities".
Paridhi Jain, et al [4] proposed distinguishing
clients over numerous online informal
organizations by a system called character seek
calculations. we present two novel character seek
calculations in view of substance and system
properties and enhance customary personality
look calculation in view of prole qualities of a client
that misusing numerous personality look
strategies, surfaces the characters like the given
character in various angles other than the
conventional ways (e.g., comparable name) and
hence, builds the exactness of finding right
characters clients crosswise over interpersonal
organizations. In this work, they endeavor to
comprehend if consideration of inquiry strategies
in light of a personality's substance and system
traits, alongside look techniques in view of a
character's prole E.- P. Lim, et al [5] proposed
investigating link ablility of group evaluating by a
procedure called coordinating calculation. The
systems that concentrate visit design compose
prints are portrayed by one creator. Commonly
mirror one's experience when managing a
purchaser or a merchant. Not at all like our
universally useful audits, these remarks don't
survey items, administrations or spots of various
classes what's more, in spite of the fact that they
exploit appraisals and classifications to help LRs,
they have to additionally investigate use of other
non-literary elements, for example, sub-classes of
spots, items and administrations evaluated and
the length of audits. Indeed, it is fascinating to
perceive how the LR can be enhanced without
falling back on lexical components, since they by

5. 57 International Journal for Modern Trends in Science and Technology
P.Jasmine and G.Balaram : Identical Users in Different Social Media Provides Uniform Network Structure based User
Identification Management
and large involve overwhelming preparing.
"Investigating Link ablility of Community
Reviewing".
Paridhi Jain, et al [6] proposed discovering nemo:
Searching and settling personalities of clients
crosswise over online interpersonal organizations
utilizing calculation called profile look. Our insight,
dominant part of the methodologies proposed
misused it is possible that maybe a couple
measurements for a personality look and
connecting, along these lines leaving different
indications uninvestigated to use accessible data
about the client and make an arrangement of
applicant characters for a client on an
interpersonal organization. To adjust to ongoing
hunt, restricted accessibility of data and utilization
of the assistant data left unexplored. Specialists
have built up an arrangement of methodologies
which expect that the considered measurement is
constituted in a comparable manner by a client
over her various personalities. "Discovering Nemo:
Searching and Resolving Identities of Users Across
Online Social Networks".
O. de Vel proposed digging email content for
creator distinguishing proof criminology by
calculation called vector machine learning
calculation. Numerous techniques that
consequently learn rules have been proposed for
content categorisation. No arrangement of critical
style markers have been distinguished as
remarkably oppressive. There does not appear to
exist an accord on a right philosophy, with a
considerable lot of these procedures experiencing
issues, for example, flawed examination,
irregularities for a similar arrangement of creators,
fizzled replication and so on components may not
be legitimate discriminators. Prescriptive sentence
structure mistakes, obscenities and so on which
are not by and large thought to be eccentric.
Similarly as there is a scope of accessible
stylometric highlights, there are a wide range of
systems utilizing these components for creator
distinguishing proof. "Digging E-mail Content for
Author Identification Forensics".
Reza Zafarani, et al [8] proposed interfacing
clients crosswise over online networking locales: A
behavioral-demonstrating approach by a
calculation called learning calculation. The
proposed behavioral demonstrating approach
abuses data repetition because of these behavioral
examples. An option arrangement tending to the
age confirmation issue by abusing the idea of
web-based social networking and its systems. The
data accessible on all web-based social networking
locales (usernames) to determine a substantial
number of components that can be utilized by
administered figuring out how to interface clients
crosswise over destinations. Clients regularly
display certain behavioral examples while choosing
usernames. It incorporates examining these
conceivable outcomes and finding highlights
indigenous to particular destinations, past those
choked to usernames, and fusing them into
MOBIUS for future needs. "Associating Users
Across Social Media Sites: A Behavioral-Modeling
Approach".
Nitish Korula, et al [9] proposed a proficient
compromise calculation for informal communities
by utilizing Learning calculations. A more profound
comprehension of the attributes of a client
crosswise over various systems develops a superior
representation of her, which can be utilized to serve
customized substance or commercials to the best
of our insight, it has not yet been considered
formally and no thorough outcomes have been
demonstrated for it. Regardless of the possibility
that specific conduct can be seen in a few systems,
there are as yet significant issues in light of the fact
that there is no methodical approach to join the
conduct of a particular client crosswise over
various informal communities and in light of the
fact that some social connections won't show up in
any interpersonal organization. Consequently,
distinguishing every one of the records having a
place with a similar individual crosswise over
various social administrations is a basic stride in
the investigation of sociology. "An Efficient
Reconciliation Algorithm for Social Networks".
Elie Raad, et al [10] proposed client profile
coordinating in interpersonal organizations by
utilizing basic leadership calculation. They looked
for the aggregate number of conceivable mixes that
allude to the same physical individual. At that
point they ascertained the quantity of blends of
discovered profiles by our technique that
additionally exist in the underlying set R. We
likewise computed the quantity of profiles blends
that were identified by our approach just like the
same physical individual. They tended to the issue
of giving inter social organize operations and
functionalities. In this work, they proposed a
structure for client profile coordinating in
interpersonal organizations. This system can find
the greatest conceivable number of profiles that
allude to the same physical client that current
methodologies can't distinguish. They are wanting
to additionally investigate and propose all the more
fascinating between social operations and

6. 58 International Journal for Modern Trends in Science and Technology
P.Jasmine and G.Balaram : Identical Users in Different Social Media Provides Uniform Network Structure based User
Identification Management
functionalities. "Client Profile Matching in Social
Networks".
III. IMPLEMENTATION
In this paper we utilize Friend Relationship
Based User Identification Algorithm (FRUI) to
recoup the information which has been erased or
changed by mysterious client. This can be
accomplished by giving a history choice and that
will be outlined such that it will give the activities
that have been performed till the present session.
In this paper we have built up an application
through which we can perform information sharing
and visiting. To enlist to this application we need to
give username, secret key and answer two level of
security questions. In the wake of giving every one
of these points of interest the client of this
application will be effectively enrolled. At the
season of login it will ask username, secret word
and one security question through which we have
enrolled. By signing into this application we can
perform talking and information sharing. What's
more, in this furthermore history menu is likewise
given which give the activities performed till the
present session. By survey this we can come to
know whether unknown client utilized our login
and we can our information if any superfluous
activities have been performed.
Architecture framework: The fundamental
thought behind this paper is to recoup the
information which has been erased or changed by
the mysterious client. In the design chart, the
client logins into his record and he will play out his
activities for him. Furthermore, similarly if
mysterious client can come to know the login
subtle elements of the first client he can likewise
make adjustments in that record. To record those
activities which have made a history menu in that
application.
Fig 3.1 Architecture of the system
The client can recover his points of interest
which has been changed by unknown client by just
noting the second level of security question which
is given inside the history menu. Furthermore,
once in the event that he answers the inquiry a
discourse box will be opened posting the activities
which have been performed till the present session.
The client can recuperate his information from that
exchange box if any mysterious exercises have
been performed. What's more, he can likewise see
the unknown client IP or MAC address.
Periods of the framework:
The six periods of the framework are:
i. Client Matched Pair
ii. System Structure Based User Identity
iii. Client Identification
iv. Companion Relationship Based User
Identification (FRUI)Algorithm
v. Recuperation abused subtle elements
vi. Discover IP or MAC
Stage 1: User Matched Pair
`In this module first client enroll their points of
interest with security addresses that will recoup
the first information. The motivation behind why
we pick the Q and A methods if other mystery
secret key or different esteems are placed in that
place, effortlessly programmers can discover the
watchword.
Stage 2: Network Structure Based User Identity
In this module client can without much of a
stretch discover their login is abused or not. By
sending the notice points of interest like last time
out, logout time and IP address we can discover the
client character. The IP deliver is utilized to
discover the logout framework where situated after
that client can change their watchword.
Stage 3: User Identification
In client distinguishing proof module we need to
discover the programmer IP address. We have said
that the hacking framework IP is utilized to
discover the area. In the event that the area is
adjacent we can without much of a stretch discover
the area of unique programmer.
Stage 4: Friend Relationship Based User
Identification (FRUI) Algorithm
We proposed the Friend Relationship-Based User
Identification (FRUI) calculation. FRUI (Friend
Relationship Based User Identification Algorithm)
computes a match degree for all competitor User
Matched Pairs (UMPs), and just UMP with best
rank offer considered as indistinguishable clients.
We likewise created two recommendations to
enhance the productivity of the calculation.
Stage 5: Recovery Misused Details
In this venture it is specified that the client make
their login with mystery question, that inquiry will

7. 59 International Journal for Modern Trends in Science and Technology
P.Jasmine and G.Balaram : Identical Users in Different Social Media Provides Uniform Network Structure based User
Identification Management
recuperate the abused subtle elements. In this
unique login page as the first client or the
programmer whatever they do that will appeared in
front page. In the event that the first client needs to
know their hacked or abused records or profile that
time the mystery question will serves to them.
Stage 6: Find IP or MAC
In this module by utilizing the secured questions
we need to recuperate the unapproved client talk
history or offering subtle elements to their IP
address or MAC address. So in this venture we
need to discover the unknown clients abuse the
first client login points of interest.
IV. CONCLUSION
In this manner the venture "Cross Platform
Identification of Anonymous Identical Users in
Multiple Social Media Networks" gives uniform
system structure-based client recognizable proof
arrangement. In addition our venture can be
effortlessly connected to any SMNs with kinship
systems, including Twitter, Face-book and
Foursquare. Since just the Adjacent Users are
included in every emphasis procedure our
technique is versatile and can be effortlessly
connected to huge informational indexes and
online client recognizable proof applications.
REFERENCES
[1] M. Almishari and G. Tsudik, "Exploring linkability of
user reviews," Computer Security–ESORICS 2012
(ESORICS’12), pp. 307324, 2012.
[2] P. Jain and P. Kumaraguru, "Finding Nemo:
searching and resolving identities of users across
online social networks," arXiv preprint
arXiv:1212.6147, 2012.
[3] O. De Vel, A. Anderson, M. Corney, and G. Mohay,
"Mining email content for author identification
forensics,” ACM Sigmod Record, vol. 30, no. 4, pp.
55-64, 2001.
[4] R. Zafarani and H. Liu, "Connecting users across
social media sites: a behavioral-modeling approach,
" Proc. of the 19th ACM SIGKDD International
Conference on Knowledge Discovery and Data
Mining (KDD’13), pp.41-49, 2013
[5] B. Zhou and J. Pei, "Preserving privacy in social
networks against neighborhood attacks," Proc. Of
the 24th IEEE International Conference on Data
Engineering (ICDE’08), pp. 506–515, 2008.
[6] X. Kong, J. Zhang, and P.S. Yu, “Inferring anchor
links across multiple heterogeneous social
networks," Proc. of the 22nd ACM International
Conf. on Information and Knowledge Management
(CIKM’13), pp. 179-188, 2013.
[7] R. Zafarani and H. Liu, "Connecting corresponding
identities across communities," Proc. of the 3rd
International ICWSM Conference, pp. 354-357,
2009.
[8] P. Jain, P. Kumaraguru, and A. Joshi, "@ i seek 'fb.
me': identifying users across multiple online social
networks," Proc. of the 22nd International
Conference on World Wide Web Companion, pp.
1259-1268, 2013.
[9] M. Almishari and G. Tsudik, "Exploring linkability of
user reviews," Computer Security–ESORICS 2012
(ESORICS’12), pp. 307324, 2012.
[10]O. Goga, D. Perito, H. Lei, R. Teixeira, and R.
Sommer, "Largescale Correlation of Accounts across
Social Networks," Technical report, 2013
[11]K. Cortis, S. Scerri, I. Rivera, and S. Handschuh, "An
ontology based technique for online profile
resolution," Social Informatics, Berlin: Springer, pp.
284-298, 2013.
[12]F. Abel, E. Herder, G.J. Houben, N. Henze, and D.
Krause, "Cross-system user modeling and
personalization on the social web," User Modeling
and User-Adapted Interaction, vol. 23, pp. 169-209,
2013.
[13]O. De Vel, A. Anderson, M. Corney, and G. Mohay,
"Mining email content for author identification
forensics,” ACM Sigmod Record, vol. 30, no. 4, pp.
55-64, 2001.
[14]E. Raad, R. Chbeir, and A. Dipanda, "User profile
matching in social networks," Proc. Of the 13th
International Conference on Network-Based
Information Systems (NBiS’10), pp.297-304, 2010.
[15]J. Vosecky, D. Hong, and V.Y. Shen, "User
identification across multiple social networks," Proc.
Of the 1st International Conference on Networked
Digital Technologies, pp.360-365, 2009.
[16]P. Jain, P. Kumaraguru, and A. Joshi, "@ i seek 'fb.
me': identifying users across multiple online social
networks," Proc. of the 22nd International
Conference on World Wide Web Companion,
pp.1259-1268, 2013.
[17]R. Zheng, J. Li, H. Chen, and Z. Huang, "A
framework for authorship identification of online
messages: writing‐style features and classification
techniques," J. of the American Society for
Information Science and Technology, vol. 57, no. 3,
pp. 378-393.