US20140074937A1 - Automated Aging of Contacts and Classifying Relationships - Google Patents
Automated Aging of Contacts and Classifying Relationships Download PDFInfo
- Publication number
- US20140074937A1 US20140074937A1 US14/080,775 US201314080775A US2014074937A1 US 20140074937 A1 US20140074937 A1 US 20140074937A1 US 201314080775 A US201314080775 A US 201314080775A US 2014074937 A1 US2014074937 A1 US 2014074937A1
- Authority
- US
- United States
- Prior art keywords
- user
- interaction
- contact
- time
- expiration
- 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.)
- Granted
Links
Images
Classifications
-
- H04L67/22—
-
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR 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/10—Office automation; Time management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
- H04L51/52—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail for supporting social networking services
-
- 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; CALCULATING OR 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/10—Office automation; Time management
- G06Q10/107—Computer-aided management of electronic mailing [e-mailing]
Definitions
- the present description relates to managing and classifying relationships in a social networking system.
- Some existing social networks allow a user to specify lists or groups of connections that are important to the user. However, many users do not take advantage of this feature because it is complicated and time consuming.
- a system and method are provided to classify a relationship in a social networking system.
- One or more interactions between a first user and a second user of a social networking system are identified.
- Each respective interaction of the one or more interactions is scored based on a group score and a time penalty.
- the group score is based on the number of users in the respective interaction.
- the time penalty is based on a time between a current time and a time of a last interaction between the first user and the second user.
- a relationship ranking that measures the first user's affinity towards the second user is determined, where the relationship ranking comprises one or more interaction scores.
- An indicator representing the relationship ranking is sent to a client for display.
- a system and method are provided to age contacts in a social networking system.
- An expiration parameter is assigned to a contact of a user.
- the expiration parameter indicates when the contact should be disassociated from the user.
- An interaction between the user and the contact is detected.
- the expiration parameter is modified for the contact based on the detected interactions.
- FIG. 1 is a block diagram illustrating a distributed client-server system in accordance with some embodiments.
- FIG. 2 is a block diagram of a client device according to some embodiments.
- FIG. 3 is a block diagram of a server system according to some embodiments.
- FIG. 4 is a flowchart illustrating a process of classifying a friendship according to some embodiments.
- FIG. 5A and FIG. 5B are exemplary screenshots according to some embodiments.
- FIG. 6 is a flowchart illustrating the process of aging a contact according to some embodiments.
- FIG. 7A and FIG. 7B is a set of illustrations showing graphs of contacts (nodes) and connections (edges) for a social contact according to an example embodiment.
- FIG. 1 is a block diagram illustrating a distributed system 100 that includes one or more clients 102 , a communication network 104 and a server system 106 .
- the one or more clients 102 and communicatively coupled with the server system 106 through the communication network 104 .
- server system 106 is implemented as a single server, while in other embodiments it is implemented as a distributed system of multiple servers. Solely for convenience of explanation, server system 106 is described below as being implemented on a single server system.
- the communication network(s) 104 can be any wired or wireless local area network (LAN) and/or wide area network (WAN), such as an intranet, an extranet, or the Internet. It is sufficient that the communication network 104 provides communication capability between the client devices 102 and server system 106 . In some embodiments, the communication network 104 uses the HyperText Transport Protocol (HTTP) and the Transmission Control Protocol/Internet Protocol (TCP/IP) to transmit information between devices or systems. HTTP permits client devices 102 to access various resources available via the communication network 104 .
- HTTP HyperText Transport Protocol
- TCP/IP Transmission Control Protocol/Internet Protocol
- a user interfaces with server system 106 at a client device 102 .
- a client device 102 may be any suitable computer device that is capable of connecting to server system 106 via communication network 104 , such as a computer, desktop computer, laptop computer, tablet device, internet kiosk, personal digital assistant, mobile phone, gaming device, or any other device that is capable of communicating with server system 106 .
- the client device 102 may communicate with the server system 106 via an application 108 such as a web browser or native application.
- FIG. 2 is a block diagram illustrating one example embodiment of the client device 102 .
- the client device 102 includes one or more processing units (CPU's) 202 , one or more network or other communications interfaces 214 , a memory 206 , a user interface 208 , a camera 222 , a GPS 224 and one or more communication buses 204 for interconnecting these components.
- the communication buses 204 optionally include circuitry (sometimes called a chipset) that interconnects and controls communications between system components.
- the client device 102 typically includes a user interface, comprising for example a display device 210 and optionally a keyboard and/or mouse (or other pointing device) 212 .
- the display device 210 is a touch screen display.
- the camera 222 captures images and video to be stored as data 226 .
- the GPS 224 determines the location of the client device 102 .
- a microphone 230 captures audio content.
- the memory 206 includes high-speed random access memory, such as DRAM, SRAM, DDR RAM or other random access solid state memory devices; and may include non-volatile memory, such as one or more magnetic disk storage devices, optical disk storage devices, flash memory devices, or other non-volatile solid state storage devices.
- the memory 206 optionally includes one or more storage devices remotely located from the CPU(s) 202 .
- the memory 206 or alternatively the non-volatile memory device(s) within memory 206 , comprises a non-transitory computer readable storage medium.
- the memory 206 comprises a computer readable storage medium.
- the memory 206 can be configured to store an operating system 216 , a network communication module 218 (embodied as instructions executable by the CPU 202 ), applications 220 (embodied as instructions executable by the CPU 202 ) and data 226 .
- the operating system 216 includes procedures for handling various basic system services and for performing hardware dependent tasks.
- the network communication module 218 is used for connecting client device 102 to server system 106 and/or other devices and computers via the one or more communication network interfaces 214 (wired or wireless) and one or more communication networks, such as the Internet, other wide area networks, local area networks, metropolitan area networks, and so on.
- the applications 220 include applications to capture content such as pictures, video and audio.
- the applications 220 allow a user to send the captured content to the server system 106 for storage as well as receive content from the server system 106 .
- the data 226 stores captured content and content metadata.
- the content metadata includes descriptions of content, tags of users and geographic location information.
- FIG. 3 is a block diagram illustrating one example embodiment of the server system 106 .
- Server system 106 includes one or more processing units (CPU's) 302 , one or more network or other communications interfaces 308 , a memory 306 , and one or more communication buses 304 for interconnecting these components.
- the communication buses 304 optionally include circuitry (sometimes called a chipset) that interconnects and controls communications between system components.
- the memory 306 includes high-speed random access memory, such as DRAM, SRAM, DDR RAM or other random access solid state memory devices; and may include non-volatile memory, such as one or more magnetic disk storage devices, optical disk storage devices, flash memory devices, or other non-volatile solid state storage devices.
- the memory 306 optionally includes one or more storage devices remotely located from the CPU(s) 302 .
- the memory 306 or alternatively the non-volatile memory device(s) within the memory 306 , comprises a non-transitory computer readable storage medium.
- the memory 306 or the computer readable storage medium of memory 306 store the following programs, modules and data structures, or a subset thereof:
- the user database 318 stores information for one or more users 322 .
- user database 318 is a distributed database.
- Information for a respective user 322 - 1 includes content 323 , contacts 324 , profile information 327 , comments 328 and ratings 329 , content metadata 330 and interactions 331 .
- User profile information 327 stores information such as biographic, demographic and other types of descriptive information (work experience, educational history, hobbies or preferences, interests, location, and the like).
- Comments 328 stored in the user database 218 include comments by the user as well as comments from other users on content associated with the user. Ratings 329 include the user's rating of content.
- Interactions 331 stores information about the user's interactions which includes a time of the interaction, the identifiers of other users involved in the interaction, the type of the interaction and weights associated with the interaction.
- the content 323 includes images, video, audio associated with the user. The content may be captured by the user or another user.
- the content metadata 330 includes descriptions or categories of content, tags of users and geographic location information. For example, the user may apply a category of “places” to a picture depicting a landmark.
- the user database 318 also is configured to store a list of contacts 325 associated with a user and an expiration parameter 326 for each contact.
- the expiration parameter 326 for a contact specifies a length of time or a time and date when a respective contact should expire. Once the expiration parameter expires, the contact is disassociated from the user. Stated in another way, the contact and the user will no longer be connected after the expiration of the expiration parameter. As a result, the contact will not be able to view the user's private information.
- the monitoring module 314 monitors actions of users and stores information about the actions in the user database 318 .
- the actions include capturing and storing content. For example, a user may capture an image, a video or audio.
- the actions include interactions between users such as messaging, tagging, commenting and rating. In some embodiments, the monitoring module 314 applies weights to the actions.
- the monitoring module 314 identifies one or more interactions between users and sends information about the interactions to the contact ranking module 316 and the contact aging module 317 .
- the contact aging module 317 ages and removes contacts associated with a user.
- the contact aging module 317 assigns an initial expiration parameter to each contact of a user.
- the expiration parameter comprises an expiration value and a decay factor which determines the rate of decay of the expiration value.
- the expiration value may be a numerical value (e.g., 1) and the rate of decay may decay the expiration value by 0.01 every day.
- the expiration parameter indicates when the contact should be disassociated from the user.
- the expiration parameter may indicate a specific time or a period of time.
- the expiration parameter is specified by the user.
- the user may specify an expiration value and a decay factor for the expiration value or the user may specify that a particular contact expires after a amount of time or on a specific day and time.
- the initial expiration parameter is based on one or more factors including the frequency of interactions between the user and the contact, an importance value assigned to the contact by the user, and common profile information associated with the user and the contact.
- each of the factors discussed above is assigned a weight or value.
- the frequency of interactions between the contact and the user may map to different values. For example, if a user and a contact interact once a month then the expiration parameter for the contact will expire some time after a month. Importance values may map to expiration parameters or modify an expiration parameter. For example, a contact with a high importance value could have an expiration parameter that lasts longer than a contact with a low importance value.
- the total number of common profile information or each set of common profile information may be weighted.
- weights may be given to each set of information or the total number of commonalities (e.g., two) could be used in determining the expiration parameter.
- the expiration parameter may be based on multiple factors. In some embodiments, the expiration parameter is a sum or product of the weighted factors.
- the contact aging module 317 modifies the expiration parameter for a contact based on an interaction between the contact and the user.
- the expiration parameter is modified to extend the time until the expiration parameter expires.
- the expiration parameter comprises a expiration value and a decay factor
- the expiration value and/or the decay factor are modified.
- an interaction score is determined for the interaction and used to modify the expiration parameter of the contact.
- the modification increases the time before the expiration parameter expires or slows the decay of the expiration value.
- the interaction score comprises one or more contribution scores derived from aspects of the interaction.
- the interaction score is based on one or more aspects of an interaction including the type of the interaction, a time of the interaction, the number of users in the interaction or the total number of interactions between the user and the contact and an importance parameter associated with the contact. Each aspect of the interaction may be weighted or given a contribution score.
- an interaction score may be based on a weight assigned to the type of the interaction, a time of the interaction, the number of users in the interaction and the total number of interactions between the contact and the user.
- the expiration parameter for the contact is modified based at least in part on a user assigned importance parameter associated with the contact.
- the expiration parameter for the contact is modified based on a user specified criteria and user specified aging factor.
- the user may specify how the expiration parameter for certain groups of users is modified. For example, the user may specify that all users in a certain country have a predefined amount of time increased to their expiration parameter when the user interactions with them.
- the contact aging module 317 monitors for expiration of expiration parameters. Once a contact has expired, the contact aging module 317 modifies the relationship between the contact and the user. In some embodiments, the user is disassociated from the contact. In some embodiments, the contact is transitioned to a lower status where the contact is still connected to the user but can see only a subset of the user's private information. For example, the user may define several levels of access such as high, medium and low, where each level of access can view a different amount of the user's private information.
- the contact ranking module 316 performs a relationship ranking (e.g., generally referenced as RelationshipRank or FriendRank) process (e.g., embodied as instructions executable by a CPU and referenced as an algorithm) to help classify the relationship between two particular users.
- a relationship ranking e.g., generally referenced as RelationshipRank or FriendRank
- the RelationshipRank process helps identify the user's current most relevant contacts. RelationshipRank calculates the value of a relationship by observing the behavior between two individuals and their social surroundings at the time of the observation.
- the contact ranking module 316 determines a relationship ranking or relationship score between a user and a contact based on one or more interactions between the contact and the user and the corresponding timestamps.
- the contact ranking module 316 takes several components into account, including but not limited to: the size of the group at the time the unique pair of users were observed together and the time between now and the last time the pair of users were observed together.
- the contact ranking module 316 examines the recent history of all the interactions in which a pair of users (u1; u2) have both been mentioned. Recent history is defined as all interactions or events within the previous T days. This set of events is known as W (u 1 ,u 2 ),T .
- the contact ranking module 316 sums each of the influences of the events between two users in order to determine the relationship ranking between the two users.
- the influence of each event comprises two components.
- the first component is a fixed value based on the size of the group observed. This portion is a group score (e.g., generally referenced as GroupScore).
- GroupScore assigns a fixed value between 0 and 1 to an event, where the event is rated as the most valuable (with a GroupScore of 1) if the there are N users in the event, and decaying to 0 as the group becomes larger. Equation 1 illustrates the GroupScore for an event, according to some embodiments.
- n is the size of the group in the event's observation
- c 1 is a tuning constant
- the second component determines how influential a single event is based an element of recency.
- the RelationshipRank applies a time penalty (e.g., generally referenced as TimePenalty) to events.
- time penalty e.g., generally referenced as TimePenalty
- the RelationshipRank algorithm weights more recent events higher, and decays the influence that older events based on an exponential model described in equation 2:
- TimePenalty ⁇ ⁇ ( w ) ⁇ ⁇ ( t - T ) / c 2 if ⁇ ⁇ t ⁇ T 1 if ⁇ ⁇ t > T ( 2 )
- t represents the current time as some number of time units since the observation was registered.
- T is the maximum age an observation can be before the time penalty reaches 1 and c 2 is a tuning constant.
- the contact rank module 316 calculates a summation of all of the influences of all of the recent events. Equation 4 represents this summation, according to some embodiments.
- the relationship ranking for a contact is represented as a numerical value. In some embodiments, the relationship ranking for a contact is represented as a graphical indicator. In some embodiments, the contact ranking module 316 prepares a list of contacts and a list of relationship ranking corresponding to the list of contacts.
- FIG. 4 is a flow diagram illustrating an example method 400 of classifying a relationship between two users, according to some embodiments.
- the method 400 is performed at a server system 106 with one or more processors (or CPUs 302 ) and memory 306 .
- the monitoring module 314 identifies one or more interactions between a first user and a second user of a social network system ( 402 ).
- an interaction is any event that involves the first user and the second user.
- a respective interaction comprises a message including user identifiers for the first user and the second user.
- the user identifiers in the message are links to corresponding user profiles.
- the respective interaction indicates that the first user is with the second user.
- interaction 502 includes an image 508 , a message 504 that includes identifiers (e.g., mvanhorn, rajivpatelis and htang10) for one or more users and graphical identifiers 506 corresponding to the users in the message.
- identifiers e.g., mvanhorn, rajivpatelis and htang
- the contact ranking module 116 scores the one or more interactions based on a group score and a time penalty ( 404 ).
- the contact ranking module 116 performs the RelationshipRank algorithm discussed above to determine a relationship rank for the second user.
- the score of a respective interaction represents the influence of the respective interaction.
- the group score measures the quality of a respective interaction and is based on the number of users in the respective interaction. The number of people in an interaction indicates the quality of the interaction. For example, interactions involving two users are the most valuable.
- the group factor is decayed based on the number of users in a respective interaction. For example, a group of two users may be assigned a highest value of one and each group numbering more than two users is decayed based on the number of users in the interaction.
- interactions having a group size larger than a predefined number are given a group score of zero.
- the time penalty weights more recent interactions higher and decays the influence of older interactions in order to help identify contacts that are currently most important to the user.
- the time penalty is based on a time between a current time and a time of the last interaction between the first user and the second user. The interactions between users who interact more frequently are weighted higher than users who rarely interact.
- the contact ranking module 316 determines a relationship ranking that measures an affinity of a first user towards the second user, where the relationship ranking comprises the one or more interaction scores ( 406 ).
- the goal of the relationship ranking is to rate or score a relationship between two users.
- the friendship ranking identifies contacts of a user that are currently important to the user. As a user's friendships change the set of contacts that are important to the user will also change.
- the contact ranking module 316 sends an indicator representing the relationship ranking between the first user and the second user to a client for display ( 408 ).
- the indicator may be a numerical value or graphic representing the relationship ranking.
- the contact ranking module 316 sends a list of contacts and a list of corresponding indicators to a user. For example, as shown in FIG. 5B , the user may view a list of user identifiers and corresponding relationship ranks 512 .
- FIG. 6 is a flow diagram illustrating an example method 600 of aging contacts in a social networking system, according some embodiments.
- a contact is aged and eventually disassociated with a user unless the user interacts with the contact.
- Such method allows a user to maintain contacts that the user actually interacts with without requiring that the user actively manage their contacts.
- the removed contacts will not be offended.
- Method 600 is performed at a server system 106 with one or more processors (CPU 302 ) and memory 306 .
- the contact aging module 317 assigns an expiration parameter to a contact of a user ( 602 ).
- the expiration parameter comprises a expiration value and a decay factor which determines the rate of decay of the expiration value.
- the expiration parameter indicates when the contact should be disassociated with the user. For example, the expiration parameter may indicate a specific time or a period of time. Once disassociated, the former contact cannot view the user's private information or content.
- the expiration parameter is specified by the user.
- the user may specify an expiration value and a decay factor for the expiration value or the user may specify that a particular contact expires in one month or on a specific day and time.
- the initial expiration parameter is based on one or more factors including the frequency of interactions between the contact of the user and the contact, on an importance value set by the user for the contact, common profile information associated with the user and the contact or any combination thereof.
- the monitoring module 314 detects one or more interactions between the user and the contact ( 604 ).
- the one or more interactions occur after an initial expiration parameter is assigned to the contact.
- the interaction may include profile views, messages, tagging, comments and content views.
- the user may view the profile of the contact, send the contact a message, tag the contact in a message or content such as an image, comment on a discussion that the contact is involved in or view content posted by a contact.
- the interaction comprises sharing of digital content between the user and the contact. The interaction may be initiated by either the user or the contact.
- the contact aging module 317 modifies the expiration parameter for the contact based on the detected interaction.
- the expiration parameter for the contact is modified in response to a detected interaction.
- the expiration parameter may be modified to extend the time until the expiration parameter expires.
- an interaction score is determined for the interaction and used to modify the expiration parameter of the contact.
- the interaction score comprises one or more contributions derived from aspects of the interaction.
- the interaction score may be based on the type of the interaction, a time of the interaction, the number of users in the interaction or the total number of interactions between the user and the contact or any combination thereof. Each aspect of an interaction may be given a weight and used as a contribution to the interaction score.
- an interaction score may be based on a weight assigned to the type of the interaction, a time of the interaction, the number of users in the interaction and the total number of interactions between the contact and the user.
- the expiration parameter for the contact may be modified based at least in part on a user assigned importance parameter associated with the contact.
- the expiration parameter for the contact is modified based on a user specified criteria and user specified aging factor.
- the user may specify how the expiration parameter for certain groups of users is modified. For example, the user may specify that all users in a certain country have a predefined amount of time increased to their expiration parameter when the user interactions with them.
- the expiration parameter is determined to have expired and the contact is disassociated from the user. As a result, the contact and the user are not longer connected and the former contact will not be able to view the user's private information. The former contact may still be able to view the user's public information. The former contact and the user may become connections again if one of the user's requests a reconnection.
- the relationship between the contact and the user is transitioned from a full friendship to an intermediate one where the contact can view a subset of the user's content.
- a user may have three or more types of content such as public content, private content and a subset of the private content.
- FIG. 7A shows an example of a connection graph 700 displayed to a user at a client device according to one embodiment.
- the graph 700 helps a user visualize their connections.
- the user may be able to pre-apply filters so that only certain of their connections are shown on the graph 700 .
- filters may be applied to show other users associated with a wine tasting interest, or with sports, or other users who are located within a certain geographical area or distance from the inquiring user's home or current location.
- filters may be based on any of the parameters or other information available via the social networking system. Different colors, graphical objects, symbols, or other indicia of connection type or interest may be used instead of or in addition to the filtering or selection.
- the nodes N1, N2 . . . N17 represent users of the social networking system and the lines or edges between the nodes indicate connections between the users.
- user N1 is viewing their own connection graph.
- the numerical values displayed along the lines indicate the number of interactions between the nodes.
- member N1 has had 10 interactions with member N6 and 13 interactions with member N5 over the period of time for which the graph shows data.
- a user may view interactions over a duration of time or interactions on an actual date.
- the graph 700 permits the user to either upgrade, downgrade, delete, retain, or otherwise modify the value or relevancy of the connection with that other user in accordance with the automatic aging feature described elsewhere herein.
- connection graph 700 may only show connections that are about to be dropped so that the user has an opportunity to prevent certain contacts from being disassociated from the user.
- the graph 700 includes an interface to add or delete contacts.
- FIG. 7B the user is presented with the graph of a selected set of contacts independent of the number of recent interactions.
- FIG. 7B illustrates the graph that may be displayed to member N1 when the member filters the graph to show only those other members for which there have been three or more interactions over the chosen period of time.
- dd/mm/yy Electric Cars March 2009 April 2009 Low/1 Cal, Exp. dd/mm/yy Electric Cars Dave M. September 2008 March 2010 (20) High/9 Cal, Exp. dd/mm/yy Electric Cars Rachael W. August 2008 September 2009 (3) Med/5 Cal, Exp. dd/mm/yy Electric Cars Donald G. January 2007 February 2010 (6) High/8 Cal, Exp. dd/mm/yy Note: dd/mm/yy refers to day/month/year and may differ for each entry
- the user may generate and view a list of people or friends that have been identified with various hierarchical levels of importance.
- the list includes people that the user cares about.
- the user may be able to query for different groups by geographic location, identified interest, age, gender, marital status, length of relationship, or other personal or demographic information either identified by the user or selected from a predetermined list of relationship groups.
- Modules may constitute either software modules (e.g., code embodied on a machine-readable medium or in a transmission signal) or hardware modules.
- a hardware module is tangible unit capable of performing certain operations and may be configured or arranged in a certain manner.
- one or more computer systems e.g., a standalone, client system 102 or server computer system 106
- one or more hardware modules of a computer system e.g., a processor or a group of processors
- software e.g., an application or application portion
- processors may be temporarily configured (e.g., by software) or permanently configured to perform the relevant operations. Whether temporarily or permanently configured, such processors may constitute processor-implemented modules that operate to perform one or more operations or functions.
- the modules referred to herein may, in some example embodiments, comprise processor-implemented modules.
- the one or more processors may also operate to support performance of the relevant operations in a “cloud computing” environment or as a “software as a service” (SaaS). For example, at least some of the operations may be performed by a group of computers (as examples of machines including processors), these operations being accessible via a network (e.g., the Internet) and via one or more appropriate interfaces (e.g., application program interfaces (APIs).)
- SaaS software as a service
- the performance of certain of the operations may be distributed among the one or more processors, not only residing within a single machine, but deployed across a number of machines.
- the one or more processors or processor-implemented modules may be located in a single geographic location (e.g., within a home environment, an office environment, or a server farm). In other example embodiments, the one or more processors or processor-implemented modules may be distributed across a number of geographic locations.
- any reference to “one embodiment” or “an embodiment” means that a particular element, feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment.
- the appearances of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment.
- Coupled and “connected” along with their derivatives.
- some embodiments may be described using the term “coupled” to indicate that two or more elements are in direct physical or electrical contact.
- the term “coupled,” however, may also mean that two or more elements are not in direct contact with each other, but yet still co-operate or interact with each other.
- the embodiments are not limited in this context.
- the terms “comprises,” “comprising,” “includes,” “including,” “has,” “having” or any other variation thereof, are intended to cover a non-exclusive inclusion.
- a process, method, article, or apparatus that comprises a list of elements is not necessarily limited to only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus.
- “or” refers to an inclusive or and not to an exclusive or. For example, a condition A or B is satisfied by any one of the following: A is true (or present) and B is false (or not present), A is false (or not present) and B is true (or present), and both A and B are true (or present).
Abstract
Description
- This application is a continuation application of U.S. patent application Ser. No. 13/178,376, filed Jul. 7, 2011, which claims the benefit of priority to U.S. Provisional Application 61/363,081, filed Jul. 9, 2010, and the benefit of priority to U.S. Provisional Application 61/494,388 filed Jun. 7, 2011. Each of these applications is incorporated by reference herein in its entirety.
- The present description relates to managing and classifying relationships in a social networking system.
- In order to increase user engagement, existing social networking systems encourage users to connect with as many people as possible. As a result, users typically have many connections they do not interact with on the social network. Also, the connections a user interacts with tends to change over time. In order to maintain a set of significant connections, a user may have to remove or disassociated from some connections. Existing methods require that a user manually remove a connection which is inconvenient, time consuming and in some cases socially unacceptable.
- Some existing social networks allow a user to specify lists or groups of connections that are important to the user. However, many users do not take advantage of this feature because it is complicated and time consuming.
- According to one embodiment, a system and method are provided to classify a relationship in a social networking system. One or more interactions between a first user and a second user of a social networking system are identified. Each respective interaction of the one or more interactions is scored based on a group score and a time penalty. The group score is based on the number of users in the respective interaction. The time penalty is based on a time between a current time and a time of a last interaction between the first user and the second user. A relationship ranking that measures the first user's affinity towards the second user is determined, where the relationship ranking comprises one or more interaction scores. An indicator representing the relationship ranking is sent to a client for display.
- According to one embodiment, a system and method are provided to age contacts in a social networking system. An expiration parameter is assigned to a contact of a user. The expiration parameter indicates when the contact should be disassociated from the user. An interaction between the user and the contact is detected. The expiration parameter is modified for the contact based on the detected interactions.
- The disclosed embodiments have other advantages and features which will be more readily apparent from the detailed description, the appended claims, and the accompanying figures (or drawings). A brief introduction of the figures is below.
-
FIG. 1 is a block diagram illustrating a distributed client-server system in accordance with some embodiments. -
FIG. 2 is a block diagram of a client device according to some embodiments. -
FIG. 3 is a block diagram of a server system according to some embodiments. -
FIG. 4 is a flowchart illustrating a process of classifying a friendship according to some embodiments. -
FIG. 5A andFIG. 5B are exemplary screenshots according to some embodiments. -
FIG. 6 is a flowchart illustrating the process of aging a contact according to some embodiments. -
FIG. 7A andFIG. 7B is a set of illustrations showing graphs of contacts (nodes) and connections (edges) for a social contact according to an example embodiment. - The Figures (FIGS.) and the following description relate to preferred embodiments by way of illustration only. It should be noted that from the following discussion, alternative embodiments of the structures and methods disclosed herein will be readily recognized as viable alternatives that may be employed without departing from the principles of what is claimed.
- Reference will now be made in detail to several embodiments, examples of which are illustrated in the accompanying figures. It is noted that wherever practicable similar or like reference numbers may be used in the figures and may indicate similar or like functionality. The figures depict embodiments of the disclosed system (or method) for purposes of illustration only. One skilled in the art will readily recognize from the following description that alternative embodiments of the structures and methods illustrated herein may be employed without departing from the principles described herein.
-
FIG. 1 is a block diagram illustrating adistributed system 100 that includes one ormore clients 102, acommunication network 104 and aserver system 106. The one ormore clients 102 and communicatively coupled with theserver system 106 through thecommunication network 104. - In some
embodiments server system 106 is implemented as a single server, while in other embodiments it is implemented as a distributed system of multiple servers. Solely for convenience of explanation,server system 106 is described below as being implemented on a single server system. - The communication network(s) 104 can be any wired or wireless local area network (LAN) and/or wide area network (WAN), such as an intranet, an extranet, or the Internet. It is sufficient that the
communication network 104 provides communication capability between theclient devices 102 andserver system 106. In some embodiments, thecommunication network 104 uses the HyperText Transport Protocol (HTTP) and the Transmission Control Protocol/Internet Protocol (TCP/IP) to transmit information between devices or systems. HTTPpermits client devices 102 to access various resources available via thecommunication network 104. The various embodiments disclosed, however, are not limited to the use of any particular protocol. - In some embodiments, a user interfaces with
server system 106 at aclient device 102. Aclient device 102 may be any suitable computer device that is capable of connecting toserver system 106 viacommunication network 104, such as a computer, desktop computer, laptop computer, tablet device, internet kiosk, personal digital assistant, mobile phone, gaming device, or any other device that is capable of communicating withserver system 106. Theclient device 102 may communicate with theserver system 106 via anapplication 108 such as a web browser or native application. -
FIG. 2 is a block diagram illustrating one example embodiment of theclient device 102. Theclient device 102 includes one or more processing units (CPU's) 202, one or more network orother communications interfaces 214, amemory 206, auser interface 208, acamera 222, aGPS 224 and one ormore communication buses 204 for interconnecting these components. Thecommunication buses 204 optionally include circuitry (sometimes called a chipset) that interconnects and controls communications between system components. Theclient device 102 typically includes a user interface, comprising for example adisplay device 210 and optionally a keyboard and/or mouse (or other pointing device) 212. In some embodiments, thedisplay device 210 is a touch screen display. Thecamera 222 captures images and video to be stored asdata 226. TheGPS 224 determines the location of theclient device 102. Amicrophone 230 captures audio content. - The
memory 206 includes high-speed random access memory, such as DRAM, SRAM, DDR RAM or other random access solid state memory devices; and may include non-volatile memory, such as one or more magnetic disk storage devices, optical disk storage devices, flash memory devices, or other non-volatile solid state storage devices. Thememory 206 optionally includes one or more storage devices remotely located from the CPU(s) 202. Thememory 206, or alternatively the non-volatile memory device(s) withinmemory 206, comprises a non-transitory computer readable storage medium. - In some embodiments, the
memory 206 comprises a computer readable storage medium. Thememory 206 can be configured to store anoperating system 216, a network communication module 218 (embodied as instructions executable by the CPU 202), applications 220 (embodied as instructions executable by the CPU 202) anddata 226. - The
operating system 216 includes procedures for handling various basic system services and for performing hardware dependent tasks. Thenetwork communication module 218 is used for connectingclient device 102 toserver system 106 and/or other devices and computers via the one or more communication network interfaces 214 (wired or wireless) and one or more communication networks, such as the Internet, other wide area networks, local area networks, metropolitan area networks, and so on. Theapplications 220 include applications to capture content such as pictures, video and audio. Theapplications 220 allow a user to send the captured content to theserver system 106 for storage as well as receive content from theserver system 106. In some embodiments, thedata 226 stores captured content and content metadata. The content metadata includes descriptions of content, tags of users and geographic location information. -
FIG. 3 is a block diagram illustrating one example embodiment of theserver system 106.Server system 106 includes one or more processing units (CPU's) 302, one or more network orother communications interfaces 308, amemory 306, and one ormore communication buses 304 for interconnecting these components. Thecommunication buses 304 optionally include circuitry (sometimes called a chipset) that interconnects and controls communications between system components. Thememory 306 includes high-speed random access memory, such as DRAM, SRAM, DDR RAM or other random access solid state memory devices; and may include non-volatile memory, such as one or more magnetic disk storage devices, optical disk storage devices, flash memory devices, or other non-volatile solid state storage devices. Thememory 306 optionally includes one or more storage devices remotely located from the CPU(s) 302. Thememory 306, or alternatively the non-volatile memory device(s) within thememory 306, comprises a non-transitory computer readable storage medium. In some embodiments, thememory 306 or the computer readable storage medium ofmemory 306 store the following programs, modules and data structures, or a subset thereof: -
- an
operating system 310 that includes procedures for handling various basic system services and for performing hardware dependent tasks; - a
network communication module 312 that is used for connectingserver system 106 toclient devices 102 and/or other devices and computers via the one or more communication network interfaces 308 (wired or wireless) and one or more communication networks, such as the Internet, other wide area networks, local area networks, metropolitan area networks, and so on; - a monitoring module 314, discussed below;
- a
contact ranking module 316, discussed below; - a
contact aging module 317, discussed below; and - a
user database 318, which stores information for one or more users, as discussed in greater detail herein.
- an
- The
user database 318 stores information for one ormore users 322. In some embodiments,user database 318 is a distributed database. Information for a respective user 322-1 includes content 323, contacts 324, profile information 327, comments 328 and ratings 329, content metadata 330 and interactions 331. User profile information 327 stores information such as biographic, demographic and other types of descriptive information (work experience, educational history, hobbies or preferences, interests, location, and the like). - Comments 328 stored in the
user database 218 include comments by the user as well as comments from other users on content associated with the user. Ratings 329 include the user's rating of content. Interactions 331 stores information about the user's interactions which includes a time of the interaction, the identifiers of other users involved in the interaction, the type of the interaction and weights associated with the interaction. The content 323 includes images, video, audio associated with the user. The content may be captured by the user or another user. The content metadata 330 includes descriptions or categories of content, tags of users and geographic location information. For example, the user may apply a category of “places” to a picture depicting a landmark. - The
user database 318 also is configured to store a list of contacts 325 associated with a user and an expiration parameter 326 for each contact. In some embodiments, the expiration parameter 326 for a contact specifies a length of time or a time and date when a respective contact should expire. Once the expiration parameter expires, the contact is disassociated from the user. Stated in another way, the contact and the user will no longer be connected after the expiration of the expiration parameter. As a result, the contact will not be able to view the user's private information. - The monitoring module 314 monitors actions of users and stores information about the actions in the
user database 318. The actions include capturing and storing content. For example, a user may capture an image, a video or audio. The actions include interactions between users such as messaging, tagging, commenting and rating. In some embodiments, the monitoring module 314 applies weights to the actions. The monitoring module 314 identifies one or more interactions between users and sends information about the interactions to thecontact ranking module 316 and thecontact aging module 317. - The
contact aging module 317 ages and removes contacts associated with a user. Thecontact aging module 317 assigns an initial expiration parameter to each contact of a user. In some embodiments, the expiration parameter comprises an expiration value and a decay factor which determines the rate of decay of the expiration value. For example, the expiration value may be a numerical value (e.g., 1) and the rate of decay may decay the expiration value by 0.01 every day. In some embodiments, the expiration parameter indicates when the contact should be disassociated from the user. For example, the expiration parameter may indicate a specific time or a period of time. - In some embodiments, the expiration parameter is specified by the user. For example, the user may specify an expiration value and a decay factor for the expiration value or the user may specify that a particular contact expires after a amount of time or on a specific day and time. In some embodiments, the initial expiration parameter is based on one or more factors including the frequency of interactions between the user and the contact, an importance value assigned to the contact by the user, and common profile information associated with the user and the contact.
- In some embodiments, each of the factors discussed above is assigned a weight or value. The frequency of interactions between the contact and the user may map to different values. For example, if a user and a contact interact once a month then the expiration parameter for the contact will expire some time after a month. Importance values may map to expiration parameters or modify an expiration parameter. For example, a contact with a high importance value could have an expiration parameter that lasts longer than a contact with a low importance value. The total number of common profile information or each set of common profile information may be weighted. For example, if two users have a common geographic location and common education background, weights may be given to each set of information or the total number of commonalities (e.g., two) could be used in determining the expiration parameter. The expiration parameter may be based on multiple factors. In some embodiments, the expiration parameter is a sum or product of the weighted factors.
- The
contact aging module 317 modifies the expiration parameter for a contact based on an interaction between the contact and the user. In some embodiments, the expiration parameter is modified to extend the time until the expiration parameter expires. In some embodiments, when the expiration parameter comprises a expiration value and a decay factor, the expiration value and/or the decay factor are modified. - In some embodiments, an interaction score is determined for the interaction and used to modify the expiration parameter of the contact. The modification increases the time before the expiration parameter expires or slows the decay of the expiration value. The interaction score comprises one or more contribution scores derived from aspects of the interaction. In some embodiments, the interaction score is based on one or more aspects of an interaction including the type of the interaction, a time of the interaction, the number of users in the interaction or the total number of interactions between the user and the contact and an importance parameter associated with the contact. Each aspect of the interaction may be weighted or given a contribution score. For example, an interaction score may be based on a weight assigned to the type of the interaction, a time of the interaction, the number of users in the interaction and the total number of interactions between the contact and the user. In some embodiments, the expiration parameter for the contact is modified based at least in part on a user assigned importance parameter associated with the contact.
- In some embodiments, the expiration parameter for the contact is modified based on a user specified criteria and user specified aging factor. The user may specify how the expiration parameter for certain groups of users is modified. For example, the user may specify that all users in a certain country have a predefined amount of time increased to their expiration parameter when the user interactions with them.
- The
contact aging module 317 monitors for expiration of expiration parameters. Once a contact has expired, thecontact aging module 317 modifies the relationship between the contact and the user. In some embodiments, the user is disassociated from the contact. In some embodiments, the contact is transitioned to a lower status where the contact is still connected to the user but can see only a subset of the user's private information. For example, the user may define several levels of access such as high, medium and low, where each level of access can view a different amount of the user's private information. - The
contact ranking module 316 performs a relationship ranking (e.g., generally referenced as RelationshipRank or FriendRank) process (e.g., embodied as instructions executable by a CPU and referenced as an algorithm) to help classify the relationship between two particular users. When applied to all of a user's contacts, the RelationshipRank process helps identify the user's current most relevant contacts. RelationshipRank calculates the value of a relationship by observing the behavior between two individuals and their social surroundings at the time of the observation. Thecontact ranking module 316 determines a relationship ranking or relationship score between a user and a contact based on one or more interactions between the contact and the user and the corresponding timestamps. When determining the relationship ranking, thecontact ranking module 316 takes several components into account, including but not limited to: the size of the group at the time the unique pair of users were observed together and the time between now and the last time the pair of users were observed together. - The
contact ranking module 316 examines the recent history of all the interactions in which a pair of users (u1; u2) have both been mentioned. Recent history is defined as all interactions or events within the previous T days. This set of events is known as W(u1 ,u2 ),T. - The
contact ranking module 316 sums each of the influences of the events between two users in order to determine the relationship ranking between the two users. The influence of each event comprises two components. The first component is a fixed value based on the size of the group observed. This portion is a group score (e.g., generally referenced as GroupScore). In some embodiments, the GroupScore component assigns a fixed value between 0 and 1 to an event, where the event is rated as the most valuable (with a GroupScore of 1) if the there are N users in the event, and decaying to 0 as the group becomes larger.Equation 1 illustrates the GroupScore for an event, according to some embodiments. -
- In
equation 1, n is the size of the group in the event's observation, and c1 is a tuning constant. - The second component determines how influential a single event is based an element of recency. The RelationshipRank applies a time penalty (e.g., generally referenced as TimePenalty) to events. In particular, the RelationshipRank algorithm weights more recent events higher, and decays the influence that older events based on an exponential model described in equation 2:
-
- In equation 2, t represents the current time as some number of time units since the observation was registered. T is the maximum age an observation can be before the time penalty reaches 1 and c2 is a tuning constant.
- The total influence of any single event is influence(w)=GroupScore*(1−TimePenalty). The
contact rank module 316 calculates a summation of all of the influences of all of the recent events. Equation 4 represents this summation, according to some embodiments. -
- In some embodiments, the relationship ranking for a contact is represented as a numerical value. In some embodiments, the relationship ranking for a contact is represented as a graphical indicator. In some embodiments, the
contact ranking module 316 prepares a list of contacts and a list of relationship ranking corresponding to the list of contacts. -
FIG. 4 is a flow diagram illustrating anexample method 400 of classifying a relationship between two users, according to some embodiments. Themethod 400 is performed at aserver system 106 with one or more processors (or CPUs 302) andmemory 306. The monitoring module 314 identifies one or more interactions between a first user and a second user of a social network system (402). In some embodiments, an interaction is any event that involves the first user and the second user. In some embodiments, a respective interaction comprises a message including user identifiers for the first user and the second user. In some embodiments, the user identifiers in the message are links to corresponding user profiles. In some embodiments, the respective interaction indicates that the first user is with the second user. In some embodiments, the respective interaction is associated with one or more images or videos. For example, as shown inFIG. 5A ,interaction 502 includes animage 508, amessage 504 that includes identifiers (e.g., mvanhorn, rajivpatelis and htang10) for one or more users andgraphical identifiers 506 corresponding to the users in the message. - The contact ranking module 116 scores the one or more interactions based on a group score and a time penalty (404). The contact ranking module 116 performs the RelationshipRank algorithm discussed above to determine a relationship rank for the second user. The score of a respective interaction represents the influence of the respective interaction. The group score measures the quality of a respective interaction and is based on the number of users in the respective interaction. The number of people in an interaction indicates the quality of the interaction. For example, interactions involving two users are the most valuable. In some embodiments, the group factor is decayed based on the number of users in a respective interaction. For example, a group of two users may be assigned a highest value of one and each group numbering more than two users is decayed based on the number of users in the interaction. In some embodiments, interactions having a group size larger than a predefined number are given a group score of zero.
- The time penalty weights more recent interactions higher and decays the influence of older interactions in order to help identify contacts that are currently most important to the user. In some embodiments, the time penalty is based on a time between a current time and a time of the last interaction between the first user and the second user. The interactions between users who interact more frequently are weighted higher than users who rarely interact.
- The
contact ranking module 316 determines a relationship ranking that measures an affinity of a first user towards the second user, where the relationship ranking comprises the one or more interaction scores (406). The goal of the relationship ranking is to rate or score a relationship between two users. By taking into account the group score and the time penalty, the friendship ranking identifies contacts of a user that are currently important to the user. As a user's friendships change the set of contacts that are important to the user will also change. - The
contact ranking module 316 sends an indicator representing the relationship ranking between the first user and the second user to a client for display (408). For example, the indicator may be a numerical value or graphic representing the relationship ranking. In some embodiments, thecontact ranking module 316 sends a list of contacts and a list of corresponding indicators to a user. For example, as shown inFIG. 5B , the user may view a list of user identifiers and corresponding relationship ranks 512. -
FIG. 6 is a flow diagram illustrating anexample method 600 of aging contacts in a social networking system, according some embodiments. A contact is aged and eventually disassociated with a user unless the user interacts with the contact. Such method allows a user to maintain contacts that the user actually interacts with without requiring that the user actively manage their contacts. In addition, since the user does not manually remove contacts, the removed contacts will not be offended. -
Method 600 is performed at aserver system 106 with one or more processors (CPU 302) andmemory 306. Thecontact aging module 317 assigns an expiration parameter to a contact of a user (602). In some embodiments, the expiration parameter comprises a expiration value and a decay factor which determines the rate of decay of the expiration value. In some embodiments, the expiration parameter indicates when the contact should be disassociated with the user. For example, the expiration parameter may indicate a specific time or a period of time. Once disassociated, the former contact cannot view the user's private information or content. - In some embodiments, the expiration parameter is specified by the user. For example, the user may specify an expiration value and a decay factor for the expiration value or the user may specify that a particular contact expires in one month or on a specific day and time. In some embodiments, the initial expiration parameter is based on one or more factors including the frequency of interactions between the contact of the user and the contact, on an importance value set by the user for the contact, common profile information associated with the user and the contact or any combination thereof.
- The monitoring module 314 detects one or more interactions between the user and the contact (604). In some embodiment, the one or more interactions occur after an initial expiration parameter is assigned to the contact. The interaction may include profile views, messages, tagging, comments and content views. For example, the user may view the profile of the contact, send the contact a message, tag the contact in a message or content such as an image, comment on a discussion that the contact is involved in or view content posted by a contact. In some embodiments, the interaction comprises sharing of digital content between the user and the contact. The interaction may be initiated by either the user or the contact.
- The
contact aging module 317 modifies the expiration parameter for the contact based on the detected interaction. In some embodiments, the expiration parameter for the contact is modified in response to a detected interaction. The expiration parameter may be modified to extend the time until the expiration parameter expires. In some embodiments, an interaction score is determined for the interaction and used to modify the expiration parameter of the contact. The interaction score comprises one or more contributions derived from aspects of the interaction. The interaction score may be based on the type of the interaction, a time of the interaction, the number of users in the interaction or the total number of interactions between the user and the contact or any combination thereof. Each aspect of an interaction may be given a weight and used as a contribution to the interaction score. For example, an interaction score may be based on a weight assigned to the type of the interaction, a time of the interaction, the number of users in the interaction and the total number of interactions between the contact and the user. The expiration parameter for the contact may be modified based at least in part on a user assigned importance parameter associated with the contact. - In some embodiments, the expiration parameter for the contact is modified based on a user specified criteria and user specified aging factor. The user may specify how the expiration parameter for certain groups of users is modified. For example, the user may specify that all users in a certain country have a predefined amount of time increased to their expiration parameter when the user interactions with them.
- In some embodiments, the expiration parameter is determined to have expired and the contact is disassociated from the user. As a result, the contact and the user are not longer connected and the former contact will not be able to view the user's private information. The former contact may still be able to view the user's public information. The former contact and the user may become connections again if one of the user's requests a reconnection.
- In some embodiments, when the expiration parameter has expired, the relationship between the contact and the user is transitioned from a full friendship to an intermediate one where the contact can view a subset of the user's content. A user may have three or more types of content such as public content, private content and a subset of the private content.
-
FIG. 7A shows an example of aconnection graph 700 displayed to a user at a client device according to one embodiment. Thegraph 700 helps a user visualize their connections. The user may be able to pre-apply filters so that only certain of their connections are shown on thegraph 700. For example, filters may be applied to show other users associated with a wine tasting interest, or with sports, or other users who are located within a certain geographical area or distance from the inquiring user's home or current location. Such filters may be based on any of the parameters or other information available via the social networking system. Different colors, graphical objects, symbols, or other indicia of connection type or interest may be used instead of or in addition to the filtering or selection. - In
FIG. 7A , the nodes N1, N2 . . . N17 represent users of the social networking system and the lines or edges between the nodes indicate connections between the users. In the context ofFIG. 7A , user N1 is viewing their own connection graph. The numerical values displayed along the lines indicate the number of interactions between the nodes. In this example, member N1 has had 10 interactions with member N6 and 13 interactions with member N5 over the period of time for which the graph shows data. - In some embodiments, a user may view interactions over a duration of time or interactions on an actual date. In some embodiments, the
graph 700 permits the user to either upgrade, downgrade, delete, retain, or otherwise modify the value or relevancy of the connection with that other user in accordance with the automatic aging feature described elsewhere herein. - In some embodiments, the
connection graph 700 may only show connections that are about to be dropped so that the user has an opportunity to prevent certain contacts from being disassociated from the user. In some embodiments, thegraph 700 includes an interface to add or delete contacts. - In
FIG. 7B , the user is presented with the graph of a selected set of contacts independent of the number of recent interactions.FIG. 7B illustrates the graph that may be displayed to member N1 when the member filters the graph to show only those other members for which there have been three or more interactions over the chosen period of time. - It may be noted that at least some of the information that may be graphically displayed will be displayed in a list or tabular form, such as in Table 1, so that the user may choose between different data display types and may even switch between two or more display types, including applying filters or other selection parameters.
-
TABLE 1 Shawn's Path Connections Connection First Path Last Contact Value/ Filter Name or ID Crossing (No. Contacts) Age Factor (1 to 10) Electric Cars Joe W. May 2010 May 2010 (3) Low/2 Cal, Exp. dd/mm/yy Electric Cars Susan K. April 2010 May 2010 (5) Medium/5 Cal, Exp. dd/mm/yy Electric Cars Michael A. April 2010 April 2010 (1) Low/2 Cal, Exp. dd/mm/yy Electric Cars John Y. February 2010 February 2010 (8) High/7 Cal, Exp. dd/mm/yy Electric Cars Alex M. January 2010 April 2010 (5) Low/4 Cal, Exp. dd/mm/yy Electric Cars November 2009 November 2009 (1) Low/1 Cal, Exp. dd/mm/yy Electric Cars March 2009 April 2009 (2) Low/1 Cal, Exp. dd/mm/yy Electric Cars Dave M. September 2008 March 2010 (20) High/9 Cal, Exp. dd/mm/yy Electric Cars Rachael W. August 2008 September 2009 (3) Med/5 Cal, Exp. dd/mm/yy Electric Cars Donald G. January 2007 February 2010 (6) High/8 Cal, Exp. dd/mm/yy Note: dd/mm/yy refers to day/month/year and may differ for each entry - In another non-limiting example, the user may generate and view a list of people or friends that have been identified with various hierarchical levels of importance. The list includes people that the user cares about. In an alternate non-limiting example, the user may be able to query for different groups by geographic location, identified interest, age, gender, marital status, length of relationship, or other personal or demographic information either identified by the user or selected from a predetermined list of relationship groups.
- Throughout this specification, plural instances may implement components, operations, or structures described as a single instance. Although individual operations of one or more methods are illustrated and described as separate operations, one or more of the individual operations may be performed concurrently, and nothing requires that the operations be performed in the order illustrated. Structures and functionality presented as separate components in example configurations may be implemented as a combined structure or component. Similarly, structures and functionality presented as a single component may be implemented as separate components. These and other variations, modifications, additions, and improvements fall within the scope of the subject matter herein.
- Certain embodiments are described herein as including logic or a number of components, modules, or mechanisms, for example, as noted in
FIG. 2 andFIG. 3 . Modules may constitute either software modules (e.g., code embodied on a machine-readable medium or in a transmission signal) or hardware modules. A hardware module is tangible unit capable of performing certain operations and may be configured or arranged in a certain manner. In example embodiments, one or more computer systems (e.g., a standalone,client system 102 or server computer system 106) or one or more hardware modules of a computer system (e.g., a processor or a group of processors) may be configured by software (e.g., an application or application portion) as a hardware module that operates to perform certain operations as described herein. - The various operations of example methods described herein may be performed, at least partially, by one or more processors that are temporarily configured (e.g., by software) or permanently configured to perform the relevant operations. Whether temporarily or permanently configured, such processors may constitute processor-implemented modules that operate to perform one or more operations or functions. The modules referred to herein may, in some example embodiments, comprise processor-implemented modules.
- The one or more processors may also operate to support performance of the relevant operations in a “cloud computing” environment or as a “software as a service” (SaaS). For example, at least some of the operations may be performed by a group of computers (as examples of machines including processors), these operations being accessible via a network (e.g., the Internet) and via one or more appropriate interfaces (e.g., application program interfaces (APIs).)
- The performance of certain of the operations may be distributed among the one or more processors, not only residing within a single machine, but deployed across a number of machines. In some example embodiments, the one or more processors or processor-implemented modules may be located in a single geographic location (e.g., within a home environment, an office environment, or a server farm). In other example embodiments, the one or more processors or processor-implemented modules may be distributed across a number of geographic locations.
- Some portions of this specification are presented in terms of algorithms or symbolic representations of operations on data stored as bits or binary digital signals within a machine memory (e.g., a computer memory), for example, as described with respect to
FIGS. 4-7 . These algorithms or symbolic representations are examples of techniques used by those of ordinary skill in the data processing arts to convey the substance of their work to others skilled in the art. As used herein, an “algorithm” is a self-consistent sequence of operations or similar processing leading to a desired result. In this context, algorithms and operations involve physical manipulation of physical quantities. Typically, but not necessarily, such quantities may take the form of electrical, magnetic, or optical signals capable of being stored, accessed, transferred, combined, compared, or otherwise manipulated by a machine. It is convenient at times, principally for reasons of common usage, to refer to such signals using words such as “data,” “content,” “bits,” “values,” “elements,” “symbols,” “characters,” “terms,” “numbers,” “numerals,” or the like. These words, however, are merely convenient labels and are to be associated with appropriate physical quantities. - Unless specifically stated otherwise, discussions herein using words such as “processing,” “computing,” “calculating,” “determining,” “presenting,” “displaying,” or the like may refer to actions or processes of a machine (e.g., a computer) that manipulates or transforms data represented as physical (e.g., electronic, magnetic, or optical) quantities within one or more memories (e.g., volatile memory, non-volatile memory, or a combination thereof), registers, or other machine components that receive, store, transmit, or display information.
- As used herein any reference to “one embodiment” or “an embodiment” means that a particular element, feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment. The appearances of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment.
- Some embodiments may be described using the expression “coupled” and “connected” along with their derivatives. For example, some embodiments may be described using the term “coupled” to indicate that two or more elements are in direct physical or electrical contact. The term “coupled,” however, may also mean that two or more elements are not in direct contact with each other, but yet still co-operate or interact with each other. The embodiments are not limited in this context.
- As used herein, the terms “comprises,” “comprising,” “includes,” “including,” “has,” “having” or any other variation thereof, are intended to cover a non-exclusive inclusion. For example, a process, method, article, or apparatus that comprises a list of elements is not necessarily limited to only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Further, unless expressly stated to the contrary, “or” refers to an inclusive or and not to an exclusive or. For example, a condition A or B is satisfied by any one of the following: A is true (or present) and B is false (or not present), A is false (or not present) and B is true (or present), and both A and B are true (or present).
- In addition, use of the “a” or “an” are employed to describe elements and components of the embodiments herein. This is done merely for convenience and to give a general sense of the invention. This description should be read to include one or at least one and the singular also includes the plural unless it is obvious that it is meant otherwise.
- Upon reading this disclosure, those of skill in the art will appreciate still additional alternative structural and functional designs for a system and a process for aging contacts and classifying relationships. Thus, while particular embodiments and applications have been illustrated and described, it is to be understood that the disclosed embodiments are not limited to the precise construction and components disclosed herein. Various modifications, changes and variations, which will be apparent to those skilled in the art, may be made in the arrangement, operation and details of the method and apparatus disclosed herein without departing from the spirit and scope defined in the appended claims.
Claims (20)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US14/080,775 US9270768B2 (en) | 2010-07-09 | 2013-11-14 | Automated aging of contacts and classifying relationships |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US36308110P | 2010-07-09 | 2010-07-09 | |
US201161494388P | 2011-06-07 | 2011-06-07 | |
US13/178,376 US8589491B2 (en) | 2010-07-09 | 2011-07-07 | Automated aging of contacts and classifying relationships |
US14/080,775 US9270768B2 (en) | 2010-07-09 | 2013-11-14 | Automated aging of contacts and classifying relationships |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US13/178,376 Continuation US8589491B2 (en) | 2010-07-09 | 2011-07-07 | Automated aging of contacts and classifying relationships |
Publications (2)
Publication Number | Publication Date |
---|---|
US20140074937A1 true US20140074937A1 (en) | 2014-03-13 |
US9270768B2 US9270768B2 (en) | 2016-02-23 |
Family
ID=45439359
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US13/178,376 Active 2031-08-23 US8589491B2 (en) | 2010-07-09 | 2011-07-07 | Automated aging of contacts and classifying relationships |
US14/080,775 Active US9270768B2 (en) | 2010-07-09 | 2013-11-14 | Automated aging of contacts and classifying relationships |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US13/178,376 Active 2031-08-23 US8589491B2 (en) | 2010-07-09 | 2011-07-07 | Automated aging of contacts and classifying relationships |
Country Status (2)
Country | Link |
---|---|
US (2) | US8589491B2 (en) |
WO (1) | WO2012006466A1 (en) |
Families Citing this family (50)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9298783B2 (en) | 2007-07-25 | 2016-03-29 | Yahoo! Inc. | Display of attachment based information within a messaging system |
US9584343B2 (en) | 2008-01-03 | 2017-02-28 | Yahoo! Inc. | Presentation of organized personal and public data using communication mediums |
EP2438571A4 (en) | 2009-06-02 | 2014-04-30 | Yahoo Inc | Self populating address book |
US7930430B2 (en) | 2009-07-08 | 2011-04-19 | Xobni Corporation | Systems and methods to provide assistance during address input |
US8990323B2 (en) | 2009-07-08 | 2015-03-24 | Yahoo! Inc. | Defining a social network model implied by communications data |
US9721228B2 (en) | 2009-07-08 | 2017-08-01 | Yahoo! Inc. | Locally hosting a social network using social data stored on a user's computer |
US9514466B2 (en) | 2009-11-16 | 2016-12-06 | Yahoo! Inc. | Collecting and presenting data including links from communications sent to or from a user |
US9760866B2 (en) | 2009-12-15 | 2017-09-12 | Yahoo Holdings, Inc. | Systems and methods to provide server side profile information |
US8423545B2 (en) * | 2010-02-03 | 2013-04-16 | Xobni Corporation | Providing user input suggestions for conflicting data using rank determinations |
US8620935B2 (en) | 2011-06-24 | 2013-12-31 | Yahoo! Inc. | Personalizing an online service based on data collected for a user of a computing device |
US8972257B2 (en) | 2010-06-02 | 2015-03-03 | Yahoo! Inc. | Systems and methods to present voice message information to a user of a computing device |
US8738705B2 (en) * | 2010-12-21 | 2014-05-27 | Facebook, Inc. | Categorizing social network objects based on user affiliations |
US9626725B2 (en) * | 2010-12-23 | 2017-04-18 | Facebook, Inc. | Using social graph for account recovery |
US9727886B2 (en) * | 2010-12-23 | 2017-08-08 | Facebook, Inc. | Predicting real-world connections based on interactions in social networking system |
US20120166532A1 (en) * | 2010-12-23 | 2012-06-28 | Yun-Fang Juan | Contextually Relevant Affinity Prediction in a Social Networking System |
KR101257171B1 (en) | 2011-04-28 | 2013-04-22 | 엔에이치엔(주) | Social network service providing systme and method for setting relationship between users using motion of mobile terminal and inforamtion with respect to time |
KR101257169B1 (en) * | 2011-04-28 | 2013-04-22 | 엔에이치엔(주) | Social network service providing systme and method for setting relationship between users using motion of mobile terminal and distance setted by users |
EP2721510A4 (en) * | 2011-06-16 | 2015-03-25 | Radiumone Inc | Building a social graph with sharing activity between users of the open web |
US10078819B2 (en) | 2011-06-21 | 2018-09-18 | Oath Inc. | Presenting favorite contacts information to a user of a computing device |
US9747583B2 (en) | 2011-06-30 | 2017-08-29 | Yahoo Holdings, Inc. | Presenting entity profile information to a user of a computing device |
US20130019181A1 (en) * | 2011-07-15 | 2013-01-17 | Microsoft Corporation | Ensuring variety in a feed |
CN102333054B (en) | 2011-09-26 | 2015-06-17 | 天地融科技股份有限公司 | Data sending and receiving method and device |
US9020965B1 (en) * | 2011-09-29 | 2015-04-28 | Google Inc. | Social networking relationship ranking and decay |
US10977285B2 (en) | 2012-03-28 | 2021-04-13 | Verizon Media Inc. | Using observations of a person to determine if data corresponds to the person |
CN103428164B (en) * | 2012-05-15 | 2015-07-01 | 腾讯科技(深圳)有限公司 | User social network relationship division method and system |
US9075766B2 (en) * | 2012-07-12 | 2015-07-07 | Salesforce.Com, Inc. | Computer implemented methods and apparatus for determining whether to continue relationships in an online social network |
US9196008B2 (en) | 2012-08-13 | 2015-11-24 | Facebook, Inc. | Generating guest suggestions for events in a social networking system |
US10402426B2 (en) | 2012-09-26 | 2019-09-03 | Facebook, Inc. | Generating event suggestions for users from social information |
US10013672B2 (en) | 2012-11-02 | 2018-07-03 | Oath Inc. | Address extraction from a communication |
US9224174B2 (en) | 2012-11-28 | 2015-12-29 | Facebook, Inc. | Determining influence in a social networking system |
CN103853726B (en) * | 2012-11-29 | 2018-03-02 | 腾讯科技(深圳)有限公司 | A kind of method and device for excavating community users |
US10192200B2 (en) | 2012-12-04 | 2019-01-29 | Oath Inc. | Classifying a portion of user contact data into local contacts |
US9342853B2 (en) | 2013-02-18 | 2016-05-17 | International Business Machines Corporation | Social network pruning |
US9696874B2 (en) * | 2013-05-14 | 2017-07-04 | Google Inc. | Providing media to a user based on a triggering event |
US10026129B1 (en) | 2013-12-23 | 2018-07-17 | Massachusetts Mutual Life Insurance Company | Analytical methods and tools for determining needs of orphan policyholders |
US10262616B2 (en) * | 2015-07-24 | 2019-04-16 | Sharp Kabushiki Kaisha | Display device and drive method therefor |
US9674660B1 (en) | 2015-11-09 | 2017-06-06 | Radiumone, Inc. | Using geolocation information in a social graph with sharing activity of users of the open web |
US10027656B2 (en) * | 2015-12-07 | 2018-07-17 | Facebook, Inc. | Systems and methods for user account recovery |
US10567312B2 (en) | 2016-04-11 | 2020-02-18 | Facebook, Inc. | Techniques for messaging bot controls based on machine-learning user intent detection |
US10606848B2 (en) * | 2016-04-11 | 2020-03-31 | Facebook, Inc. | Techniques for device configuration using messaging history information |
US10367767B2 (en) | 2016-09-21 | 2019-07-30 | Facebook, Inc. | Modular inbox and generation of content modules |
US11233760B2 (en) | 2016-09-21 | 2022-01-25 | Facebook, Inc. | Module ranking for a modular inbox |
US10356029B2 (en) | 2016-09-21 | 2019-07-16 | Facebook, Inc. | Methods and systems for presenting modules in an inbox interface |
US10841264B2 (en) | 2016-09-21 | 2020-11-17 | Facebook, Inc. | Method and system for presenting a subset of messages in a modular inbox |
US10313461B2 (en) * | 2016-11-17 | 2019-06-04 | Facebook, Inc. | Adjusting pacing of notifications based on interactions with previous notifications |
US10880237B2 (en) | 2016-11-28 | 2020-12-29 | Facebook, Inc. | Methods and systems for ranking messaging bots |
US10678861B2 (en) * | 2016-12-28 | 2020-06-09 | Facebook, Inc. | Personalized post session model for an online system |
KR102347825B1 (en) * | 2017-08-16 | 2022-01-05 | 엘지디스플레이 주식회사 | Display panel including the photo sensor and display apparatus using the same |
US11115228B2 (en) * | 2018-07-30 | 2021-09-07 | Slack Technologies, Inc. | Method, apparatus, and computer program product for individual profile telemetry discovery within a group based communication system |
CN114760261B (en) * | 2022-06-13 | 2022-09-09 | 杭州安司源科技有限公司 | Instant messaging tool contact person sorting method and device |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7359894B1 (en) * | 2004-06-30 | 2008-04-15 | Google Inc. | Methods and systems for requesting and providing information in a social network |
US7509131B2 (en) * | 2004-06-29 | 2009-03-24 | Microsoft Corporation | Proximity detection using wireless signal strengths |
US20090112701A1 (en) * | 2007-02-01 | 2009-04-30 | Enliven Marketing Technologies Corporation | System and method for implementing advertising in an online social network |
US20090164574A1 (en) * | 2007-12-21 | 2009-06-25 | Concert Technology Corporation | System and method for identifying transient friends |
Family Cites Families (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6946715B2 (en) | 2003-02-19 | 2005-09-20 | Micron Technology, Inc. | CMOS image sensor and method of fabrication |
US7373109B2 (en) * | 2003-11-04 | 2008-05-13 | Nokia Corporation | System and method for registering attendance of entities associated with content creation |
US8015119B2 (en) * | 2004-01-21 | 2011-09-06 | Google Inc. | Methods and systems for the display and navigation of a social network |
US7620404B2 (en) * | 2005-12-22 | 2009-11-17 | Pascal Chesnais | Methods and apparatus for organizing and presenting contact information in a mobile communication system |
US20090228296A1 (en) | 2008-03-04 | 2009-09-10 | Collarity, Inc. | Optimization of social distribution networks |
US20100161369A1 (en) * | 2008-12-23 | 2010-06-24 | International Business Machines Corporation | Application of relationship weights to social network connections |
-
2011
- 2011-07-07 US US13/178,376 patent/US8589491B2/en active Active
- 2011-07-07 WO PCT/US2011/043252 patent/WO2012006466A1/en active Application Filing
-
2013
- 2013-11-14 US US14/080,775 patent/US9270768B2/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7509131B2 (en) * | 2004-06-29 | 2009-03-24 | Microsoft Corporation | Proximity detection using wireless signal strengths |
US7359894B1 (en) * | 2004-06-30 | 2008-04-15 | Google Inc. | Methods and systems for requesting and providing information in a social network |
US20090112701A1 (en) * | 2007-02-01 | 2009-04-30 | Enliven Marketing Technologies Corporation | System and method for implementing advertising in an online social network |
US20090164574A1 (en) * | 2007-12-21 | 2009-06-25 | Concert Technology Corporation | System and method for identifying transient friends |
Also Published As
Publication number | Publication date |
---|---|
US8589491B2 (en) | 2013-11-19 |
US9270768B2 (en) | 2016-02-23 |
US20120011204A1 (en) | 2012-01-12 |
WO2012006466A1 (en) | 2012-01-12 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US9270768B2 (en) | Automated aging of contacts and classifying relationships | |
US10679147B2 (en) | Sentiment polarity for users of a social networking system | |
US10630791B2 (en) | Customized presentation of event guest lists in a social networking system | |
US10162891B2 (en) | Determining demographics based on user interaction | |
US10419560B2 (en) | Presenting additional content items to a social networking system user based on receiving an indication of boredom | |
US10623366B1 (en) | Conversion tracking of organic content in a social networking system | |
US10168853B2 (en) | Displaying news ticker content based on value in a social networking system | |
US10652075B2 (en) | Systems and methods for selecting content items and generating multimedia content | |
US10063513B2 (en) | Determining temporal relevance of newsfeed stories | |
US20190281125A1 (en) | Systems and methods for smart publishing | |
US20160241504A1 (en) | Presenting previously presented content items stored by users of a social networking system based on user-specified criteria | |
US20160321260A1 (en) | Systems and methods for demotion of content items in a feed | |
US20160078035A1 (en) | Systems and methods for providing real-time content items associated with topics | |
US10846803B2 (en) | Presenting previously presented content items stored by users of a social networking system | |
US10484499B2 (en) | Selecting content for presentation to an online system user based on affinities of the user for additional users inferred from an organizational chart | |
US11252120B2 (en) | Inferring a geographic location for an entity at a geographic granularity based on geographic locations of users of an online system interacting with the entity | |
US10572536B2 (en) | Determining rate of video feed stories in a feed provided to users | |
US20140164503A1 (en) | Displaying news ticker content based on diversity in a social networking system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: DAUM KAKAO CORP., KOREA, REPUBLIC OF Free format text: SECURITY INTEREST;ASSIGNOR:PATH, INC.;REEL/FRAME:035777/0050 Effective date: 20150529 |
|
AS | Assignment |
Owner name: PATH, INC., CALIFORNIA Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:DAUM KAKAO CORP.;REEL/FRAME:035929/0724 Effective date: 20150616 |
|
AS | Assignment |
Owner name: PATH, INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:MORIN, DAVID B.;FANNING, SHAWN D.;MIERAU, DUSTIN R.;AND OTHERS;SIGNING DATES FROM 20110914 TO 20110923;REEL/FRAME:037482/0676 Owner name: DAUM KAKAO SINGAPORE CORP., SINGAPORE Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:PATH, INC.;REEL/FRAME:037482/0694 Effective date: 20150615 |
|
AS | Assignment |
Owner name: PATH MOBILE INC PTE. LTD., SINGAPORE Free format text: CHANGE OF NAME;ASSIGNOR:DAUM KAKAO SINGAPORE CORP.;REEL/FRAME:037518/0805 Effective date: 20150804 |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 4TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1551); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Year of fee payment: 4 |
|
AS | Assignment |
Owner name: KAKAO CORP., KOREA, REPUBLIC OF Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:PATH MOBILE INC PTE. LTD.;REEL/FRAME:052971/0212 Effective date: 20200609 |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 8TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1552); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Year of fee payment: 8 |