Unlock instant, AI-driven research and patent intelligence for your innovation.
A Fuzzy Search Method Based on Fragmented Social Relationship Data
What is Al technical title?
Al technical title is built by PatSnap Al team. It summarizes the technical point description of the patent document.
A social relationship and fuzzy search technology, applied in the field of social networks, can solve problems such as incomplete and inaccurate data, achieve the effects of enhancing reliability, reducing computational complexity, and making up for missing data
Active Publication Date: 2022-04-08
重庆智多信息发展有限公司 +1
View PDF9 Cites 0 Cited by
Summary
Abstract
Description
Claims
Application Information
AI Technical Summary
This helps you quickly interpret patents by identifying the three key elements:
Problems solved by technology
Method used
Benefits of technology
Problems solved by technology
[0004] Aiming at the deficiencies in the existing technology, this paper proposes a fuzzy search algorithm, which can still work effectively even when the data is incomplete and inaccurate
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
Click on the blue label to locate the original text in one second.
Reading with bidirectional positioning of images and text.
Smart Image
Examples
Experimental program
Comparison scheme
Effect test
Embodiment 1
[0028] like figure 1 As shown, the present invention proposes a fuzzy search method based on social relationship fragment data,
[0029] Step a: Obtain known accounts a, b, c, and d, and the number of candidate target accounts to be output is 2,
[0030] Step b: Enter known accounts a, b, c, d,
[0031] Step c: Determine the direct friendship of the existing account:
[0032] Order V 0 Represents the set of a, b, c, d, V 0 ={a, b, c, d}, V' represents the set of friends of a, b, c, d, V'={b, c}∪{a, e}∪{a, e, f}∪{ f, g}={a, b, c, e, f, g}, set operation: V 1 =V'\V 0 , V 1 =V'\V 0 = {e, f, g}, let E 1 means V 0 to V 1 The set of friend relations, then E 1={,,,,};
[0033] Step d: Determine the indirect friendship relationship of the existing account (two people are friends with another person, then they are indirect friends with each other):
[0034] Let V″ denote V 1 The set of friends in the account, V″={b, c, f, g}∪{c, d}∪{d, e}={b, c, d, e, f, g}, perform the s...
Embodiment 2
[0052] like figure 2 As shown, the present invention proposes a fuzzy search method based on social relationship fragment data,
[0053] Step a: Obtain known accounts a, b, and c, and the number of candidate target accounts to be output is 2,
[0054] Step b: Enter known accounts a, b, c,
[0055] Step c: Determine the direct friendship of the existing account:
[0056] Order V 0 Represents the set of a, b, c, V 0 ={a, b, c}, V' represents the set of friends of a, b, c, V'={b, f, g}∪{a, f}∪{d, f, g}={a, b, d, f, g}, perform set operations: V 1 =V'\V 0 , V 1 =V'\V 0 = {d, f, g}, let E 1 means V 0 to V 1 The set of friend relations, then E 1 ={,,,,,};
[0057] Step d: Determine the indirect friendship relationship of the existing account (two people are friends with another person, then they are indirect friends with each other):
[0058] Let V denote V 1 The set of friends in the account, V′={c, e}∪{a, b, c, e, g}∪{a, c, e, f}={a, b, c, e, f, g }, perform set op...
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
Login to View More
Abstract
The invention provides a fuzzy search algorithm, which can still work effectively under the condition of incomplete and inaccurate data. First, several known friend accounts that are closely related to the target friend are obtained, and the direct friends and indirect friends of the known accounts are obtained through set operations, and a directed graph is generated. According to the data reliability and the number of independent contact paths, the intimacy between the two accounts is combined and calculated, and through the matrix list, the intimacy of each target friend is summed by column to obtain the result. This method creatively proposes a social search model that adapts to fragmented data occasions, makes up for the lack of data through indirect social relationships, and enhances the reliability of data through multiple contact relationships. The algorithm also reduces computational complexity through dynamic programming and other means to ensure that results can be quickly searched in massive social data.
Description
technical field [0001] The invention relates to the field of social network, in particular to a data search method. Background technique [0002] At present, with the development of information communication technology, the development of information providing technology that provides information in various fields to multiple subscribers in real time through at least one host server. Based on this, assume that we hold data of a commonly used social software, such as QQ, WeChat or Weibo, which will record accounts and friend relationships between accounts. In this way, we can find acquaintances of acquaintances through this friendship. Conversely, if we know that 5 people A, B, C, D, and E are closely related, if we have identified the accounts b, c, d, and e of B, C, D, and E, but the account of A is unknown, we can analyze b, c, d, and e's mutual friends to lock A's account in a small range, and determine A's account through other auxiliary means. If the social data we h...
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
Application Date:The date an application was filed.
Publication Date:The date a patent or application was officially published.
First Publication Date:The earliest publication date of a patent with the same application number.
Issue Date:Publication date of the patent grant document.
PCT Entry Date:The Entry date of PCT National Phase.
Estimated Expiry Date:The statutory expiry date of a patent right according to the Patent Law, and it is the longest term of protection that the patent right can achieve without the termination of the patent right due to other reasons(Term extension factor has been taken into account ).
Invalid Date:Actual expiry date is based on effective date or publication date of legal transaction data of invalid patent.
Login to View More 
Login to View More