Classifications

• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L67/00—Network arrangements or protocols for supporting network services or applications
  • H04L67/2866—Architectures; Arrangements
  • H04L67/30—Profiles
  • H04L67/306—User profiles
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
  • G06F7/06—Arrangements for sorting, selecting, merging, or comparing data on individual record carriers
  • G06F7/10—Selecting, i.e. obtaining data of one kind from those record carriers which are identifiable by data of a second kind from a mass of ordered or randomly- distributed record carriers
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
  • G06Q10/00—Administration; Management
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
  • G06Q10/00—Administration; Management
  • G06Q10/40—Business processes related to social networking or social networking services
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
  • G06Q10/00—Administration; Management
  • G06Q10/40—Business processes related to social networking or social networking services
  • G06Q10/42—Determination of affinities or common interests between users
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
  • G06Q10/00—Administration; Management
  • G06Q10/40—Business processes related to social networking or social networking services
  • G06Q10/48—Business processes related to social networking or social networking services using social graphs
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L67/00—Network arrangements or protocols for supporting network services or applications
  • H04L67/50—Network services
  • H04L67/535—Tracking the activity of the user

Definitions

• the present invention relates to the field of Internet communication technologies, and in particular, to a method and system for grouping social networks, and a computer storage medium. Background technique
• the present invention provides a grouping method and system for a social network, which can quickly intelligently group social network users with a small amount of processing.
• a method of grouping a social network the method being applied to a social network server or a client interacting with a user, the method comprising the steps of:
• a grouping system of a social network the system being disposed on a social network server or a client interacting with a user, the system comprising: a relationship chain processing unit, configured to obtain friend relationship data, determine weights of each friend node according to friend relationship data; a circle unit, configured to select a friend node with the largest weight from the friend node to form a new circle, and traverse the most searched for the new circle Good friend, and join the best friend to the new circle until the best friend in the new circle is looking for it.
• a relationship chain processing unit configured to obtain friend relationship data, determine weights of each friend node according to friend relationship data
• a circle unit configured to select a friend node with the largest weight from the friend node to form a new circle, and traverse the most searched for the new circle Good friend, and join the best friend to the new circle until the best friend in the new circle is looking for it.
• FIG. 1 is a schematic flow chart of an embodiment of a method for grouping a social network according to the present invention
• FIG. 2 is a schematic flow chart of performing a friend circle in a specific example
• Figure 3 is a specific example of the application of the method of the present invention for splitting
• Figure 4 is an exemplary diagram of a multiple division
• FIG. 5 is a schematic diagram of a specific example of a user revising a circle
• FIG. 6 is a schematic structural diagram of an embodiment of a packet system of a social network according to the present invention.
• FIG. 7 is a diagram showing an example of an operating environment of a packet system of one of the social networks of the present invention.
• FIG. 8 is a diagram showing an example of an operating environment of a packet system of another social network of the present invention. detailed description
• FIG. 1 is a schematic flowchart diagram of an embodiment of a method for grouping a social network according to the present invention. As shown in FIG. 1, the method for grouping a social network in this embodiment includes the following steps:
• Step S101 Obtain friend relationship data, determine weights of each friend node according to friend relationship data, and proceed to step S102;
• Step S102 Select a friend node with the highest weight from the friend node to form a new circle, traverse the best friend who is looking for the new circle, and join the best friend to the new circle until the best friend of the new circle searches for it.
• the circle is divided according to the weight of the friend node, and when the circle is performed, only one circle circle friend is processed at a time.
• the global distance calculation is avoided, and the processing amount is greatly reduced, so that the social network users can be intelligently grouped quickly, and the processing volume is small and the efficiency is high.
• the description is made by taking a new circle as an example. In practice, it was established After a new circle, there may be a friend node that has not yet joined any of the circles. On the basis of the above-mentioned embodiment, the grouping may be further performed. Therefore, after the step S102, the method may further include the following steps:
• Step S103 detecting a friend node that is not added to any circle, selecting a friend node with the highest weight from among the friend nodes that have not joined any one circle to form a new circle, traversing the best friend who is looking for the new circle, and joining the best friend The new circle until the best friend of the new circle has found it; then, for the remaining friend nodes that have not joined any of the circles, the above process can be repeated until any of the friend nodes are located in any circle, no A circled friend node is performed to implement grouping of all friend nodes.
• the weight of the friend node mentioned above reflects the degree of activity of the friend node and the degree of close relationship with other friend nodes, and may be represented by a certain value.
• the specific manner can be performed as follows:
• the weight of the current buddy node is obtained by accumulating the strengths of the relationship chains that are connected to the current buddy node.
• the relationship chain strength represents the degree of close contact between the buddy node and the buddy node or the strength of the association. The closer the buddy node is to the buddy node, the higher the relevance, and the corresponding value of the relationship chain strength. The higher the connection between the buddy node and the buddy node, the lower the relevance, indicating that the more distant the relationship between the two, the lower the value of the corresponding relationship chain strength.
• the specific form of the function/( ⁇ ) that determines the strength of the relationship chain can be determined according to the specific use environment, such as the frequency of the connection, the attribute of the relationship chain, the type, and the like, based on the meaning of the relationship chain strength, the function /( ⁇ ) The specific form is related to the close relationship between the buddy nodes.
• the frequency of the connection if the frequency of the connection between the two friend nodes is higher, the value of the corresponding relationship chain strength is also higher.
• the value of the corresponding relationship chain strength is higher. If two friend nodes are indirectly connected (the two are not directly connected, but have a common The friend node), then the value of the relationship chain strength of the two is lower than when the two are directly connected, and the specific determination manner is not described here.
• the weight of the current partner node can be obtained by accumulating the relationship chain strengths connected with the current friend node, which can be expressed by the following formula:
• the weight of the friend node is represented, and the relationship chain strength between the friend node and the friend node is represented.
• a circle is a collection of similar groups of friends, with the circle labeled ⁇ , c 2 ⁇ c k ⁇ . If a friend node belongs to a circle, it is denoted as e C . And if a node does not belong to a circle but is directly connected to a friend node in the circle, it is recorded as ⁇ C.
• a node that satisfies ⁇ is called a friend node of a circle.
• the circle score can be determined by the ratio of the sum of the relationship chain strengths between the member nodes in the circle and the difference between the outer circle connection penalty value and the sum of the relationship chain strengths of all the connections of the circle. According to this, intuitively, the circle score can be determined by the following formula:
• Circle score (number of connections in the circle - penalty for extra-circle connection) / total number of connections in the circle
• the circle score of the circle can be determined by the following formula :
• ⁇ represents the circle's circle score
• e C t indicates that the friend node is a member of the circle
• j to C k indicates that the friend node is directly connected to the friend node in the circle, indicating the relationship chain strength between the friend nodes.
• £ fe . indicates the circle score of the circle after joining the node
• ⁇ : 3 ⁇ 4 . indicates the amount of change in the circle score after the circle G joins the node.
• FIG. 2 is a flow chart showing the process of performing a friend circle in a specific example. In this example, the description is made by dividing all of the friend nodes into circles.
• the circle circle By the method of the circle circle as described above, it only processes the circle friends of one circle at a time, avoiding the global distance calculation, so that the calculation amount is greatly reduced, so that the social network users can be intelligently grouped quickly.
• the best friend b is selected from all the nodes directly connected to the circle C1, and merges into the circle C1;
• the buddy node information can be quickly grouped.
• some nodes may belong to multiple circles at the same time. Therefore, based on the above-mentioned results of the circle, it is also possible to perform The correction of the multi-circle can be determined based on the proportion of the relationship of the relationship of the buddies of the buddy in the two or more circles, that is, after the step S103, the step of:
• Step S104 Determine the proportion of the relationship chain of the friend node of each circle in the circle, and determine whether the proportion of the relationship chain of the friend node is greater than a preset weight threshold. If yes, add the friend node to the circle.
• the relationship chain weight may be determined by a ratio of a sum of relationship strengths of the relationship between the friend node and the node in the circle to the weight of the friend node.
• the above relationship chain weight can be determined by:
• /3 ⁇ 4 represents the proportion of the relationship of the circle's buddy node in the circle
• the proportion of the relationship chain indicates the proportion of the relationship chain of the buddy node in the circle to its own relationship chain, indicating that the buddy node is a member of the circle
• ⁇ w y represents the weight of the buddy node.
• the user can adjust the result of the splitting according to the need to complete the final splitting, that is, after the above step S103 or the above step S104, Including steps:
• Step S105 Receive a user adjustment instruction, and move the friend node selected by the user to a circle specified by the user.
• FIG. 5 is a schematic diagram showing the adjustment of the splitting result by the user in a specific example.
• FIG. 5-1 before the grouping, there are a total of 9 buddy nodes, which are obtained after the above-described lap process of the present invention.
• the user can make adjustments to adjust buddy 1 from group 1 to group 2 to get the final grouping results shown in Figure 5-3.
• the last grouping result can be stored in the circled result database, so that when the user logs in in the subsequent process, the grouping result can be directly read without repeating the grouping, and the specific implementation manner is not here. Describe in detail.
• the present invention also provides a grouping system of a social network.
• Figure 6 A schematic structural diagram of an embodiment of a packet system of a social network of the present invention is shown.
• the grouping system of the social network in this embodiment includes:
• a relationship chain processing unit 601 configured to acquire friend relationship data, and determine weights of each friend node according to friend relationship data;
• the circle unit 602 is configured to select a friend node with the highest weight from the friend node to form a new circle, traverse the best friend who is looking for the new circle, and join the best friend to the new circle until the best friend of the new circle Looking for it.
• the circle is divided according to the weight of the friend node, and when the circle is performed, only one circle circle friend is processed at a time.
• the global distance calculation is avoided, and the processing amount is greatly reduced, so that the social network users can be intelligently grouped quickly, and the processing volume is small and the efficiency is high.
• the above-mentioned circle unit 602 is further configured to detect a friend node that is not added to any one circle, select a friend node that has the greatest weight from among the friend nodes that have not joined any circle to form a new circle, and traverse the best friend who is looking for the new circle, and Add the best friend to the new circle until the best friend of the new circle is looking for it, and any of the friend nodes are in any of the circles.
• the foregoing relationship chain processing unit 601 may include:
• the relationship chain strength determining unit 6011 is configured to determine a relationship chain strength between each friend node and the friend node.
• the weight determining unit 6012 is configured to accumulate each relationship chain strength that is connected to the current friend node, and obtain the weight of the current friend node. .
• the relationship chain strength represents the degree of close contact between the buddy node and the buddy node or the strength of the association. The closer the buddy node is to the buddy node, the higher the relevance, and the corresponding value of the relationship chain strength. The higher the connection between the buddy node and the buddy node, the lower the relevance, indicating that the more distant the relationship between the two, the lower the value of the corresponding relationship chain strength.
• the best friend mentioned refers to the friend node of the circle
• the circle can increase the circle score of the circle after joining the circle. Friends node.
• the circle score may be determined by the ratio of the sum of the relationship chain strengths between the member nodes in the circle to the sum of the difference between the outer circle connection penalty values and the sum of the relationship chain strengths of all the connections of the circle.
• the circle unit 602 can use the following formula to determine the circle score:
• ⁇ represents the circle score
• e C t indicates that the friend node is a member of the circle
• ⁇ indicates that the friend node is directly connected to the point in the circle, indicating the strength of the relationship between the friend nodes.
• some friend nodes may belong to multiple circles at the same time. Therefore, based on the above-mentioned circled results, multiple circle corrections can be performed. When multiple circle correction is performed, one node can be based on one node.
• the grouping system of the social network in the two or more circles is determined, that is, the grouping system of the social network of the present invention may further include: a multi-circle unit 603 connected to the above-mentioned circle unit 602, for respectively determining The relationship chain proportion of the friend nodes of each circle, and when the relationship chain proportion of the friend node is greater than the preset weight threshold, the friend node is added to the circle.
• the relationship chain weight may be determined by a ratio of a sum of relationship strengths of the relationship between the friend node and the node in the circle to the weight of the friend node.
• the multiple circle unit 603 can determine the relationship chain weight by using the following formula:
• /3 ⁇ 4 represents the relationship chain weight of the circle's friend node, indicating that the node is a member of the circle, indicating the strength of the relationship between the friend nodes, and ⁇ ; indicating the weight of the node.
• the user revision unit 604 is configured to receive a user adjustment instruction, and move the friend node selected by the user to a circle specified by the user.
• the above-mentioned grouping system of the social network of the present invention the method for determining the weight of the specific buddy node, the method for dividing the circle, the method for multi-circle, and the method for modifying the user may be the same as in the grouping method of the social network of the present invention. I will not repeat them here.
• the storage medium may be a magnetic disk, an optical disk, a read-only memory (ROM), or a random access memory (Random Access Memory).
• the method of the embodiment of the present invention as described above may be installed on a specific machine device in the form of computer software, and the above-described grouping process is completed by controlling the relevant processing device while the software is running.
• 7 and 8 respectively show exemplary diagrams of two operating environments of the operating system of the packet system of the social network of the present invention.
• the grouping of social networks is performed by a web server 701 that provides network social services.
• a memory 7011 for storing software corresponding to a packet system of a social network and a processor 7012 for executing the software processing are included.
• the network server 701 further includes a relational chain database 7013 for providing friend relationship data, and a circled result database 7014 for storing the result of the circle of the social network grouping of the present invention.
• the location of the relationship chain database 7013 and the circled result database 7014 can be freely set, or can be set separately on other servers, as long as the friend relationship data can be provided through the relational chain database 7013, and the circled result database 7014 is obtained.
• the storage of the result of the circle can be achieved.
• the method of the present invention when the method of the present invention is applied, it can be stored in the memory 7011 of the network server 701 in a software program.
• the specific process of performing social network grouping is performed by controlling the processor 7012.
• the result of the circle obtained by the processor 7012 can be transmitted to the client PC for viewing by the user, and the user can be easily revised.
• the resulting circled result is sent to the circled result database 7014 for storage.
• the memory 7011 may be a storage device capable of storing computer program software such as a hard disk, a chip, or an optical disk, as long as the program software can be stored.
• the processor 7012 may be a device such as a CPU capable of running program software and performing related processing.
• the device displayed to the user is a client PC.
• other devices capable of interacting with the user such as a PDA, a tablet, a laptop, and an intelligent device, may be used. Mobile phones and more.
• the grouping of the social network is performed by the client PC 801 that interacts with the user.
• a memory 8011 for storing software corresponding to a packet system of a social network and a processor 8012 for executing the software processing are included.
• a network server 802 is further included, which also includes a relational chain database 8021 for providing friend relationship data, and a ringing result for storing the social network packet of the present invention.
• the circled result database 8022 In fact, the location of the relationship chain database 8021 and the circled result database 8022 can be freely set, or can be set separately on other servers, as long as the friend relationship data can be provided through the relational chain database 8021, and the distribution result database 8022 is obtained. The storage of the result of the circle can be achieved.
• the method of the present invention when it is applied, it may be stored in the memory 8011 of the client PC 801 in a software program.
• the software program When the software program is running, the specific social network grouping described above is performed by controlling the processor 8012. process.
• the result of the circle obtained by the processor 8012 can be directly viewed by the user, and the user can be easily revised.
• the resulting circled result is sent to the circled result database 8022 for storage.
• Storage may be a storage device capable of storing computer program software, such as a hard disk, a chip, or an optical disk, as long as the program software can be stored.
• the processor 8012 may be a device such as a CPU that can execute program software and perform related processing.
• the installation of the system of the present invention on a client PC is described as an example. Based on actual needs, other devices capable of interacting with the user, such as a PDA, a tablet, and a notebook, may be installed. Computers, smartphones, etc.

Landscapes

• Engineering & Computer Science (AREA)
• Business, Economics & Management (AREA)
• Theoretical Computer Science (AREA)
• General Physics & Mathematics (AREA)
• Physics & Mathematics (AREA)
• Marketing (AREA)
• Entrepreneurship & Innovation (AREA)
• Quality & Reliability (AREA)
• Strategic Management (AREA)
• Tourism & Hospitality (AREA)
• Human Resources & Organizations (AREA)
• General Business, Economics & Management (AREA)
• Operations Research (AREA)
• Economics (AREA)
• Computer Networks & Wireless Communication (AREA)
• Signal Processing (AREA)
• General Engineering & Computer Science (AREA)
• Management, Administration, Business Operations System, And Electronic Commerce (AREA)
• Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
• Computing Systems (AREA)

Priority Applications (7)

Applications Claiming Priority (2)

Related Child Applications (1)

Publications (1)

Family

ID=49583089

Family Applications (1)

Country Status (8)

Families Citing this family (23)

Citations (3)

Family Cites Families (20)

• 2012
  • 2012-05-15 CN CN201210150066.XA patent/CN103426042B/zh active Active
• 2013
  • 2013-03-20 RU RU2014150519A patent/RU2607621C2/ru active
  • 2013-03-20 KR KR1020147034852A patent/KR101685564B1/ko active Active
  • 2013-03-20 IN IN10382DEN2014 patent/IN2014DN10382A/en unknown
  • 2013-03-20 AP AP2014008054A patent/AP2014008054A0/xx unknown
  • 2013-03-20 WO PCT/CN2013/072946 patent/WO2013170659A1/zh not_active Ceased
  • 2013-03-20 BR BR112014028642A patent/BR112014028642A2/pt not_active Application Discontinuation
• 2014
  • 2014-11-14 US US14/541,398 patent/US10462253B2/en active Active
• 2019
  • 2019-09-17 US US16/573,977 patent/US11032391B2/en active Active

Patent Citations (3)

Also Published As

Similar Documents

Legal Events