Autosoft Journal

Online Manuscript Access

Friends classification of Ego Network based on combined Features


Ego networks consist of a user and his/her friends and depending on the number of friends a user has, makes them cumbersome to deal with. Social Networks allow users to manually categorize their “circle of friends”, but in today’s social networks due to the unlimited number of friends a user has, it is imperative to find a suitable method to automatically administrate these friends. Manually categorizing friends means that the user has to regularly check and update his circle of friends whenever the friends list grows. This may be time consuming for users and the results may not be accurate enough. In this paper, to solve this problem, we present a method, which combining user attributes, network structure and contact frequent three aspects. Efficiently using the profile of users, we first identify the relationship between them and then we attempt to solve the problem of community identification when a user’s profile is missing or inaccessible by use of ego network structural features. Lastly, to obtain more accurate results and realize updates automatically, we attempt to find those friends who have frequent contacts with the user. We compare the performance of the proposed algorithm with other methods, and the results show that our method has significant advantages to them.



Total Pages: 10


Manuscript ViewPdf Subscription required to access this document

Obtain access this manuscript in one of the following ways

Already subscribed?

Need information on obtaining a subscription? Personal and institutional subscriptions are available.

Already an author? Have access via email address?


Online Article

Cite this document


Statistical Analysis and Data Mining 4.5 (2011): n. pag. Crossref. Web.

Ferrara, Emilio. "Community Structure Discovery in Facebook." International Journal of Social Network Mining 1.1 (2012): 67. Crossref. Web.

Hu, Yanmei, and Bo Yang. "Enhanced Link Clustering with Observations on Ground Truth to Discover Social Circles." Knowledge-Based Systems 73 (2015): 227-235. Crossref. Web.

Kossinets, G. "Empirical Analysis of an Evolving Social Network." Science 311.5757 (2006): 88-90. Crossref. Web.

Liu G. Uncovering the mystery of trust in an online social network

Lv, Yinghua et al. "An Efficient and Scalable Density-Based Clustering Algorithm for Datasets with Complex Structures." Neurocomputing 171 (2016): 9-22. Crossref. Web.

Ma, Tinghuai et al. "$$varvec{ extit{KDVEM}}$$ KDVEM : a $$k$$ k -Degree Anonymity with Vertex and Edge Modification Algorithm." Computing 97.12 (2015): 1165-1184. Crossref. Web.

Ma, Tinghuai et al. "LED: A Fast Overlapping Communities Detection Algorithm Based on Structural Clustering." Neurocomputing 207 (2016): 488-500. Crossref. Web.

Hager, Georg et al., eds. Concurrency and Computation: Practice and Experience 28.2 (2016): n. pag. Crossref. Web.

ACM Transactions on Knowledge Discovery from Data 8.1 (2014): n. pag. Crossref. Web.

Newman, M. E. J. "Detecting Community Structure in Networks." The European Physical Journal B - Condensed Matter 38.2 (2004): 321-330. Crossref. Web.

Rong, Huan et al. "A Novel Subgraph $$K^{+}$$ K + -Isomorphism Method in Social Network Based on Graph Similarity Detection." Soft Computing 22.8 (2017): 2583-2601. Crossref. Web.

"International Journal of Virtual Communities and Social Networking." n. pag. Crossref. Web.

Xue Y. Soft Computing

Yoshida, Tetsuya. "Toward Finding Hidden Communities Based on User Profile." Journal of Intelligent Information Systems 40.2 (2011): 189-209. Crossref. Web.

Yuan, Weiwei et al. "Improved Trust-Aware Recommender System Using Small-Worldness of Trust Networks." Knowledge-Based Systems 23.3 (2010): 232-238. Crossref. Web.


ISSN PRINT: 1079-8587
ISSN ONLINE: 2326-005X
DOI PREFIX: 10.31209
10.1080/10798587 with T&F
IMPACT FACTOR: 0.652 (2017/2018)
Journal: 1995-Present

SCImago Journal & Country Rank


TSI Press
18015 Bullis Hill
San Antonio, TX 78258 USA
PH: 210 479 1022
FAX: 210 479 1048