CN107025607B - Accurate positioning social processing method - Google Patents

Accurate positioning social processing method Download PDF

Info

Publication number
CN107025607B
CN107025607B CN201710289776.3A CN201710289776A CN107025607B CN 107025607 B CN107025607 B CN 107025607B CN 201710289776 A CN201710289776 A CN 201710289776A CN 107025607 B CN107025607 B CN 107025607B
Authority
CN
China
Prior art keywords
user
information
distribution diagram
profile
user profile
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201710289776.3A
Other languages
Chinese (zh)
Other versions
CN107025607A (en
Inventor
秦景龙
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Publication of CN107025607A publication Critical patent/CN107025607A/en
Application granted granted Critical
Publication of CN107025607B publication Critical patent/CN107025607B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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
    • G06Q50/00Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/01Social networking
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/953Querying, e.g. by the use of web search engines
    • G06F16/9535Search customisation based on user profiles and personalisation

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • General Health & Medical Sciences (AREA)
  • Economics (AREA)
  • Primary Health Care (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • Human Resources & Organizations (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Health & Medical Sciences (AREA)
  • Computing Systems (AREA)
  • Data Mining & Analysis (AREA)
  • General Engineering & Computer Science (AREA)
  • Information Transfer Between Computers (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The embodiment of the invention discloses a processing method for accurately positioning social contact, relates to the technical field of information, and can solve the problem that a user cannot be accurately positioned and searched to realize social contact. The method of the invention comprises the following steps: acquiring at least one user distribution diagram corresponding to the keyword; determining a target user profile among the at least one user profile based on a user selection instruction; and displaying the target user distribution diagram.

Description

Accurate positioning social processing method
Technical Field
The invention relates to the technical field of information, in particular to a social processing method capable of accurately positioning.
Background
With the development of internet technology, various social software applications have become indispensable requirements of user terminals. Currently, when social software searches for friends, users nearby that meet the conditions can be searched for based on the geographic location and the search conditions. The search condition may be gender, age, colleges and the like, for example, a user of the same age who is nearby and reads at a college is searched. However, the number of search results is too large to realize accurate user search.
Disclosure of Invention
The embodiment of the invention provides a processing method for accurately positioning social contact, which can solve the problem that a user cannot be accurately positioned and searched to realize social contact.
In order to achieve the above purpose, the embodiment of the invention adopts the following technical scheme:
in a first aspect, an embodiment of the present invention provides a method for processing a pinpoint social, including:
acquiring at least one user distribution diagram corresponding to the keyword;
determining a target user profile among the at least one user profile based on a user selection instruction;
and displaying the target user distribution diagram.
With reference to the first aspect, in a first possible implementation manner of the first aspect, the method further includes:
based on a chat request instruction, sending a chat request to a target user in the target user distribution map, wherein the chat request instruction carries identification information of the target user; alternatively, the first and second electrodes may be,
and sending a friend adding request to the target user in the target user distribution diagram based on a friend adding instruction, wherein the friend adding instruction carries identification information of the target user.
With reference to the first aspect, in a second possible implementation manner of the first aspect, the user profile carries a profile name and/or description information;
the obtaining of the at least one user profile corresponding to the keyword includes:
and acquiring at least one user profile containing the keywords in the profile name or the description information.
With reference to the first aspect, in a third possible implementation manner of the first aspect, the obtaining at least one user profile corresponding to the keyword includes:
acquiring each user distribution diagram corresponding to the keyword; alternatively, the first and second electrodes may be,
obtaining each peripheral user distribution map corresponding to the keyword, wherein the peripheral user distribution map is a user distribution map of which the geographic position is within a current preset geographic position range; or
And acquiring a user distribution diagram corresponding to the keyword, and a peer user distribution diagram, a previous user distribution diagram and a next user distribution diagram of the user distribution diagram.
With reference to the first aspect, in a fourth possible implementation manner of the first aspect, the method further includes:
acquiring a related user distribution diagram of the target user distribution diagram;
and displaying the associated user distribution diagram.
With reference to the first aspect, in a fifth possible implementation manner of the first aspect, the method further includes:
generating a user distribution diagram based on a distribution diagram making instruction, wherein the user distribution diagram carries: at least one item or any combination of distribution diagram names, distribution diagram description information and user information;
and sending the user distribution graph to a server.
With reference to the fifth possible implementation manner of the first aspect, in a sixth possible implementation manner of the first aspect, the user information includes: any one or any combination of identification information, seat information, user preference information, user habit information and social status information of the user.
With reference to the first aspect, in a seventh possible implementation manner of the first aspect, the method further includes:
and sending the current user information to a server so that the server adds the current user information in the target user distribution map, wherein the current user information comprises any one or any combination of identification information, seat information, user preference information, user habit information and social status information of a current user.
With reference to the seventh possible implementation manner of the first aspect, in an eighth possible implementation manner of the first aspect, the current user information further includes: information of the time period of the current user.
With reference to the first aspect, in a ninth possible implementation manner of the first aspect, the target user profile carries user states, where the user states include an administrator state and a general user state;
when the current user state comprises an administrator state, the method further comprises:
receiving request information sent by user equipment corresponding to a common user state;
detecting an operation instruction based on the request information;
and displaying operation result information corresponding to the user operation instruction.
With reference to the ninth possible implementation manner of the first aspect, in a tenth possible implementation manner of the first aspect, the target user profile is a restaurant user profile;
the request information comprises guest calling, ordering and account settling information;
the operation instructions comprise past viewing instructions and non-viewing instructions;
the operation result information corresponding to the past viewing instruction comprises the viewing information, and the operation result information corresponding to the non-viewing instruction comprises the information to be processed.
With reference to the first aspect, in an eleventh possible implementation manner of the first aspect, the target user profile carries shared file information;
when the target user profile includes a current user, the method further includes:
sending a request for sharing files to a server;
and receiving the shared file sent by the server.
With reference to the eleventh possible implementation manner of the first aspect, in a twelfth possible implementation manner of the first aspect, when the target user profile does not include a current user, the method further includes:
sending a file viewing request to other users included in the target user profile;
when receiving the viewing permission information sent by the other users, sending a shared file request to a server;
and receiving the shared file sent by the server.
In one embodiment, the method may further comprise:
receiving scanning information sent by a user terminal after scanning the two-dimensional code;
and adding the user corresponding to the user terminal into the user distribution diagram corresponding to the two-dimensional code according to the scanning information.
According to the method for processing the social contact, at least one user distribution map corresponding to the keywords is obtained; determining a target user profile among the at least one user profile based on a user selection instruction; and displaying the target user distribution diagram. The method can realize that a plurality of corresponding user distribution maps are obtained according to the keywords which can be the keywords interested by any user, but not the simple search conditions in the prior art, thereby reducing the number of search results; and one of the user profiles is determined as the target user profile based on the user selection, so that the number of search results can be further reduced, and friends can be accurately searched.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without creative efforts.
FIG. 1A is a flow chart of a method for pinpoint social processing in accordance with an embodiment of the present invention;
FIG. 1B is a diagram illustrating a user profile in an embodiment of the invention;
FIG. 1C is another schematic diagram of a user profile in an embodiment of the invention;
FIG. 2A is another flow chart of a method for pinpoint social processing according to an embodiment of the present invention;
FIG. 2B is another diagram of a user profile in an embodiment of the invention;
FIG. 2C is another diagram of a user profile in an embodiment of the invention;
FIG. 3 is a schematic diagram of a two-dimensional code according to an embodiment of the invention;
FIG. 4 is a model diagram in an embodiment of the invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
An embodiment of the present invention provides a method for processing a precisely located social network, as shown in fig. 1A, the method includes:
101. and acquiring at least one user distribution diagram corresponding to the keyword.
The user profile may carry a profile name, description information, user information, and the like.
For example, as shown in fig. 1B, the user profile corresponding to a classroom is shown. The distribution graph name included therein is "222 classroom"; the description information is 'Yifu building of Qinghua university, high-number course, 1 month and 1 day in 2017'; each user information includes user information of each student and teacher in the classroom.
As shown in fig. 1C, the user profile is a user profile corresponding to a certain dining room. The name of the distribution diagram included in the table is 'brocade restaurant'; the description information is 'Guangdong cuisine, dinner, commercial meal, 2 months and 1 day in 2017'; each user information includes user information of each diner in the restaurant.
For the embodiment of the present invention, the user information may include: identification information, seat information, user preference information, user habit information, social status information, and the like. The identification information may be a user name, a user nickname, a user ID, a user avatar, or the like, and is used for identifying the user information; the seat information is used for representing the position of each user in the current environment so as to accurately search the unique user to be added through the seat information; the user preference information can comprise evaluation of commodities or shops, topic discussion of microblog participation and the like, so that friends with the same preference can be added through the user preference information; the user habit information can comprise user common software, a user frequently-going website, a user frequently-strolling a shop and the like, so that friends with the same habit can be added through the user habit information; the social status information may include occupation, title, etc., such as: professor of Qinghua university, Tengchong corporation product research and development department, sunshine hospital courtyard, network self-media and the like, so as to realize visualization, visualization and layering of social relationship of users.
For the embodiment of the invention, at least one user distribution map corresponding to the key words in the preset geographic range can be obtained according to the current geographic position. In the embodiment of the invention, the user distribution map with a longer distance can be screened out by acquiring the user distribution map in the preset geographic range, and the number of search results can be further reduced, so that friends can be accurately searched.
102. A target user profile is determined among the at least one user profile based on the user selection instruction.
For the embodiment of the invention, when a plurality of user profiles exist, the profile names of the user profiles can be sequentially displayed, or thumbnails of the user profiles can be sequentially displayed, so that a user can select a target user profile from the user profiles.
In the embodiment of the present invention, if a selection instruction of a user is not detected within a preset time period, any one of the plurality of user profiles may be used as the target user profile. For example, the first of the plurality of user profiles is taken as the target user profile, or the user profile closest to the current user among the plurality of user profiles is taken as the target user profile, or the user profile with the highest number of visits among the plurality of user profiles is taken as the target user profile.
103. And displaying the target user distribution diagram.
Compared with the prior art, the embodiment of the invention can realize that a plurality of corresponding user distribution maps are obtained according to the keywords which can be the interested keywords of any user and are not simple search conditions in the prior art, thereby reducing the number of search results; and one of the user profiles is determined as the target user profile based on the user selection, so that the number of search results can be further reduced, and friends can be accurately searched. In addition, the embodiment of the invention not only can directly search the user distribution diagram where the target user is located, but also can obtain the relevant information of the target user through other user distribution diagrams, and the target user can be indirectly found through the relevant information. For example, the qq number, the micro signal code, the mailbox and other contact ways of the target user are searched in the ' Qinghua university 17 ' management system distribution diagram '. Even if any person has not registered his/her own information in the user profile, the cartographer can directly use the information within the allowable range of the person. If a user posts information in the ' Qinghua university 17 ' management department distribution diagram ' (if a post allows the distribution diagram to be associated with own personal information), when the post personal information is changed, the system provides two options of automatic updating and manual updating, and if the automatic updating is selected, the system automatically updates related contents and displays the specific updated contents. If manual update is selected, the administrator of the "Qinghua university 17's management department profile" decides whether to update the relevant content. The manual update is mainly to prevent other users from disseminating bad information. In this way, the content integration of cross-platform and cross-relationship graphs can be realized: for example, the user a only needs to update its own related information, and all the relationship graphs related to the related information of the user a can update the information. For example, live broadcast, if the anchor a updates its own live broadcast information, the live broadcast information related to the anchor a, such as the relationship diagram "anchor circle", "XX platform anchor", "YY platform anchor", associated with the anchor a, can be updated in real time through automatic update. As another example, the "live game" relationship diagram contains all information about the live game, and the user can see the live game information in all platforms in the "live game" relationship diagram.
Another embodiment of the present invention provides a method for processing a precisely located social network, as shown in fig. 2A, the method includes:
201. and acquiring at least one user profile containing the keywords in the profile name or the description information.
The user profile carries profile names and/or description information.
For example, for the user profile shown in FIG. 1B, the profile name is "222 classroom"; if the description information is ' Qinghua university Yifu building, high-count course ', 1 month and 1 day in 2017 ', the user distribution diagram can be found through the keyword ' 222 classroom ', and can also be found through the keyword ' Qinghua university Yifu building, high-count course '.
As another example, for the user profile depicted in FIG. 1C, the profile name is "Splendid restaurant"; if the description information is 'Guangdong cuisine, dinner, commercial meal' and '2 month and 1 day' in 2017, the user distribution diagram can be found through the keyword 'brocade' or 'restaurant', and can also be found through the keyword 'commercial meal' and 'Guangdong cuisine'.
It should be noted that the keyword may be all contents in the profile name or the description information, or may be part of contents in the profile name or the description information, and the embodiment of the present invention is not limited.
The existing social software only aims at individual push messages, and the embodiment of the invention can push dynamic contents according to the name of the user profile or the description information of the user profile so as to realize the pushing of specific information aiming at specific crowds and groups. For example, college entrance information is pushed to members of the high three student relationship diagram, and employment related information is pushed to members of the big four student relationship diagram.
Optionally, step 201 may be to obtain each user profile corresponding to the keyword.
Alternatively, step 201 may also be to obtain each peripheral user profile corresponding to the keyword. The peripheral user distribution map is a user distribution map of which the geographic position is within a current preset geographic position range.
In the embodiment of the invention, the user distribution map with a longer distance can be screened out by acquiring the user distribution map in the preset geographic range, and the number of search results can be further reduced, so that friends can be accurately searched.
Alternatively, step 201 may also be to obtain a user distribution diagram corresponding to the keyword, and a peer user distribution diagram, a previous user distribution diagram, and a next user distribution diagram of the user distribution diagram. For example, if "three years and two shifts for first middle school in beijing" is searched, the corresponding peer user distribution map is "three years and one shift for first middle school in beijing", the previous level user distribution map is "three grades for first middle school in beijing", and the next level user distribution map is "mathematical learning group for three years and two shifts for first middle school in beijing".
For embodiments of the present invention, radar functionality may be added when searching for user profiles. Specifically, the user can set the searchable range and the searchable range of the user, so that the social activity can be established through the relative distance for communication. For example, when a user a sees a certain interested user B on a train, the radar may be turned on, and if the opponent is allowed to be searched, and the user a is within the searchable range of the user B, the user a may transmit accost information to the user B.
For embodiments of the present invention, the user profile may be created locally and uploaded to the server. In the embodiment of the invention, the user distribution diagram can be generated based on the distribution diagram making instruction; and sending the user profile to the server. In the embodiment of the present invention, in order to ensure the authenticity of the information, an organization or a group, etc. related to the user profile may send an authentication request to the server, after the server authenticates the information, the user profile may be upgraded to an authenticated version (for example, an authenticated identifier or an authenticated word may be added to the user profile), and the server itself may also define some official user profiles, so as to improve the authenticity of the information and improve the user experience. Such as shown in fig. 2B and 2C, are profiles of authenticated users.
Wherein the user profile carries: at least one of profile name, profile description information, individual user information, or any combination thereof. In the embodiment of the invention, the distribution diagram name can be used for identifying the distribution diagram, the distribution diagram name and the distribution diagram description information can be used for searching keywords, and the user information can facilitate searching friends to be added.
The user information may include: any one or any combination of identification information, seat information, user preference information, user habit information and social status information of the user. The identification information may be a user name, a user nickname, a user ID, a user avatar, or the like, and is used for identifying the user information; the seat information is used for representing the position of each user in the current environment so as to accurately search the unique user to be added through the seat information; the user preference information can comprise evaluation of commodities or shops, topic discussion of microblog participation and the like, so that friends with the same preference can be added through the user preference information; the user habit information can comprise user common software, a user frequently-going website, a user frequently-strolling a shop and the like, so that friends with the same habit can be added through the user habit information; the social status information may include occupation, title, etc., such as: professor of Qinghua university, Tengchong corporation product research and development department, sunshine hospital courtyard, network self-media and the like, so as to realize visualization, visualization and layering of social relationship of users.
For the embodiment of the invention, the user can edit the user profile special for the user, such as a relationship graph of the relationship among the people, and can define the corresponding position of the related people in the relationship graph. The server can provide common user distribution diagrams such as a template of a personal relationship diagram, an organization member composition diagram, members required by an entrepreneur group, a responsibility relationship diagram, a quality relationship diagram which should be possessed by successful persons and the like, the user only needs to edit on the basis, and the related user information is added to a specific position, and the software is different from a common friend classification, and the user can define multiple identities of friends by using the software. For example: zhang III is a computer professional in the corresponding position of the user distribution diagram of Wangzhi, and can also be a computer engineer in the relation diagram of the startup team of Wangzhi, Li IV is a legal professional, and the like. In the embodiment of the invention, the user distribution diagram special for the user can facilitate the user to check the common information of the friends.
According to the embodiment of the invention, the social status information is displayed in the user distribution map, so that the visualization, visualization and layering of the social relationship of the user can be realized, the user can conveniently search the friends to be added according to the requirement, and the user can be accurately searched. For example, when a certain student is interested in a stock transaction, a user whose "social status information" includes a stock course professor may be searched in a "central finance university" user relationship diagram as a user to be added.
For the embodiment of the invention, the keyword search can be carried out again in the user relationship distribution map so as to find out the corresponding user. For example, when the number of users in the user relationship distribution map is large, the information such as the identification information, seat information, user preference information, user habit information, social status information and the like of the users in the user information can be searched through the keywords, so that the users can be quickly searched.
202. A target user profile is determined among the at least one user profile based on the user selection instruction.
For the embodiment of the invention, when a plurality of user profiles exist, the profile names of the user profiles can be sequentially displayed, or thumbnails of the user profiles can be sequentially displayed, so that a user can select a target user profile from the user profiles.
In the embodiment of the present invention, if a selection instruction of a user is not detected within a preset time period, any one of the plurality of user profiles may be used as the target user profile. For example, the first of the plurality of user profiles is taken as the target user profile, or the user profile closest to the current user among the plurality of user profiles is taken as the target user profile, or the user profile with the highest number of visits among the plurality of user profiles is taken as the target user profile.
203. And displaying the target user distribution diagram.
For the embodiment of the present invention, step 203 may be followed by: acquiring a related user distribution diagram of the target user distribution diagram; and presenting the associated user profile.
The associated user distribution map is a user distribution map at the upper stage of the user distribution map, or a user distribution map at the lower stage of the user distribution map, or a user distribution map at the same stage of the user distribution map. For example, the associated user profile of the user profile "222 classroom" may be the user profile "Yifu floor 2" or "Yi fu floor" at the top level, the user profile "222 classroom third subgroup" at the bottom level, and the user profile "221 classroom" at the same level.
For the embodiment of the invention, when the user profile has a plurality of associated user profiles, because the user only acquires one of the associated user profiles under normal conditions, the server can recommend other associated user profiles with higher utilization rate to the user according to the acquired dynamic information of each associated user profile, so as to improve the use experience of the user.
For the embodiment of the present invention, in order to perfect the associated user profile, optionally, the server may send information of the associated user profile to be constructed to each user included in the user profile; optionally, the user may also make a request for an associated user profile required by the user for free or for free, and the server may send information of the associated user profile to be constructed to other users based on the associated user profile request, for example, the other users (mainly including related users) may be suggested to create the corresponding associated user profile in push information based on information of geographic location, social relationship, and the like.
In the embodiment of the invention, the range can be expanded to search for more associated friends or the range can be reduced to quickly and accurately search for friends to be added through the associated user distribution map of the target user distribution map.
For the embodiment of the present invention, the target user profile carries user states, where the user states include an administrator state and a common user state, and when the current user state includes the administrator state, step 203 may include: receiving request information sent by user equipment corresponding to the ordinary user state, detecting an operation instruction based on the request information, and displaying operation result information corresponding to the user operation instruction. In the embodiment of the invention, when the target user distribution diagram is a restaurant user distribution diagram, the request information comprises guest calling, dish ordering and account settling information, the operation instruction comprises a past viewing instruction and a non-viewing instruction, wherein the operation result information corresponding to the past viewing instruction comprises viewing information, and the operation result information corresponding to the non-viewing instruction comprises to-be-processed information.
The request information can also comprise some special requirements of guests, such as the information that the steak is cooked by a few degrees, the pepper is not put in the steak, the tea is added, and the like; the operation result information corresponding to the past viewing instruction can also comprise the identification information of the service personnel being viewed; the user state also comprises a special administrator state, the user state of the cartographer of the user distribution diagram is the special administrator state, the system defaults that the user in the special administrator state has the highest authority, and the special administrator state, the highest authority and the identity of the cartographer can be transferred after cartographing is completed.
In the embodiment of the present invention, when the operation instruction corresponding to the user equipment in the administrator state is a past viewing instruction, correspondingly, the user equipment in the ordinary user state initiating the request information displays the request processed information, for example, the waiter a will serve you.
For example, the restaurant user profile shown in fig. 1C, when the request message "guest calling information" is received, the word "guest calling" may be displayed on the table; displaying or directly displaying a corresponding operation instruction 'past viewing' button and 'unable viewing' button after the current user clicks 'guest calling', so that the current user performs clicking or touching operation; when the current user clicks or touches the 'past viewing' button, displaying the 'waiter A viewing' word; and when the current user clicks or touches the 'cannot view' button, displaying a 'to-be-processed' word.
In embodiments of the invention, guests and service personnel in the restaurant may establish social activity based on this user profile. Optionally, a one-to-one chat or a group chat may be performed between guests in the user profile, for example, the guests may comment on each dish based on the user profile. Alternatively, some simple games may be played between guests and service personnel in the user profile, for example, the service personnel may perform a lottery on each guest, the guests may be mutually awarded a red envelope, etc.
In the embodiment of the present invention, when a user chats with other users based on a user profile, if it is detected that chat information sent by other users is received and a duration of non-reply reaches a preset duration, the system may remind the current user, for example, display information such as "you have non-reply information" or "you may not reply information XX, friendship's boat cannot start stormy waves", and the current user does not display the information after clicking the information.
In the embodiment of the invention, the welcome interface of the software can be customized by a user. The user can input and add photos, characters, voice, video and the like on the welcome interface editing page. And can customize whether a welcome interface is needed, the duration of the welcome interface, and the time period during which the welcome interface can be launched.
In embodiments of the present invention, a user may define a background pattern. For example, the background pattern may be defined by time as a red picture in the morning, a light blue in the evening, etc. The background pattern may be set according to the frequency of the user touching the screen, the use time of the software, the chat target, and other conditions.
For embodiments of the present invention, specific functions of some specific characters may be defined. For example, in chatting (the state, circle of friends, etc. can also be used), the user only needs to add a question mark "? After the chat content is sent out, the system can carry out automatic detection, the chat content with the symbol cannot be directly sent to a client of the other party, the system can prompt a user to further edit, the user can select according to the content, if the user selects reference, interesting state content for reference, poetry, funny and the like can appear, if the friend circle content of other users is allowed to be searched by other people, the user can also search friend circle content published by other users, the content can be annotated with the name of the original author according to the requirement of the original author, friends can be selected to be added after clicking the original author, and the user can edit on the basis of the searched content. If a commonly used term is selected, the commonly used term associated by the user for that keyword appears in the list. After clicking, the click can be directly sent to the client of the other party. If the database is selected, the server lists the content associated with the keywords stored in the database by the user, which may be files, chat content, phone books, links, pictures, favorites, etc. Here, the contents of the database can be recalled at any time. For example, the contents of the database can be directly called by a specific character (e.g., data. For another example, when two question marks are added before the content, "the user can initiate a question, discuss a subject, and the like, the initiator can set the deadline of the question, or directly use the default set time of the group, when the set time is reached, the system can prompt the user whether to prolong the time, and if the question and the like are solved in advance, the user can end the initiated activity in advance. In this manner, the user can see the particular information whenever he enters the chat room. Keyword prompt function: for example, a user may customize a keyword (including a user name), and when the keyword appears in the chat message, the system prompts the user that the keyword appears in the chat message, and after clicking, the user can view the specific location of the keyword and the corresponding specific content. This feature is applicable to all viewable information within the user's rights, shared materials, circle of friends, push messages, etc. Through the functions, the problem that important information cannot be seen or key information is missed due to the fact that the chat information is too much, the user is busy and the like can be solved. As another example, the content may be preceded by an exclamation point! "indicates a notification. If the user does not use this function correctly, "? "or"! When the user wants to use the method, the property of the content is changed in a pop-up dialog box, or the user directly clicks to initiate a question and sends out options such as a notice to realize the functions. One or more of the above functions can be performed by long pressing the chat content even without using a specific function of a specific character.
Correspondingly, the user can select intelligent answers by pressing the chat content of the opposite side for a long time, at the moment, the system can provide an optional reply content list for reference according to the chat content of the opposite side, and the user can edit and reply the opposite side on the basis.
For the embodiment of the present invention, the target user profile carries shared file information, and when the target user profile includes the current user, step 203 may include: and sending a shared file request to the server, and receiving the shared file sent by the server. When the target user profile does not include the current user, step 203 may be followed by: sending a file viewing request to other users included in the target user profile; when receiving the viewing permission information sent by other users, sending a shared file request to a server; and receiving the shared file sent by the server. Wherein, the other users comprise users with user states as administrator states. In the embodiment of the invention, after the shared file sent by the server is received, the operations of online watching, collecting, downloading and the like can be further carried out on the shared file.
For example, when the target user profile is a restaurant user profile, the shared file information may include a ordered menu list, which may include information such as a detailed description, a praise, and an allergen of a dish in the menu.
When the target user profile does not comprise the current user, a file viewing request can be sent to an administrator user corresponding to the target user profile, and when viewing permission information sent by the administrator user is received, the current user can view the shared file; or, a request for viewing a file may be sent to a plurality of other users in the target user profile, and when receiving viewing permission information sent by a preset number of users in the plurality of other users, the current user may view the shared file.
In the embodiment of the present invention, when receiving the viewing permission information sent by other users, a "bench" area may be displayed in the target user profile, and an identifier corresponding to the current user is displayed in the "bench" area, so as to remind each user in the target user profile: there are non-within-distribution graphs where users enter and view shared files. Wherein the user authority of the small stool area is set by an administrator. The user may also apply for the "bench" function directly like an administrator.
For the embodiment of the invention, whether the shared file information in the user distribution diagram is disclosed or not can be set. For the public shared file, any user can search the file and can send operations such as a viewing request and the like; for shared files that are not exposed, only users in the user profile may view the file, or only users in the user profile that are in an administrator status may view the file.
Step 204a, executed after step 203, sends a chat request to a target user in the target user profile based on the chat request instruction.
Wherein, the chat request instruction carries the identification information of the target user.
And a step 204b parallel to the step 204a, sending a friend adding request to the target user in the target user distribution graph based on the friend adding instruction.
And the friend adding instruction carries identification information of the target user.
For the embodiment of the present invention, the target users may include a plurality of target users, that is, in step 204a, a chat request may be sent to a plurality of interested target users; in step 204b, a friend-adding request may be sent to a plurality of interested target users. In the embodiment of the invention, by simultaneously operating a plurality of target users, the user operation can be reduced, and the user experience is improved.
For embodiments of the present invention, steps parallel to steps 204a and 204b may also be performed: and sending a dynamic viewing request to the target user in the target user distribution graph based on the dynamic viewing instruction. In the embodiment of the invention, further editing operation can be carried out based on the dynamic information of the target user, and the author information is added to be used as the dynamic information of the current user.
For embodiments of the present invention, steps parallel to steps 204a and 204b may also be performed: and sending each user profile checking request made by the user to a target user in the target user profile based on the profile checking instruction. In the embodiment of the invention, the historical footprint of the user can be acquired by checking each user distribution graph made by the target user.
In the embodiment of the invention, when the target user is in the non-disturbing state, namely, does not accept any chat request or does not accept any friend adding request, the target user can send information to the target user by sending a small paper slip to the target user. In the embodiment of the invention, the function of transmitting the small paper slip can be realized by the same friend or the same organization with the target user. If there are no common friends, the function will use a similar six-dimensional theory through more than one friend until a friend is found that a connection can be made between a and B.
Optionally, the current user information may also be sent to the server, so that the server adds the current user information in the target user profile. The current user information may include any one or any combination of identification information, seat information, user preference information, user habit information, and social status information of the current user. In the embodiment of the invention, if no common friends exist between the current user and the target user, according to the setting of the target user, for example, students in the department XX, the subject XX, users who like to travel, males and the like contribute accountants, and then the function of 'small paper slip' can be still realized.
For the embodiment of the invention, the current user information is added to the user distribution diagram, so that the user information in the user distribution diagram can be supplemented or corrected, and the integrity and the accuracy of the user distribution diagram can be improved.
Wherein, the current user information may further include: information of the time period of the current user. In the embodiment of the invention, the information of the time period of the current user is added, so that other users at the same position and different time periods can be conveniently searched, and the interest of searching the user can be improved. For example, user a would like to enter a university in the summer of 2020, user a may find other users who are still at the university or who are about to enter the university in the summer of 2020, becoming friends in advance. For another example, if the user B is about to enter a certain company product department in month 2030, the user B may find the user who is still in the company product department or is about to enter the company product department in month 2030, and know the company situation and the interpersonal relationship in advance. Similarly, the user can edit the information of the user, namely, the user reads from the first high school of Beijing from 2005 to 2008, so that other users can search the first high school of Beijing and enter the school by 05 term (or graduates by 08 term) to find the old classmates of the user.
For the embodiment of the invention, the user distribution diagram can be established based on the scene which can not be communicated, so that the communication between the users is convenient. For example, for some non-commendable microblog information or YouTube information, a user relationship graph of the microblog information or the YouTube information can be established, so that each user can comment or communicate based on the user relationship graph.
For the embodiment of the invention, an intelligent editing function can be added in the user profile, so that the user can effectively, intelligently and formally realize the corresponding function. The user can further edit according to the self requirement, relevant contents are filled in the relevant elements, and after clicking the generation button, relevant articles, icons, schematic diagrams, mails, charts, thinking diagrams and the like can be generated. For example, the content added by the user based on each element is as follows: after the user clicks the generation button, the system can automatically generate similar contents of 'the tomorrow manager opens up and discusses a new product promotion scheme in the central meeting place in a brainstorm way, and the budget is tea and dessert'. The user can further edit on the basis to ensure the integrity of the content, so that the communication efficiency and the working efficiency can be improved. Wherein, the position of the specific element in the generated article can be defined by the user.
Compared with the prior art, the embodiment of the invention can realize that a plurality of corresponding user distribution maps are obtained according to the keywords which can be the interested keywords of any user and are not simple search conditions in the prior art, thereby reducing the number of search results; and one of the user profiles is determined as the target user profile based on the user selection, so that the number of search results can be further reduced, and friends can be accurately searched. In addition, the embodiment of the invention not only can directly search the user distribution diagram where the target user is located, but also can obtain the relevant information of the target user through other user distribution diagrams, and the target user can be indirectly found through the relevant information. For example, the qq number, the micro signal code, the mailbox and other contact ways of the target user are searched in the ' Qinghua university 17 ' management system distribution diagram '. Even if any person has not registered his/her own information in the user profile, the cartographer can directly use the information within the allowable range of the person.
For a user profile with more than 1 layer of the logic hierarchy, the user can select a stereoscopic view, and like a 3D graph, the user can view the user profile as if watching a 3D model. After clicking on a particular content, the associated user profile or elements within the user profile may be entered directly.
The present example adds user a to a specified user profile a by:
1. the administrator of user profile a adds user a to user profile a.
2. And the user a scans codes or scans the graphic addition by using a terminal, or directly puts forward an addition application to an administrator of the user profile A.
When the user uses the terminal to scan codes or scan the graphic to add, it can be implemented as follows: receiving scanning information sent by a user terminal after scanning the two-dimensional code; and adding the user corresponding to the user terminal into the user distribution diagram corresponding to the two-dimensional code according to the scanning information.
3. The user a creates a user profile a by itself.
4. Through a join invitation sent by a buddy in user profile a.
If the user a is added to the user profile a by scanning the two-dimensional code of the user profile a, the two-dimensional code of the user profile a may be generated by the prior art, or may be the following two-dimensional code designed by the present invention.
Fig. 3 is a schematic diagram of a two-dimensional code newly designed by the present invention, and hereinafter, an object (such as a specific person or a user profile) represented by the two-dimensional code is simply referred to as a user of the two-dimensional code.
The areas 10, 20, 30, 40 of the two-dimensional code are partially direction identification codes, similar to images of four images in the book of changes. Each user has unique ID information, and the ID is divided into three portions to be placed in the areas 40, 50, 70, respectively. The area 60 is provided with version information of the two-dimensional code and digital information for emergency use or special use. For example, as shown in fig. 3, the ID of the user is 102310231023, the version information of the two-dimensional code is 2, and the special information is 511. All the information in the areas 40, 50, 70, 60 is set collectively in the area 80. Since all the information in the two-dimensional code is composed of black and white dot information, i.e. 1 is a black dot, 0 is a white dot, and the area 90 is the number of 0 and 1 in all the information. When the information appearing in the areas 40, 50, 70, 60, 80, and 90 are all aligned after the direction is determined, the same information contained in the two-dimensional code can be used as correct information. The two-dimensional code is characterized in that the information in the two-dimensional code, namely binary digits consisting of ID, version information and special information, corresponds to the information set by a two-dimensional code maker, and the reading of the two-dimensional code information is realized. Because the generated binary digits are unique, by utilizing the characteristic, a two-dimensional code maker can correspondingly set any information. Taking the value 1023102310232511 in the figure as an example, the two-dimensional code maker can make the unique value correspond to the following information. The premise is that a two-dimensional code maker uploads information to be corresponding to the server.
1. Text, sound, web address, image, video, etc.
If the two-dimensional code maker includes the text, the sound and the like in the information corresponding to the two-dimensional code, after the two-dimensional code is scanned, the server sends the text, the sound and the like uploaded by the two-dimensional code maker to the two-dimensional code scanner, and the information is read.
2. A limit is made to the number of times the user can read and recognize the two-dimensional code information.
The two-dimensional code maker can set the number of times the two-dimensional code is read and the two-dimensional code information is identified, and after the number of times, the two-dimensional code will be invalid.
3. And automatically updating the corresponding information according to the sequence of the two-dimension code information read and identified by the user.
And automatically updating the corresponding information according to the sequence of the two-dimension code information read and identified by the user. Suppose that when the first 10 users read the two-dimensional code, each user is numbered according to the sequence of A1-A10, and when the next 10 users read the two-dimensional code, each user is numbered according to the sequence of B1-B10.
4. The effective time of the two-dimensional code.
The two-dimensional code maker can set the valid time of the two-dimensional code, and if the two-dimensional code maker sets the valid time of the two-dimensional code to be 1 day, the system sets the two-dimensional code to be invalid after 24 h. The user will no longer be able to read any information on the two-dimensional code.
5. Whether the valid time of the two-dimensional code is allowed to be updated.
And after the two-dimensional code maker updates the effective time, the system sends the original corresponding information of the two-dimensional code in the server to the two-dimensional code maker for the two-dimensional code maker to use.
The above application examples can also be expanded to the existing two-dimensional code technology.
The two-dimensional code is designed in a manner that information which a two-dimensional code maker wants to store and transmit to other users is corresponded by unique binary digits. The two-dimensional code maker only needs to send the information to the server. In the example, only the number needs to be edited, so that the range of the number which can be used by a two-dimensional code maker is relatively wider compared with the existing commonly-used two-dimensional code. In this example, the two-dimensional code maker can update the same two-dimensional code information only by updating the information of the server, and according to the difference of time, the two-dimensional code is valid and invalid. In addition, because the two-dimension code is a two-dimension code connected with the screen, and the ID of the user is made, the user-associated information can be supervised, credibility association and the like, and the use and propagation of malicious two-dimension codes can be effectively reduced. The two-dimensional code version in the example is a web version, i.e., the two-dimensional code information would not be readable if the web were not used. According to different versions, the two-dimensional code which can be read without a network exists, and at the moment, information is edited into 2-system numbers and is edited into the two-dimensional code by black and white dots.
When the step 201 is implemented as "obtaining each user profile corresponding to the keyword", a set of calculation model is correspondingly designed to determine each user profile corresponding to the keyword, and the specific content is as follows:
the method comprises the steps of firstly, obtaining key user information of a user, wherein the key user information in the user information of the user is simply called a key word of the user; and the key description information in the description information of the user profile is simply referred to as the subject of the user profile.
Description of the model
Fig. 4 is a model diagram.
1. Determining a set of keywords for a user
In the embodiment of the present invention, any two users belonging to the same user profile have an affinity relationship, so the user profile may also be referred to as a relationship network, and the user is regarded as a node in the relationship network, and the user profile may be mathematically and abstractly expressed as G ═ U, E, a, where:
U={uii is more than or equal to 1 and less than or equal to n, n is the total number of users in the user distribution diagram, and u isiThe ith node in the user distribution graph is obtained;
E={eki|eki=(uk,ui),uk,ui∈U},ekiis node ukCorresponds to node uiA connected edge;
A={aki|aki∈(0,1]},akirepresenting neighboring nodes ukAnd uiWeight of relation between, representing user ukWith user uiThe closer the relationship is, the larger the value of the relationship is.
Then any user u in the user profile0And ulHave a degree of affinity and phobicity of
Figure BDA0001281646010000191
Delta is the attenuation systemThe attenuation coefficient gradually decreases with the increase of the relationship level.
Above user ukAnd node ukAll represent a concept, sometimes referred to as user u above for ease of descriptionkSometimes referred to as node ukThey both represent the kth user or node.
Keywords between users can be interactively used due to affinity and sparseness among users in the same user profile, so that, for example, the 1 st user u in the user profile d1In addition to the own keyword (may be simply referred to as an initial keyword), the keyword may be added to keywords of other users in the user profile d, thereby forming the user u1Keyword set C ofu1(x) Expressed as:
Figure BDA0001281646010000201
i.e. user u1Initial keyword c of1The degree of affinity corresponding to the keywords of other users multiplied by the number of the user u1The set of keywords of (1).
2. Determining a set of all keywords for a user profile
From this it can be deduced that the set of all keywords (i.e. the total set of all users' sets of keywords) W in the user profile ddComprises the following steps:
Figure BDA0001281646010000202
the aforementioned n represents the total number of users in the user profile d.
The set of all the keywords in the user distribution diagram d determined in the way can reflect not only the theme of the user distribution diagram, but also the affinity and sparseness among the users, and the accuracy of finally determining each user distribution diagram corresponding to the keywords is improved.
3. Subject matter of user profiles
The theme of the user profile, what is reflected is the commonality of all users in the user profile; the user profile may have a plurality of topics, with each topic corresponding to one or more topic vocabularies.
According to WdThe occurrence proportion of each keyword in the user profile d is determined. E.g. WdThe two keywords are respectively 'abacus' and 'ao number', the occurrence ratios of the two keywords are respectively 55% and 60%, the minimum value of the set ratio is 50%, and the occurrence ratios of the two keywords exceed 50%, so that the theme of the user distribution diagram can be determined to be the 'math' information capable of reflecting the commonality of the two keywords according to the two keywords.
Suppose that the user profile d has a total of k topics, using ZdRepresents;
the set of all user profiles is denoted by D.
By beta1:kRepresenting the 1 st subject to the kth subject in the user profile d.
By betakAnd d, representing the subject vocabulary of the k-th subject in the user distribution diagram d.
With p (. beta.)i) For the ith topic word betaiThe corresponding probability distribution.
By thetadRepresenting the proportion of each subject vocabulary in the user distribution diagram d in all the vocabularies;
by Zd,mRepresenting the theme to which the mth theme vocabulary belongs in the user distribution diagram d;
by thetad,kRepresenting the proportion of the kth theme in all themes in the user distribution diagram d;
by WdRepresenting a set of all keywords in the user profile d;
by Wd,mRepresents WdThe m-th (m.epsilon. (1,2, n)) key word.
θ1,D=θ12,…θD;Z1,D=Z1,Z2,…ZDIn an abbreviated form.
Thus, a joint probability distribution solving function for each variable of the user profile d can be obtained:
Figure BDA0001281646010000211
p(Zd,nd) Reflecting topic-keyword distribution, p (W)d,n1:K,Zd,n) Reflecting the subject matter importance.
The distribution diagram topic distribution model aims to determine the topic distribution and the keyword distribution of the user distribution diagram and also determines the probability distribution of each member in the user distribution diagram. And preparing for sorting the search results in the next step.
Second, search result ranking model
In step 201, the user profiles corresponding to the keywords are obtained.
Suppose that: q represents a query expression of a user, including a plurality of keywords. It is assumed that the keywords are independent of each other.
When a searcher wants to query a user e with a query expression q*Then, the query expression may generate a plurality of users e, and the probability value of each user e is calculated according to the following formula:
Figure BDA0001281646010000212
wherein p (e), p (q) can be obtained by solving the above formula (3).
Wherein the content of the first and second substances,
Figure BDA0001281646010000221
since the generation process of the query expression q is classified into the user profile diIn (3), the user relationship diagram diAnd (5) bearing the retrieval task and presenting the result, namely the user distribution diagram with the highest relevance.
Sequencing each user e according to the sequence of the determined probability values from large to small, and then sequencing and displaying the user distribution diagram to which each user e belongs according to the sequencing result, so as to obtain the sequencing result of each user distribution diagram corresponding to the keyword; the ranked results are displayed while highlighting the user e at the location where it is most likely to match the searcher's search target for use by the searcher.
Examples of the present invention
Taking XX school distribution diagram D as an example, distribution diagrams D of different classes covered in this D, such as 3-year class 1 distribution diagram D1, 3-year class 2 distribution diagram D2, three-year class 3 distribution diagram D3, etc
Here, a 3-year class 2-shift distribution diagram d2 is taken as an example, and a simplified mathematical diagram is given for the total d2=>G32=(U,E,A)
There are 28 students on the class and 7 teachers at lessons, and the weight a is determined by finding the relationship between members, e.g. a stack of twins brothers on the class, xiaojiang and xiaoming, xiaohong being the daughter of the math teacher, xiaomei and xialiang being the relationship between table sisters. Such a relationship is more compact than the original relationship of the same school, and reflects the weight a between themkiIt will be high.
While the description key of each member of the class is different, e.g.
Xiaoming c 12 class 3; strengthening the class; a sports committee; a table tennis ball; basketball; twins; (ii) morgo; skin: black, etc. }
Small red c 22 class 3; strengthening the class; mathematics is carried out; a math teacher daughter; scholar; skin: white, etc. }
Then the final set of keywords for minuscule would contain the set of keywords for minuscule multiplied by the corresponding affinity weight a12c2
Finally, a total keyword set W of 3 years and 2 shifts can be obtained in a summary manner3 years 2 shifts
A 3-year 2 topic word may also be determined { 3-year class 2; mathematics is carried out; enhanced shifts, etc. } equal to the distribution β of these words3 years 2 shifts
And a full school keyword set WXX schoolCalculating the corresponding specific gravity and other data, and calculating the overall combined distribution function P (beta) of the total correction by a formula1:K1,D,Z1,D,W1,D)xx school
----------
If there is one user searching for q ═ 3 grades, reinforcement shift, twins } ═ target: xiaoming
The system then calculates the probability of the keyword in the p (3-year | d) p (intensive shift | d) p (twins | d) query, respectively
The system then infers that the search results may be
Xiaoming and Xiaogang, Xiaoxia and Xiaomei [ another twin of 3 years and 4 shifts ]
Respectively calculating corresponding probability p (e | (Xiaoming, Xiaogang, Xiaoxia, Xiaomei))
e is an element (Xiaoming, Xiaogang, Xiaoxia, Xiaomei)
The resulting probability ordering returns to histogram ordering: second shift first in 3 years; 4 shifts second in 3 years, and highlights xiaoming and xiaojian, xiaxia and xiaomei among the marks.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the apparatus embodiment, since it is substantially similar to the method embodiment, it is relatively simple to describe, and reference may be made to some descriptions of the method embodiment for relevant points.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. The storage medium may be a magnetic disk, an optical disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), or the like.
The above description is only for the specific embodiment of the present invention, but the scope of the present invention is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present invention are included in the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims (9)

1. A method for processing accurate positioning social contact, which is characterized by comprising the following steps:
acquiring at least one user distribution diagram corresponding to the keyword;
determining a target user profile among the at least one user profile based on a user selection instruction;
displaying the target user distribution diagram;
the target user distribution diagram carries shared file information;
when the target user profile includes a current user, the method further includes: sending a request for sharing files to a server; receiving a shared file sent by a server;
and/or
When the target user profile does not include a current user, the method further comprises: sending a file viewing request to other users included in the target user profile; when receiving the viewing permission information sent by the other users, sending a shared file request to a server; receiving a shared file sent by a server;
the process of obtaining at least one user distribution diagram corresponding to the keyword comprises the following steps:
step 1: determining a set of keywords for the user, comprising:
the user profile, which is mathematically abstracted as a representation of the nodes in the relational network, is referred to as the relational network and the users are considered as nodes in the relational network
Figure 72803DEST_PATH_IMAGE001
Wherein:
Figure 767090DEST_PATH_IMAGE002
Figure 480968DEST_PATH_IMAGE003
is the total number of users in the user profile,
Figure 526285DEST_PATH_IMAGE004
the ith node in the user distribution graph is obtained;
Figure 921494DEST_PATH_IMAGE005
Figure 532604DEST_PATH_IMAGE006
is a node
Figure 620645DEST_PATH_IMAGE007
Corresponding and node
Figure 949996DEST_PATH_IMAGE008
A connected edge;
Figure 148896DEST_PATH_IMAGE009
Figure 552195DEST_PATH_IMAGE010
representing neighboring nodes
Figure 873455DEST_PATH_IMAGE011
And
Figure 627785DEST_PATH_IMAGE008
the weight of the relationship between;
arbitrary users in user profile
Figure 427113DEST_PATH_IMAGE012
And
Figure 950499DEST_PATH_IMAGE013
the affinity and the phobia betweenDegree of
Figure 380343DEST_PATH_IMAGE014
Figure 421636DEST_PATH_IMAGE015
Is the attenuation coefficient;
wherein the user
Figure 24655DEST_PATH_IMAGE016
And node
Figure 668126DEST_PATH_IMAGE016
Represent a concept, each representing a kth user or node;
wherein, the keywords are in addition to the keywords of the user and the keywords of other users in the user profile d to form the user
Figure 3293DEST_PATH_IMAGE017
Set of keywords
Figure 794531DEST_PATH_IMAGE018
Expressed as:
Figure 873346DEST_PATH_IMAGE019
(1)
namely the user
Figure 371323DEST_PATH_IMAGE020
Initial keyword of
Figure 939708DEST_PATH_IMAGE021
Using the degree of affinity corresponding to the keywords of other users by multiplication as the user
Figure 155925DEST_PATH_IMAGE022
The set of keywords of (1);
step 2: determining a set of all keywords of the user profile, comprising:
deriving a set of all keywords of the user profile according to the determined set of keywords of the user, as follows:
Figure 100748DEST_PATH_IMAGE023
(2)
where n represents the total number of users in the user profile d,
Figure 453232DEST_PATH_IMAGE024
representing a set of all keywords in the user profile d;
and step 3: obtaining a topic of a user profile, comprising:
according to
Figure 395780DEST_PATH_IMAGE025
The occurrence proportion of each keyword in the user profile d is determined.
2. The method of claim 1, further comprising:
based on a chat request instruction, sending a chat request to a target user in the target user distribution map, wherein the chat request instruction carries identification information of the target user; alternatively, the first and second electrodes may be,
sending a friend adding request to a target user in the target user distribution graph based on a friend adding instruction, wherein the friend adding instruction carries identification information of the target user;
when the target user is in a disturbance-free state, not receiving any chat request or any friend adding request, at the moment, sending information to the target user based on a small paper slip function, wherein the small paper slip function is used for realizing the function of establishing social activities and limiting social objects between the strange user A and the strange user B through mutual common friends;
if the strange user A and the strange user B do not have common friends, a friend connection which can be used for establishing connection between the strange user A and the strange user B is found through more than one friend based on a small paper slip function;
wherein the use of the small note function is realized based on the related settings of the strange user A and the strange user B;
wherein the method further comprises:
the user selects intelligent answers by long pressing the chat content of the opposite side;
giving an optional reply content list for reference according to chat content of the opposite party, editing by the user on the basis of the reply content list, and replying the opposite party;
and the intelligent answer selected by the user can be realized through a specific function of a specific character;
and the specific character may be user-defined.
3. The method of claim 1, wherein the user profile carries profile name and/or description information;
the obtaining of the at least one user profile corresponding to the keyword includes:
obtaining at least one user distribution diagram containing the key words in the distribution diagram name or the description information;
the method further comprises the following steps:
and a keyword prompting function, after the user defines the keyword, if the defined keyword appears in the chat information, prompting the user, and clicking the prompt by the user to check specific content, wherein the specific content comprises: the specific position of the customized keyword and the corresponding specific content.
4. The method according to claim 1, wherein the obtaining at least one user profile corresponding to the keyword comprises:
acquiring each user distribution diagram corresponding to the keyword; or
Obtaining each peripheral user distribution map corresponding to the keyword, wherein the peripheral user distribution map is a user distribution map of which the geographic position is within a current preset geographic position range; or
Acquiring a user distribution diagram corresponding to the keyword, and a user distribution diagram at the same level, a user distribution diagram at the upper level and a user distribution diagram at the lower level of the user distribution diagram;
the keyword is a combination of any one or more items of user information, distribution diagram name and description information.
5. The method of claim 1, further comprising:
acquiring a related user distribution diagram of the target user distribution diagram;
and displaying the associated user distribution diagram.
6. The method of claim 1, further comprising:
generating a user distribution diagram based on a distribution diagram making instruction, wherein the user distribution diagram carries: at least one item or any combination of distribution diagram names, distribution diagram description information and user information;
sending the user profile to a server;
wherein the user information includes: any one or any combination of identification information, seat information, user preference information, user habit information and social status information of the user;
the profile description information includes: any one or more of characters, pictures, audios and videos has descriptive information carriers;
the server also sends information of the associated user distribution diagram to be constructed to each user included in the user distribution diagram;
the user provides a required associated user profile request for free or paid reasons;
and the server also sends the information of the associated user distribution diagram to be constructed to other users based on the associated user distribution diagram request.
7. The method of claim 1, further comprising:
sending the current user information to a server so that the server adds the current user information in the target user distribution map;
the current user information comprises any one or any combination of identification information, seat information, user preference information, user habit information and social status information of a current user; alternatively, the first and second electrodes may be,
the current user information includes the time period information of the current user besides any one or any combination.
8. The method of claim 1, wherein the target user profile carries user status, the user status comprising administrator status and general user status;
when the current user state comprises an administrator state, the method further comprises:
receiving request information sent by user equipment corresponding to a common user state;
detecting an operation instruction based on the request information;
displaying operation result information corresponding to the user operation instruction;
wherein the administrator can set a bench function that lets users in non-group obtain the authority between members in group and ordinary users.
9. The method of claim 1, further comprising:
receiving scanning information sent by a user terminal after scanning the two-dimensional code;
adding the user corresponding to the user terminal into a user distribution diagram corresponding to the two-dimensional code according to the scanning information;
the two-dimensional code is composed of an ID, version information and special information.
CN201710289776.3A 2017-03-23 2017-04-27 Accurate positioning social processing method Active CN107025607B (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710179696 2017-03-23
CN2017101796962 2017-03-23

Publications (2)

Publication Number Publication Date
CN107025607A CN107025607A (en) 2017-08-08
CN107025607B true CN107025607B (en) 2021-05-25

Family

ID=59527403

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710289776.3A Active CN107025607B (en) 2017-03-23 2017-04-27 Accurate positioning social processing method

Country Status (1)

Country Link
CN (1) CN107025607B (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107784273B (en) * 2017-09-28 2021-05-11 陕西师范大学 Classroom seat distribution prediction method based on student social relationship model
CN108228839A (en) * 2018-01-05 2018-06-29 湖南科技学院 A kind of colleges and universities' admission examinee's dating system and computer media
CN109522705B (en) * 2018-10-23 2024-02-09 深圳平安医疗健康科技服务有限公司 Authority management method, device, electronic equipment and medium
CN110175275A (en) * 2019-06-20 2019-08-27 深圳市掌握时代互联网应用科技有限公司 A kind of electric business barcode scanning lock powder system
CN111985210B (en) * 2020-08-26 2023-08-15 北京机电工程总体设计部 Method for constructing editable document theme visualization based on word cloud technology

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103617267A (en) * 2013-12-03 2014-03-05 北京奇虎科技有限公司 Socialized extension search method, device and system

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9058242B2 (en) * 2010-03-04 2015-06-16 Gshift Labs Inc. Method and system of optimizing a web page for search engines
CN103246679A (en) * 2012-02-13 2013-08-14 刘龙 System and method for achieving location-based searching
CN103379022B (en) * 2012-04-24 2015-09-16 腾讯科技(深圳)有限公司 A kind of instant communication method based on Internet map search and system
CN102789508A (en) * 2012-07-27 2012-11-21 吴建辉 Distributed practical condition search engine and chat system on basis of geographical position
CN103678350B (en) * 2012-09-10 2018-01-05 腾讯科技(深圳)有限公司 Social network search result methods of exhibiting and device
CN102882957A (en) * 2012-09-19 2013-01-16 上海斐讯数据通信技术有限公司 Mobile terminal friend-making system and method
TWI526963B (en) * 2012-11-13 2016-03-21 財團法人資訊工業策進會 A method, a device and recording media for searching target clients
CN103902561B (en) * 2012-12-26 2018-12-11 深圳市腾讯计算机系统有限公司 A kind of processing method and processing device of online user's distribution
CN105007217B (en) * 2015-08-05 2018-09-04 北京易伟航科技有限公司 The system and method for social relationships is found by the GEOGRAPHICAL INDICATION with time attribute

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103617267A (en) * 2013-12-03 2014-03-05 北京奇虎科技有限公司 Socialized extension search method, device and system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
Joint Social-Position Relationship Based Cooperation Among Mobile Terminals;Hongliang Mao et al.;《IEEE COMMUNICATIONS LETTERS》;20141231;第18卷(第12期);第2165-2168 *

Also Published As

Publication number Publication date
CN107025607A (en) 2017-08-08

Similar Documents

Publication Publication Date Title
CN107025607B (en) Accurate positioning social processing method
Lambert Intimacy and social capital on Facebook: Beyond the psychological perspective
Liu et al. Media niche of electronic communication channels in friendship: A meta-analysis
Taipale et al. The big meaning of small messages: The use of WhatsApp in intergenerational family communication
Thelwall et al. Chatting through pictures? A classification of images tweeted in one week in the UK and USA
Bazarova Public intimacy: Disclosure interpretation and social judgments on Facebook
Baym Social Networks 2.0
US11748428B2 (en) Multimedia digital collage profile using themes for searching and matching of a person, place or idea
Cassidy Gay men, social media and self-presentation: Managing identities in Gaydar, Facebook and beyond
Black Remember the 70%: sustaining ‘core’museum audiences
Rachman et al. Content Analysis of Indonesian Academic Libraries' Use of Instagram.
US20160140244A1 (en) Systems and methods for connecting native language speakers and second language learners across a network
Van Haperen et al. Mediated interaction rituals: a geography of everyday life and contention in Black Lives Matter
Ju et al. Who am I? A case study of a foreigner’s identity in China as presented via WeChat moments
Waite Making place with mobile media: Young people’s blurred place-making in regional Australia
He et al. Researching motherhood in the age of short videos: Stay-at-home mothers in China performing labor on Douyin
Troemel The accidental audience
CN111199491A (en) Social circle recommendation method and device
US20140244736A1 (en) File Sharing in a Social Network
Ramazanova et al. Preserving ritual food as intangible cultural heritage through digitisation. The case of Portugal
JPH11120199A (en) Electronic communication system and storage medium
WO2015142292A1 (en) Methods and systems for determining similarity between network user profile data and facilitating co-location of network users
Çevik et al. Rediscovering Turkish Jewish heritage: The Club as a teaching moment in Turkey
CN109146737B (en) Intelligent interaction method and device based on examination platform
Hamat et al. Collaboration and community of practice in online social networking services among Malaysian University students

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant