Automatic friend grouping method for social network based on single-step association adding

A social network and automatic grouping technology, applied in the field of automatic grouping of friends in social networks, can solve problems such as low computational complexity and inaccurate grouping of friends

Active Publication Date: 2016-10-26
ANHUI UNIVERSITY
View PDF17 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This type of method has low computational complexity, but usually the grouping of friends in social networks is inaccurate due to insufficient information given

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Automatic friend grouping method for social network based on single-step association adding
  • Automatic friend grouping method for social network based on single-step association adding
  • Automatic friend grouping method for social network based on single-step association adding

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0038] In an embodiment, a method for automatically grouping friends in a social network based on one-step group addition converts the problem of automatic grouping of friends in a social network into a complex network community detection problem, by using a complex network community detection algorithm based on one-step group addition Solve the problem of automatic grouping of friends in the social network, so as to obtain the grouping of friends in the social network; specifically, proceed as follows:

[0039] Step 1. Define the social network representation as a binary group {V, E}, V={v 1 ,v 2 ,...,v i ,...,v n} represents the set of all users in the social network, v i Indicates the i-th user; n is the total number of users; E={e ij |i=1,2,...,n; j=1,2,...,n} represents the set of connections between any two users; e ij Indicates the i-th user v i with the jth user v j The connection between; if e ij =1 means the i-th user v i with the jth user v j There is an e...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses an automatic friend grouping method for a social network based on single-step association adding. The method is characterized in that the social network is described as a binary group; and an overlapped association detection algorithm based on the single-step association adding is used to solve problems in automatic friend grouping of the social network. The method disclosed by the invention has the advantages that friend circles in the social network can be grouped automatically and rapidly; and efficiency and accuracy of the grouping are increased. In this way, more reliable friends can be recommended for a user through the accurate friend grouping; and unnecessary troubles generated when the user searches the friends in the same camp can be reduced.

Description

technical field [0001] The invention relates to the technical field of automatic grouping of friends in a social network, and specifically proposes a method for automatic grouping of friends in a social network based on single-step group addition. Background technique [0002] With the advent of the Internet age, social networks have grown rapidly like mushrooms after rain, attracting extensive attention from scholars at home and abroad. The emergence of social networks has changed people's traditional thinking, communication, work and lifestyle. More and more users choose to join online social networks for information exchange. speed. The intensification of network information makes it impossible for users to choose the information they need from the massive data, that is, users face the problem of information overload. If users manually group friends in their online social network, it is not only time-consuming and laborious, but many users do not classify their friends....

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/30G06Q50/00
CPCG06F16/951G06Q50/01
Inventor 张兴义苏延森郑雯谢莹
Owner ANHUI UNIVERSITY
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap