The present invention relates generally to automatic classification of communication sessions (e.g., a messaging conference) of social network users based on data describing parameters such as participating users, conversation messages and shared content items within a communication session.
The increased availability of network-capable computing devices has led to a wide variety of communication options for users. Users can exchange messages and content through various communication systems including e-mail, instant messaging, chat rooms, bulletin and discussion boards, file sharing applications, and blogs and other web sites. For example, instant messaging systems such as Internet Relay Chat (IRC), ICQ, AOL Instant Messenger, Yahoo! Messenger, and Microsoft's MSN Messenger are widely used by many users on the Internet. Similar systems are available for messaging within local networks, as well.
Various arrangements of the previously-listed (and other) communication systems have been proposed for use in so-called “social networking” systems. Generally speaking, a “social network” refers to a group of persons or other entities (“members”) linked to one another through one or more types of social connections. Social networks are also commonly referred to as “friend-of-a-friend” networks, although social networks may of course include or consist entirely of entities linked by social connections other than friendship. For example, a social network can include members linked to one another by connections including common friendship, place or field of employment, place of education, place of residence, membership in a club or other group, or common hobbies or topical interests. Many social networking systems attempt to provide computer-based tools for maintaining, enhancing, and creating social networks.
For example, social networking web sites provide users with web space to create a profile and link to various other users designated as “friends.” See, for example, http://www.myspace.com, http://www.facebook.com, and http://www.friendster.com. Users of such sites can post messages and other content to web pages accessible to various parties of their choosing (for example, to “friends only” or to the public at large). Social networking sites may also utilize instant messaging and online chat rooms that allow for near-instantaneous communication between users. Social networks may also involve sharing of digital content, including photos, videos, audio files, documents, and other data items.
Social networks and other computer-based communication systems may provide various means for users to set up profiles. For example, a user may list interests and other attributes in a profile, with the profile used by other users for informational purposes and/or by one or more computer systems to provide functionality, such as recommendations and/or content delivery, for instance. However, users may provide inaccurate and/or incomplete profile information.
Other systems may be configured to generate additional profile information about user interactions. For example, U.S. Patent Application Publication 2006/0064431 (Kishore et al.) is concerned with generation of a knowledge interchange (“KI” profile) that identifies interests of a user, individuals with whom a user has communicated, and topics on which the communication with the user was made.
Many systems that have involved various profiling of users and/or associated communication-related aspects (such as web page or content viewing habits) create their characterizations based on prior information as opposed to real-time quantities that are continuously changing over time. Furthermore, specific parameters may be considered individually and/or in isolation. In light of the foregoing and other concerns, improved methods and systems for classifying communication sessions (i.e. actual live communication interaction between users in a social network) are provided.
Objects and advantages of the present invention will be apparent to one of skill in the art upon review of the presently disclosed subject matter, and include providing improved methods and systems of classifying communication sessions among users in a social network.
In accordance with the presently disclosed technology, a social network communication session may correspond to the actual communication among a collection of at least some members of a social network that have previously been or are currently connected by way of one or more communication links for purposes of live communication, content distribution, or other purposes. In one embodiment, a social network communication session can be characterized by a “circuit” representing a collection of social network members who were/are participating in a live communication link, such as an ongoing instant messaging conversation between multiple parties. Other exemplary social network sessions are defined by the user interaction associated with specific occurrences of one or more file or content sharing sessions, e-mail conversations, blog postings and comments, video and/or audio chat sessions, or other video, textual, and/or audio connections, including telephone connections, and the like.
In some exemplary embodiments, communication sessions are characterized by a plurality of different parameters, thus providing a comprehensive analysis of user communications. One parameter that is analyzed in accordance with the subject classification technology includes the underlying social network of users that have participated and/or or are participating in one or more communication sessions with one another. Additional analyzed parameters may selectively include a topic of conversation among linked users associated with a communication session, as well as metadata associated with digital assets or content that is shared among users in the social network. By providing data pertaining to conversation topics and shared content, creation of a communication classification is facilitated that provides a refined understanding of what is relevant to one or more given users. The subject classification system may be aware of what users are participating in a given topic and what digital content is shared and can adjust corresponding influence levels of such users relative to a given analyzed communication instance. For example, a user who chats more about a given topic or who shares more relevant content may have an increased influence level associated with their contributed parameters.
Further related advantages in accordance with aspects of the presently disclosed technology are realized by providing personalized classifications for each user (or various selected users) participating in a communication session based on their individual respective social network information. User participation, activity level, and shared content within a social network and specific communication sessions are analyzed in a perpetual fashion that accounts for changes over time. Still further, relevancy considerations that are determined by considering the contribution of a user's conversation and shared content help prevent the potential problem of parameter influence by spammers who would provide little to no relevant content or conversation in a communication session.
Exemplary embodiments related to computing a communication session profile involve generating ratings for a selected set of messages and metadata associated with content items that are shared by social network users participating in a communication session. Ratings may be based on keyword scores which may then be adjusted based on user participation parameters, social network characterization parameters, and user selected options. Communication session profiles change over time and so recomputation is effected on periodic or scheduled bases. Generated profiles may be stored, frequently retrieved, or used in applications such as but not limited to content filtering, recommending content shared by participating social network members, selecting relevant advertisements, providing topic suggestions or user list invitations.
A full and enabling disclosure including the best mode of practicing the appended claims and directed to one of ordinary skill in the art is set forth more particularly in the remainder of the specification. The specification makes reference to the appended Figures, in which:
a provides a schematic illustration of an exemplary social network;
b provides a schematic illustration of an alternative exemplary social network formed by user selection or system computation from the social network represented in
Use of like reference numerals in different features is intended to illustrate like or analogous components.
Reference will now be made in detail to various and alternative exemplary embodiments and to the accompanying drawings, with like numerals representing substantially identical structural elements. Each example is provided by way of explanation, and not as a limitation. In fact, it will be apparent to those skilled in the art that modifications and variations can be made without departing from the scope or spirit of the disclosure and claims. For instance, features illustrated or described as part of one embodiment may be used on another embodiment to yield a still further embodiment. Thus, it is intended that the present disclosure includes modifications and variations as come within the scope of the appended claims and their equivalents.
The technology discussed herein makes reference to servers, databases, software applications, and other computer-based systems, as well as actions taken and information sent to and from such systems. One of ordinary skill in the art will recognize the inherent flexibility of computer-based systems allows for a great variety of possible configurations, combinations, and divisions of tasks and functionality between and among components. For instance, server processes discussed herein may be implemented using a single server or multiple servers working in combination. Databases and applications may be implemented on a single system or distributed across multiple systems. Distributed components may operate sequentially or in parallel. When data is obtained or accessed between a first and second computer system or component thereof, the actual data may travel between the systems directly or indirectly. For example, if a first computer accesses a file or data from a second computer, the access may involve one or more intermediary computers, proxies, and the like. The actual file or data may move between the computers, or one computer may provide a pointer or metafile that the second computer uses to access the actual data from a computer other than the first computer, for instance.
The various computer systems discussed herein are not limited to any particular hardware architecture or configuration. Any suitable programming, scripting, or other type of language or combinations of languages may be used to implement the teachings contained herein. Embodiments of the methods and systems set forth herein may be implemented by one or more general-purpose or customized computing devices accessing software instructions rendered in a computer-readable form. Embodiments of the methods and systems set forth herein may also be implemented by hard-wired logic or other circuitry, including, but not limited to application-specific circuits. Of course, combinations of computer-executed software and hard-wired logic may be suitable, as well.
Embodiments of the methods disclosed herein may be executed by one or more suitable computing devices. Such devices may access one or more computer-readable media that embody computer-readable instructions which, when executed by at least one computer, cause the at least one computer to implement one or more embodiments of the methods disclosed herein. Furthermore, components of the presently-disclosed technology, such as knowledge bases and data stores, may be implemented using one or more computer-readable media. Any suitable computer-readable medium or media may be used, including diskettes, drives, and other magnetic-based storage media, optical storage media, including disks (including CD-ROMS, DVD-ROMS, and variants thereof), flash, RAM, ROM, and other memory devices, and the like.
The present disclosure provides several examples of classifying users based on certain types of shared content and certain types of metadata, such as keywords. However, in other embodiments, any suitable type of metadata may be used, and any suitable type of content may be used in classifying users. Furthermore, the extent of the illustrated social networks, relationship types, and other social network characterizations are only for purposes of example; the present subject matter may utilize other types of social networks and social network data than illustrated herein.
Referring now to
As previously mentioned, a social network session corresponds to actual communication among a collection of at least some members of a social network that have previously been or are currently connected by way of one or more direct or indirect communication links for purposes of live communication, content distribution, or other purposes. The exemplary communication session of
Referring still to
In the context of a social network conferencing session, a display portion 16 associated with Harry's user display provides a list of all conversation messages that are contributed by the participating social network users. Participating users may additionally or alternatively share particular content items, such as but not limited to digital assets such as photos, videos, images, text files, html documents, spreadsheets, or others. A display portion 18 represents to a user a group of content items that are shared by the participating social network users. In one embodiment, all content items available for sharing from various participating session members are provided (actually or by a viewable representation) to Harry. In another embodiment (as discussed later in more detail) the shared content display 18 as well as the advertisement display 20 are customized by the subject session profiling service to provide content and/or ads that are selected in some fashion based on a relevancy comparison of interaction parameters associated with the given session and possible content items or ads that may be provided. This specialized customization for a given user display will vary user to user depending on the session profile relative to each different user. Thus, available content and/or ads or other information may be particularly selected for each user participating in the social network communication session.
Referring now to
With more particular reference to
Referring still to
Keywords can be generated in any suitable fashion. In some embodiments, keywords may be obtained directly from conversation messages or from metadata associated with a content item. For example, a digital photograph may be annotated by one or more tags, summaries, or other identifiers. Keywords may be generated based on the content metadata—for example, summaries, annotations, or even the content itself may be scanned or otherwise mined for keywords. In some embodiments, the system may support any combination of standard keywords and user-defined key words.
Once one or more keywords are generated, each keyword is then scored. One example of keyword scoring involves a direct correlation between the number of occurrences of each keyword in the message or in content item metadata and the score for that message/item. In another example, an initial score for a keyword may be defined in a lookup table or other resource. For example, the system may maintain an ontology of keywords and associated values. Several examples of scoring scenarios are discussed below wherein the initial or base keyword score is adjusted. However, still further types of scoring and combinations of scoring methodology are possible. More particular discussion of exemplary aspects associated with detecting and scoring keywords is disclosed in concurrently filed U.S. Patent Application entitled “SYSTEM AND METHOD FOR USER CLASSIFICATION BASED ON SOCIAL NETWORK AWARE CONTENT ANALYSIS” having application Ser. No. 11/645,864 filed Dec. 27, 2006 and issued as U.S. Pat. No. 8,135,800 on Mar. 13, 2012.
It should be appreciated that the keyword scores determined in the initial rating may be numeric values, but may also correspond to other appropriate descriptors that depict the relative nature of difference in keyword association and relevance for different messages or pieces of content.
After an initial rating is calculated for the selected set of messages and content items, additional adjustments can be made to the ratings to account for various parameters associated with the social network communication session, such as user participation and social network characterization. Exemplary step 24 in
With more particular reference to exemplary step 24 of
User participation in the subject rating adjustment step 24 of
With respect to message factors, message volume may be considered, which is a measure of how many messages a given user sent during the communication session. Additional message characterizations may include measurements of the number of non-stop words, number of unique words, number of predetermined buzzwords, and other factors. Message acceptance considerations factor in the amount of replies given to particular messages sent by a user, or subsequent discussions relating the message provided by a given user. In another example, user participation adjustments may increase the rating of messages or content for a user that initiates or starts a given communication session. Still further message acceptance considerations include the number of users ignoring a user, the number of users that opt to ignore a message, the frequency of message contribution, and other related factors.
With respect to content item factors, a given user's contribution of content to the communication session can be considered. The total amount of content can be considered based on the number of content items contributed by a user as well as the size of the contributed items. The subject profiling system may also factor in the number of users in a conference that consumed a shared content item. Consumption generally refers to whether or not a user viewed or accessed a portion or the entirety of a given content item. In general, the profiling system applies more weight to metadata of contributed content that is actually consumed by one or more participating users (e.g., a video that was actually watched). Still further content considerations may relate to activities that may have occurred while consuming the content (e.g., number of rewinds, pauses, fast-forwards, mutes, and other actions).
Additional user participation adjustments for both messages and content may relate to the scope of initial distribution of such messages and/or content items. For example, messages and/or content items may be distributed to different numbers of members including but not limited to: only one user in the social network, a handful of users, or all users. This scope of distribution for messages and/or content items may correlate to an adjustment factor for such items. For instance, it may be desirable to increase keyword scores for messages and/or content items that have been distributed to a greater number of users. Alternatively, keyword scores for messages and/or content with a lesser scope of distribution may be weighed more heavily. In other embodiments, increases or decreases in keyword scores may be implemented for multiple different predetermined ranges of distribution.
Still further user participation adjustments may be afforded based on user customization of received messages or content items. A client application associated with a given user may be incorporated as part of a user interface and allows users to provide direct feedback of messages and/or content. For example, a user can select a message or piece of content and can rate it on a scale from 1-5 (or by selection from some other predetermined rating definitions). This user feedback rating can also be used to modify or scale the initial rating associated with a given message or content item.
By considering aspects of user participation that relate to various user replies to given messages or to content consumption rates of shared content, the subject session profile methodology helps limit the influence of possible spammers or other unauthorized or unwanted participants in a social network session since participating users will typically not respond to spammer messages or content provided by spammers. Additionally or alternatively, other users in the network may assign a relatively low rating to messages or content items received from spammers (e.g., such as a rating described above on a scale from 1-5 or other scale definition), thus also limiting the influence of contributions from such entities.
Referring still to
For example, more influence may be given to selected users that are closer in the social network to a given user by weighing keywords derived from messages and/or content associated with such closer users more heavily. For example, a keyword score may be multiplied by an adjustment factor that is inversely proportional to social network distance. The social network distance may be obtained, for example, by a session profile service (e.g., profile service 48 of
As another example, keywords may be scored based on the degree of trust between the target user and the selected user. For instance, messages and/or content associated with highly-trusted users may have high influence, while messages and/or content associated with less-trusted users has little to no influence. Trust may also be determined based on querying social network service 46 to determine if the users have provided data indicating trust. For instance, some social network systems provide for users to rate one another in terms of trust. If the target user has provided a trust rating for the selected user, the trust rating or a derivative thereof may be used to scale points while scoring keywords derived from messages or content associated with the selected user. For example, in a system in which trust is rated on a scale of 1 to 10 (10 being highest), a target user's rating of “7” for the selected user can result in the selected user's keyword scores being multiplied by seven.
However, trust ratings may not be available in all circumstances—for instance, the user classification system may rely on messages and/or content from a selected user who has not been rated by the target user in terms of trust. The scoring process may utilize trust ratings of the selected user by one or more users other than the target user, with the ratings of the other user(s) scaled based on distance of each other user to the target user. For example, assume that a selected user has not been rated in terms of trust by a target user. However, the selected user may have been rated a “5” by a second user. If the second user is two levels away from the target user, the second user's rating of “5” may be divided by the distance (two in this example) to infer a trust rating of “2.5” for the selected user.
Alternatively, when a trust level is unavailable, one or more other resources may be consulted, such as a trust assessment system. Exemplary trust assessment systems are described in Walsh, et al., U.S. patent application Ser. No. 11/636,910, entitled “System and Method for Social Network Trust Assessment”, filed Dec. 11, 2006 and assigned to Qurio Holdings, Inc.
In some embodiments, thresholding may be applied to trust levels as part of the scoring process. For example, only trust levels above a defined threshold value may be used to adjust points for a selected user. As another example, ranges of trust levels may be defined wherein a certain multiplier is used for any trust level falling within specified ranges. Furthermore, trust ratings may result in lowering the score of a keyword or set of keywords. For example, if a target user rates a selected user below a certain level or with a negative rating, the points contributed by that user may be multiplied by a negative factor. These notions of thresholds and range-based adjustments may be applied to trust ratings but also to user participation modifiers or social network descriptors and corresponding scoring adjustments as previously described.
A further example of scoring adjusts keyword points based on relationship types. For example, social network service 46 may provide definitions of different types of relationships, including, but not limited to: friend, co-worker, family, club/organization member, and acquaintance. Different relationship types between the target user and the selected user may result in different scaling of points for keywords derived from messages and/or content items associated with the selected user. For example, family relationships may be given a multiplier of “5”, friend relationships a multiplier of “4”, club/organization relationships a multiplier of “3”, and so on. In some embodiments, multiple relationship types may be involved—for example, a target user may be linked to a selected user by a path including one or more intermediate users. The classification system may factor in the distance along the path, for instance, by using a multiplier such as (relationship type modifier)/distance. In other embodiments, the type designators provided by users other than the target user may be ignored, or may result in a different scaling factor.
Another possible parameter for adjusting keyword points relates to the geographic origins of users and/or the messages and content items associated with such users. Such parameter may be especially applicable when users communicate via systems outfitted with location-based services, such as GPS-enabled mobile devices or other devices or systems, or when user client systems are linked directly or indirectly to systems that are enabled with location-based services such as but not limited to wireless access points or the like that are aware of their relative geographic location. Metadata associated with access points, communication links or distributed messages or content can include geographical identifiers. This enables keyword scores associated with a given message or content item to be adjusted based on the geographic location of its contributing user. For example, keyword scores may be increased or decreased for messages and content items received from users within certain predefined geographic areas (e.g., a 100-mile radius, a given quadrant area, a given state, county, city or other defined boundary area or areas). For example, in one embodiment keyword scores may be increased for messages and content received from users that are geographically closer to a target user. In other embodiments, keyword scores may be increased for messages and content received from less proximate users. It should also be appreciated that multiple different geographic areas may be defined to correspond to different possible multipliers. For example, messages and content associated with users in the same state as the target user (e.g., North Carolina) may be assigned a multiplier of “5”; if the messages and/or content are received from a user outside of NC but within the United States, a rating of “4” is assigned, if received from outside the U.S. a rating of “3” is used, etc. In other example, users within a 100-mile radius receive one rating, users within a 500-mile radius receive another rating, users within a 1000-mile radius receive a still further rating. Other variations of single or multiple mappings of geographic areas to scoring adjustment factors may be practiced in accordance with the disclosed technology.
Another example of scoring adjusts keyword points based on considering the selected user's role or participation in the social network. For example, social network data may be used to determine various measures of a selected user's centrality to or connectedness in a social network. For example, centrality may be determined using principles of graph theory and network analysis. For example, eigenvector centrality may be used as part of determining centrality of a user. Keywords from highly-connected users may be scored differently than keywords from less-connected users. For example, in a given social network, some users may be highly connected, such as by having multiple links throughout the network. Other users may have only a few links. Adjustment factors may be used to change the relative contribution of such users—for instance, in some embodiments, it may be advantageous to weigh the highly-connected users less heavily than the users with lower connectivity in order to gain a more balanced view of the social network. In other embodiments, contributed messages and/or content from less-connected users may be weighed more heavily. The specific mapping of user connectivity levels to the weight of messages or content received from a user can be defined in a variety of different fashions as desired, and should not be construed as a limitation of the presently disclosed technology.
In another example of scoring, the system adjusts keyword points based on considering the selected user's length of participation in the social network. For example, keywords derived from messages and/or content associated with a selected user with greater longevity in a social network may be given greater weight than keywords derived from content associated with a newly-joined member. For instance, a keyword's score may be multiplied by a duration adjustment such as (days in social network/365). As another alternative, participation length may be used as a threshold: a selected user's messages and/or content will contribute keyword points only if the selected user has been participating in the social network for a long enough time. As a still further alternative, the system may select a multiplier based on a duration range. For example, points from selected users with duration less than 14 days may be given a multiplier of “0.5”; points from selected users with a duration of 14-60 days may be given a multiplier of “1.0”; while points from selected user with a duration of 60 days or more may be given a multiplier of “2.” Of course, combinations of set points, thresholds, and multipliers derived from duration are possible.
Alternatively, the session profiling system may use circuit information to override the social network information. In this instance, a social network “circuit” is a subset of users in a larger social network that is representative of particular interactions. For example,
Referring again to
In accordance with steps 22-28, respectively, of
This aggregation of information collectively represents the session profile snapshot at a given instance in time. Once the profile is generated, additional steps may occur as indicated in step 30. For instance, the profile may be stored in a profile database located at the user's client system or at a server (as will be discussed further in more detail). Profiles may be stored in a database with all or only a portion of the data used to produce the profile (e.g., message and content identifications, keywords and scores, initial ratings, adjustment factors, etc.). As one option, the session profiling system may store profile differences relative to prior versions rather than complete profiles to take advantage of the nature of conversations evolving over time. Since not every aspect of the conversation, shared content items and participating users will change every time a new session profile is computed, it may be less efficient to resave all such information. Storing differences may also enable a client application to provide users with the ability to time-shift to a previous time in a given session. This feature may be particularly useful to users that join a conversation after it has already begun. The time shifted user can retrieve and utilize the session profile associated at that particular point in time.
Another application of the generated session profiles is to recommend content items for sharing with a given user. The profiling system may compare available content items (e.g., all content items made available for sharing by users participating in a social network communication session) and select a subset of the available items based on which ones have the highest adjusted rating obtained after performing the steps disclosed herein. This subset of recommended content may be provided to a user in the content display portion 18 in the user interface 10 of
It should be appreciated in accordance with the subject session profiling technology that it is preferred to obtain multiple session profiles in a real-time fashion such that profile characterizations can be periodically updated. In one embodiment, profile computation may be defined to occur in increments of a given time duration, for example, once every 5 seconds, once every minute, hour, or other user-selected, system-selected or default defined time period. In another embodiment, the scheduling of session profile computations may depend on a recomputation rate that considers users and/or conference characteristics. For example, a popular conference having a relatively large number of users and amount of messages or shared content may have its conference profile recomputed more frequently than smaller conferences with less activity. Alternatively, the profiling system may favor certain users or conversation topics and so will recompute profiles more often for premium users or more relevant topics.
Referring now to
The network 43 may also be coupled to a server 40, which may host one or more services such as but not limited to a content sharing service 42, a communication service 44, a social network service 46, and a session profile service 48. Session profile service 48 performs the profile functionality discussed in the present disclosure, and generally utilizes information that is obtained from the other services 42, 44 and 46. It should be appreciated that although the profiling functionality is illustrated as occurring in a server 40 separate from each client 41, the presently disclosed profiling methodology may alternatively be performed by a profile application provided at each client 41. In some embodiments, the profiling functionality may be shared between client and server nodes.
Referring still to
Session profile service 48 is in communication with one or more social network systems 46, one or more content sharing systems 42, and one or more communication systems 44. Social network system 46 may include one or more systems providing social network functionality. For example, a social network system may include a plurality of servers, databases, and other components that allow users to define user profiles, characterize relationships, and interact with one another (such as via instant messaging, web pages, blog posts, etc.). Data representing the social network structures, member relationships, and other data defining the social network is maintained by store 52. Each social network system 46 may be implemented in a number of different ways, and so store 52 is meant to generally represent the various databases, mappings, and/or other representations of social networks. Social network system 46 may represent any suitable type of system providing social network functionality. The underlying social networks may be static in nature, such as friend-of-a-friend networks, but alternatively or additionally may be dynamic, such as social networks based on ongoing communications activity. Social network system 46 may interact with various social network members not actually participating in a given social network communication session.
Referring still to
Content sharing system 42 has access to content sharing metadata 54. For instance, content sharing metadata 54 may comprise content sharing system metadata indicating distribution histories, user preferences, and other information about the flow of content to clients in a content sharing system 42. As was noted above with regard to social network systems, multiple content sharing systems may be utilized in the present subject matter.
Referring still to
In some embodiments, some or all of the components illustrated in
It is appreciated by persons skilled in the art that what has been particularly shown and described above is not meant to be limiting, but instead serves to show and teach various exemplary implementations of the present subject matter. As set forth in the attached claims, the scope of the present invention includes both combinations and sub-combinations of various features discussed herein, along with such variations and modifications as would occur to a person of skill in the art.
Number | Name | Date | Kind |
---|---|---|---|
5220657 | Bly et al. | Jun 1993 | A |
5517617 | Sathaye et al. | May 1996 | A |
5537586 | Amram et al. | Jul 1996 | A |
5717923 | Dedrick | Feb 1998 | A |
5749081 | Whiteis | May 1998 | A |
5867799 | Lang et al. | Feb 1999 | A |
5884035 | Butman et al. | Mar 1999 | A |
5948040 | DeLorme et al. | Sep 1999 | A |
5983214 | Lang et al. | Nov 1999 | A |
6073119 | Bornemisza-Wahr et al. | Jun 2000 | A |
6073138 | de I'Etraz et al. | Jun 2000 | A |
6088702 | Plantz et al. | Jul 2000 | A |
6092049 | Chislenko et al. | Jul 2000 | A |
6195696 | Baber et al. | Feb 2001 | B1 |
6260069 | Anglin | Jul 2001 | B1 |
6301609 | Aravamudan et al. | Oct 2001 | B1 |
6308175 | Lang et al. | Oct 2001 | B1 |
6327590 | Chidlovskii et al. | Dec 2001 | B1 |
6338086 | Curtis et al. | Jan 2002 | B1 |
6374290 | Scharber et al. | Apr 2002 | B1 |
6385619 | Eichstaedt et al. | May 2002 | B1 |
6421439 | Liffick | Jul 2002 | B1 |
6438579 | Hosken | Aug 2002 | B1 |
6442693 | Sandgren et al. | Aug 2002 | B1 |
6480885 | Olivier | Nov 2002 | B1 |
6493703 | Knight et al. | Dec 2002 | B1 |
6519629 | Harvey et al. | Feb 2003 | B2 |
6525747 | Bezos | Feb 2003 | B1 |
6526411 | Ward | Feb 2003 | B1 |
6539375 | Kawasaki | Mar 2003 | B2 |
6553108 | Felger | Apr 2003 | B1 |
6594693 | Borwankar | Jul 2003 | B1 |
6606644 | Ford et al. | Aug 2003 | B1 |
6630944 | Kakota et al. | Oct 2003 | B1 |
6651086 | Manber et al. | Nov 2003 | B1 |
6654735 | Eichstaedt et al. | Nov 2003 | B1 |
6745178 | Emens et al. | Jun 2004 | B1 |
6748420 | Quatrano et al. | Jun 2004 | B1 |
6757517 | Chang | Jun 2004 | B2 |
6816906 | Icken et al. | Nov 2004 | B1 |
6829569 | Drucker et al. | Dec 2004 | B1 |
6832245 | Isaacs et al. | Dec 2004 | B1 |
6839680 | Liu et al. | Jan 2005 | B1 |
6859807 | Knight et al. | Feb 2005 | B1 |
6970444 | Chwieseni et al. | Nov 2005 | B2 |
6988096 | Gupta et al. | Jan 2006 | B2 |
6988127 | Matsuda et al. | Jan 2006 | B2 |
6993564 | Whitten, II | Jan 2006 | B2 |
7006999 | Huberman et al. | Feb 2006 | B1 |
7016307 | Vasudev et al. | Mar 2006 | B2 |
7039639 | Brezin et al. | May 2006 | B2 |
7058897 | Matsuda | Jun 2006 | B2 |
7069308 | Abrams | Jun 2006 | B2 |
7069318 | Burbeck et al. | Jun 2006 | B2 |
7092952 | Wilens | Aug 2006 | B1 |
7103634 | Ullmann et al. | Sep 2006 | B1 |
7107317 | Demsky et al. | Sep 2006 | B2 |
7117254 | Lunt et al. | Oct 2006 | B2 |
7124164 | Chemtob | Oct 2006 | B1 |
7142856 | Barrow | Nov 2006 | B2 |
7188140 | Greenspan et al. | Mar 2007 | B1 |
RE39717 | Yates et al. | Jul 2007 | E |
7328242 | McCarthy et al. | Feb 2008 | B1 |
7337213 | Gusler et al. | Feb 2008 | B2 |
7359894 | Liebman et al. | Apr 2008 | B1 |
7689556 | Garg et al. | Mar 2010 | B2 |
7693901 | Ka et al. | Apr 2010 | B2 |
7698301 | Lourdeaux | Apr 2010 | B2 |
7720916 | Fisher et al. | May 2010 | B2 |
20020032634 | Abrams et al. | Mar 2002 | A1 |
20020052885 | Levy | May 2002 | A1 |
20020057284 | Dalby et al. | May 2002 | A1 |
20020091556 | Fiala et al. | Jul 2002 | A1 |
20020091667 | Jaipuria et al. | Jul 2002 | A1 |
20020091975 | Redlich et al. | Jul 2002 | A1 |
20020107721 | Darwent et al. | Aug 2002 | A1 |
20020116466 | Trevithick et al. | Aug 2002 | A1 |
20020124053 | Adams et al. | Sep 2002 | A1 |
20020169737 | Armstrong et al. | Nov 2002 | A1 |
20020178164 | Wisniewski et al. | Nov 2002 | A1 |
20030014482 | Toyota et al. | Jan 2003 | A1 |
20030028596 | Toyota et al. | Feb 2003 | A1 |
20030050976 | Block et al. | Mar 2003 | A1 |
20030050977 | Puthenkulam et al. | Mar 2003 | A1 |
20030055892 | Huitema et al. | Mar 2003 | A1 |
20030101449 | Bentolila et al. | May 2003 | A1 |
20030135576 | Bodin | Jul 2003 | A1 |
20030167324 | Farnham et al. | Sep 2003 | A1 |
20030171941 | Kraenzel et al. | Sep 2003 | A1 |
20030182421 | Faybishenko et al. | Sep 2003 | A1 |
20030185421 | Okamoto et al. | Oct 2003 | A1 |
20030200190 | Adar et al. | Oct 2003 | A1 |
20030212680 | Bates et al. | Nov 2003 | A1 |
20030220975 | Malik | Nov 2003 | A1 |
20030220980 | Crane | Nov 2003 | A1 |
20030234859 | Malzbender et al. | Dec 2003 | A1 |
20040003090 | Deeds | Jan 2004 | A1 |
20040015553 | Griffin et al. | Jan 2004 | A1 |
20040019846 | Castellani et al. | Jan 2004 | A1 |
20040024719 | Adar et al. | Feb 2004 | A1 |
20040024892 | Creswell et al. | Feb 2004 | A1 |
20040031058 | Reisman | Feb 2004 | A1 |
20040032393 | Brandenberg et al. | Feb 2004 | A1 |
20040044727 | Abdelaziz et al. | Mar 2004 | A1 |
20040044774 | Mangalik et al. | Mar 2004 | A1 |
20040059705 | Wittke et al. | Mar 2004 | A1 |
20040088325 | Elder et al. | May 2004 | A1 |
20040122696 | Beringer | Jun 2004 | A1 |
20040122803 | Dom et al. | Jun 2004 | A1 |
20040122822 | Thompson et al. | Jun 2004 | A1 |
20040122855 | Ruvolo et al. | Jun 2004 | A1 |
20040137882 | Forsyth | Jul 2004 | A1 |
20040148275 | Achliopias | Jul 2004 | A1 |
20040148503 | Sidman | Jul 2004 | A1 |
20040162871 | Pabla et al. | Aug 2004 | A1 |
20040205358 | Erickson | Oct 2004 | A1 |
20040215793 | Ryan et al. | Oct 2004 | A1 |
20040237045 | Meltzer | Nov 2004 | A1 |
20040249768 | Kontio et al. | Dec 2004 | A1 |
20040267625 | Feng et al. | Dec 2004 | A1 |
20050015357 | Shahidi | Jan 2005 | A1 |
20050031096 | Postrel | Feb 2005 | A1 |
20050044361 | Chang et al. | Feb 2005 | A1 |
20050052998 | Oliver et al. | Mar 2005 | A1 |
20050076365 | Popov et al. | Apr 2005 | A1 |
20050080655 | Sengir et al. | Apr 2005 | A1 |
20050086300 | Yeager et al. | Apr 2005 | A1 |
20050091289 | Shappell et al. | Apr 2005 | A1 |
20050091316 | Ponce et al. | Apr 2005 | A1 |
20050094313 | Kim | May 2005 | A1 |
20050097170 | Zhu et al. | May 2005 | A1 |
20050097320 | Golan et al. | May 2005 | A1 |
20050114783 | Szeto | May 2005 | A1 |
20050131762 | Bharat et al. | Jun 2005 | A1 |
20050138430 | Landsman | Jun 2005 | A1 |
20050149621 | Kirkland et al. | Jul 2005 | A1 |
20050159970 | Buyukkokten et al. | Jul 2005 | A1 |
20050165715 | Farnham et al. | Jul 2005 | A1 |
20050165726 | Kawell, Jr. et al. | Jul 2005 | A1 |
20050171799 | Hull et al. | Aug 2005 | A1 |
20050171832 | Hull et al. | Aug 2005 | A1 |
20050171954 | Hull et al. | Aug 2005 | A1 |
20050171955 | Hull et al. | Aug 2005 | A1 |
20050172001 | Zaner et al. | Aug 2005 | A1 |
20050172116 | Burch et al. | Aug 2005 | A1 |
20050177385 | Hull et al. | Aug 2005 | A1 |
20050177614 | Bourne | Aug 2005 | A1 |
20050197846 | Pezaris et al. | Sep 2005 | A1 |
20050198031 | Pezaris et al. | Sep 2005 | A1 |
20050198131 | Appelman et al. | Sep 2005 | A1 |
20050198172 | Appelman et al. | Sep 2005 | A1 |
20050198305 | Pezaris et al. | Sep 2005 | A1 |
20050201290 | Vasudev et al. | Sep 2005 | A1 |
20050203801 | Morgenstern et al. | Sep 2005 | A1 |
20050203892 | Wesley et al. | Sep 2005 | A1 |
20050207545 | Gao et al. | Sep 2005 | A1 |
20050209999 | Jou | Sep 2005 | A1 |
20050210104 | Torvinen | Sep 2005 | A1 |
20050210387 | Alagappan et al. | Sep 2005 | A1 |
20050210409 | Jou | Sep 2005 | A1 |
20050215660 | Tomikawa et al. | Sep 2005 | A1 |
20050216300 | Appelman et al. | Sep 2005 | A1 |
20050216550 | Paseman et al. | Sep 2005 | A1 |
20050226511 | Short | Oct 2005 | A1 |
20050232423 | Horvitz et al. | Oct 2005 | A1 |
20050234864 | Shapiro | Oct 2005 | A1 |
20050235062 | Lunt et al. | Oct 2005 | A1 |
20050243736 | Faloutsos et al. | Nov 2005 | A1 |
20050246420 | Little | Nov 2005 | A1 |
20050251553 | Gottfried | Nov 2005 | A1 |
20050256756 | Lam et al. | Nov 2005 | A1 |
20050256866 | Lu et al. | Nov 2005 | A1 |
20050256909 | Aboulhosn et al. | Nov 2005 | A1 |
20050262199 | Chen et al. | Nov 2005 | A1 |
20050262530 | Roetschi et al. | Nov 2005 | A1 |
20050266835 | Agrawal et al. | Dec 2005 | A1 |
20050267766 | Galbreath et al. | Dec 2005 | A1 |
20050267940 | Galbreath et al. | Dec 2005 | A1 |
20050268329 | Lee et al. | Dec 2005 | A1 |
20050283497 | Nurminen et al. | Dec 2005 | A1 |
20060004703 | Spivack et al. | Jan 2006 | A1 |
20060004789 | Lunt et al. | Jan 2006 | A1 |
20060004892 | Lunt et al. | Jan 2006 | A1 |
20060009994 | Hogg et al. | Jan 2006 | A1 |
20060015588 | Achlioptas et al. | Jan 2006 | A1 |
20060026235 | Schwarz et al. | Feb 2006 | A1 |
20060036641 | Brydon et al. | Feb 2006 | A1 |
20060036766 | Baupin et al. | Feb 2006 | A1 |
20060041543 | Achlioptas | Feb 2006 | A1 |
20060042483 | Work et al. | Mar 2006 | A1 |
20060048059 | Etkin | Mar 2006 | A1 |
20060053380 | Spataro et al. | Mar 2006 | A1 |
20060058025 | Barrow | Mar 2006 | A1 |
20060063552 | Tillet et al. | Mar 2006 | A1 |
20060064431 | Kishore et al. | Mar 2006 | A1 |
20060074863 | Kishore et al. | Apr 2006 | A1 |
20060075039 | Narayanaswami et al. | Apr 2006 | A1 |
20060079260 | Tillet et al. | Apr 2006 | A1 |
20060080432 | Spataro et al. | Apr 2006 | A1 |
20060085248 | Arnett et al. | Apr 2006 | A1 |
20060085818 | Bodlaender et al. | Apr 2006 | A1 |
20060090137 | Cheng et al. | Apr 2006 | A1 |
20060095514 | Wang et al. | May 2006 | A1 |
20060095976 | Torres et al. | May 2006 | A1 |
20060112111 | Tseng et al. | May 2006 | A1 |
20060117264 | Beaton et al. | Jun 2006 | A1 |
20060117378 | Tam et al. | Jun 2006 | A1 |
20060121987 | Bortnik et al. | Jun 2006 | A1 |
20060121988 | Reville et al. | Jun 2006 | A1 |
20060123127 | Littlefield | Jun 2006 | A1 |
20060136419 | Brydon et al. | Jun 2006 | A1 |
20060143067 | Calabria | Jun 2006 | A1 |
20060143068 | Calabria | Jun 2006 | A1 |
20060143183 | Goldberg et al. | Jun 2006 | A1 |
20060143236 | Wu | Jun 2006 | A1 |
20060146765 | Van De Sluis et al. | Jul 2006 | A1 |
20060155813 | Dietz et al. | Jul 2006 | A1 |
20060161553 | Woo | Jul 2006 | A1 |
20060168022 | Levin et al. | Jul 2006 | A1 |
20060173838 | Garg et al. | Aug 2006 | A1 |
20060173957 | Robinson et al. | Aug 2006 | A1 |
20060173963 | Roseway et al. | Aug 2006 | A1 |
20060173985 | Moore | Aug 2006 | A1 |
20060184464 | Tseng et al. | Aug 2006 | A1 |
20060184997 | La Rotonda et al. | Aug 2006 | A1 |
20060190281 | Kott et al. | Aug 2006 | A1 |
20060190524 | Bethke et al. | Aug 2006 | A1 |
20060190536 | Strong et al. | Aug 2006 | A1 |
20060195441 | Julia et al. | Aug 2006 | A1 |
20060195462 | Rogers | Aug 2006 | A1 |
20060200434 | Flinn et al. | Sep 2006 | A1 |
20060200435 | Flinn et al. | Sep 2006 | A1 |
20060209727 | Jennings et al. | Sep 2006 | A1 |
20060209797 | Anisimov et al. | Sep 2006 | A1 |
20060218153 | Voon et al. | Sep 2006 | A1 |
20060218225 | Hee Voon et al. | Sep 2006 | A1 |
20060218286 | Brombal et al. | Sep 2006 | A1 |
20060218577 | Goodman et al. | Sep 2006 | A1 |
20060242581 | Manion et al. | Oct 2006 | A1 |
20060248458 | Li | Nov 2006 | A1 |
20060248573 | Pannu et al. | Nov 2006 | A1 |
20060259982 | Upendran | Nov 2006 | A1 |
20060288041 | Plastina et al. | Dec 2006 | A1 |
20070028000 | Ebbesen et al. | Feb 2007 | A1 |
20070033263 | Goering et al. | Feb 2007 | A1 |
20070049335 | Haitani et al. | Mar 2007 | A1 |
20070106627 | Srivastava et al. | May 2007 | A1 |
20070156813 | Galvez et al. | Jul 2007 | A1 |
20070173325 | Shaw et al. | Jul 2007 | A1 |
20070179945 | Marston et al. | Aug 2007 | A1 |
20070192410 | Liversidge et al. | Aug 2007 | A1 |
20070192588 | Roskind et al. | Aug 2007 | A1 |
20070198506 | Attaran Rezaei et al. | Aug 2007 | A1 |
20070198648 | Allen et al. | Aug 2007 | A1 |
20070203828 | Jung et al. | Aug 2007 | A1 |
20070233828 | Gilbert | Oct 2007 | A1 |
20070244861 | Malandain et al. | Oct 2007 | A1 |
20070250641 | Flannery et al. | Oct 2007 | A1 |
20070266097 | Harik et al. | Nov 2007 | A1 |
20070282887 | Fischer et al. | Dec 2007 | A1 |
20080019353 | Foote | Jan 2008 | A1 |
20080040428 | Wei et al. | Feb 2008 | A1 |
20080046976 | Zuckerberg | Feb 2008 | A1 |
20080059992 | Amidon et al. | Mar 2008 | A1 |
20080065471 | Reynolds et al. | Mar 2008 | A1 |
20080086759 | Colson | Apr 2008 | A1 |
20080088698 | Patel et al. | Apr 2008 | A1 |
20080176646 | Kelly et al. | Jul 2008 | A1 |
20090030943 | Kall | Jan 2009 | A1 |
Number | Date | Country |
---|---|---|
1177056 | Jul 2001 | EP |
1 338 966 | Aug 2003 | EP |
1675060 | Jun 2006 | EP |
WO 2006036165 | Apr 2006 | WO |
WO 2006041425 | Apr 2006 | WO |
Entry |
---|
No Author, “pidgin,” (website), obtained Jul. 13, 2007, 1 page, http://pidgin.im/. |
No Author, “Dijkstra's algorithm,” (website), obtained Apr. 10, 2008, 4 pages, http://en.wikipedia.org/wiki/Dijkstra's—algorithm. |
No Author, “News—Gaim 1.5.0,” (website), obtained Sep. 6, 2007, 3 pages, http://www.gaim.sourceforge.net. |
No Author, “The Friend of a Fried (FOAF) Project,” (website), date unknown, 1 page, http://www.foaf-project.com. |
No Author, “Huminity—Social Networking,” (website), obtained Feb. 8, 2007, 1 page, http://www.huminity.com/english/software.html. |
Warren Sack, “Discourse Diagrams: Interface Design for Very Large-Scale Conversations,” (article), 2000, 10 pages. |
Marc A. Smith et al., “Visualization Components for Persistent Conversations,” (article), Sep. 2000, 8 pages. |
No Author, “FOAF Vocabulary Specification,” (website), obtained Feb. 20, 2007, 42 pages, http://xmlns.com/foaf/0.1/. |
Home page for www.myspace.com (accessed Jul. 13, 2007)—1 page. |
Home page for www.facebook.com (accessed Jul. 13, 2007)—1 page. |
Homepage for www.friendster.com (accessed Jul. 13, 2007)—1 page. |
Definition of Centrality as per Wikipedia (accessed Sep. 13, 2007). |
Definition of Eigenvector Centrality as per Wikipedia (accessed Sep. 13, 2007). |
“The Mathematics of Networks” by M.E.J. Neman, in The New Palgrave Encyclopedia of Economics, 2nd edition. |
Kagal, L. et al., “Developing Secure Agent Systems Using Delegation Based Trust Management,” Jul. 16, 2002, 8 pages. |
No Author, “Semantic Web Trust and Security Resource Guide,” accessed Aug. 7, 2007, http://sites.wiwiss.fu-berlin.de/suhl/bizer/SWTSGuide/, 13 pages. |
Golbeck, J., “Papers and Talks—Trust in Web-based Social Networks,” accessed Aug. 7, 2007, http://trust.mindswap.org/papers.shtml, 9 pages. |
Vitiello, Jr., E., “trust—A module for defining trust relationships in FOAF,” Jul. 22, 2002, updated Nov. 19, 2002, http://www.perceive.net/schemas/20021119/trust/default.htm, 2 pages. |