The invention generally relates to social networks. More particularly, the invention relates to methods and systems for providing current email addresses and contact information for members within a social network.
Conventional web email systems such as those hosted on Yahoo!™, Hotmail™ or other web sites, facilitate communication between people. These conventional websites generally do not provide a central repository for maintaining current email addresses for members within a social network. Similarly, conventional email client systems such as Outlook™ encounter similar problems in that the email addresses stored in a user's address book or contact list are not always current. In addition to email addresses, electronic address books typically do not maintain current contact information.
Typically, a user must physically enter contact information for each contact in a user's address book or contact list. Recently, V-cards have helped in reducing the actual typing required to enter a new contact into the user's address book or contact list. Unfortunately, contact information including email addresses is not static, thus a user must update his or her address book or contact list whenever a contact changes his or her contact information. However, in order to maintain current contact information, the user must be aware of the changes.
Embodiments of the present invention comprise systems and methods for providing current email addresses and contact information for members of a social network. One aspect of an embodiment of the present invention comprises receiving a request for an email address of a first member of a social network, the request comprising an entity identifier associated with the first member; determining an email address for the first member using profile information associated with the first member, returning the email address in response to the request; and inserting the email address into a sending parameter of an email message.
Another exemplary method of one embodiment of the present invention comprises receiving a request for contact information associated with a first member of a social network, the request comprising a first entity identifier associated with the first member and a second entity identifier associated with the requester of the contact information, determining if the requester is authorized to receive the contact information using profile information associated with the first member, sending the contact information to the requester if authorized, comparing the sent contact information with the contact information for the first member in an address book associated with the requester, and replacing differing contact information associated with the first member in the address book with the corresponding sent contact information.
These exemplary embodiments are mentioned not to limit or define the invention, but to provide examples of embodiments of the invention to aid understanding thereof. Exemplary embodiments are discussed in the Detailed Description, and further description of the invention is provided there. Advantages offered by the various embodiments of the present invention may be further understood by examining this specification.
These and other features, aspects, and advantages of the present invention are better understood when the following Detailed Description is read with reference to the accompanying drawings, wherein:
Embodiments of the present invention comprise systems and methods for providing current email addresses and contact information for members within a social network. A social network can refer to a computer network connecting people or organizations by a set of social relationships, such as friendship, co-working, or information exchange. Examples of a social network can include Orkut™, Friendster™, and Tribe™. In one embodiment, using an email program application on a client device or an email program application accessible via a browser program application on a client device, e.g., a laptop computer, a user can enter an entity identifier into the sending parameter of an email message. The entity identifier attempts to identify an intended recipient of the email message, e.g., a member of a social network. Entering the entity identifier triggers the email program application to send a request for an email address to a directory application. The directory application receives the request and parses out the entity identifier from the request. The directory application uses the entity identifier to identify a member of the social network. If there are multiple members identified with the entity identifier, the directory application can prompt the user to select the appropriate member. For example, if the user entered “smith” as the intended recipient of the email message, the directory application can prompt the user to select the proper “smith,” e.g., “John Smith, Frank Smith, Robert Smith?” Once the member is identified, the directory application obtains the email address from the user profile associated with identified member. The directory application then outputs the email address to the email program application associated with the user who caused the request for email address to be sent. The email message is then sent to the email address provided by the directory application. Thus, a member of the social network can maintain his or her current email address in his or her user profile. By maintaining a current email address in the user profile, a member can ensure that he or she receives email messages regardless of whether the sender has the member's current address.
In another embodiment, current contact information for a member of a social network can be provided to a user who requests such information. For example, using an email program application on a client device or an email program application accessible via a browser program application on a client device, e.g., a laptop computer, a user can trigger the sending of a request for the contact information of a member of a social network. For example, by clicking on the member's name in the address directory, the email program application can request the contact information for the member of a social network. The request can comprise a second entity identifier identifying the requester of the contact information and a first entity identifier identifying the contact, e.g., a member in a social network. The request is sent to a directory application which identifies the requester and the contact. Using the user profile associated with the contact, the directory application determines the relationship between the requester and the contact and determines if such a relationship permits the contact information associated with the contact to be released. For example, if the user profile associated with the contact indicates that all friends and business acquaintances can receive his or her contact information and if the requester and the contact have such a relationship as indicated in the user profile, then the contact information can be sent to the requester. If the user profile indicates that the relationship between the requester and contact is not an authorized relationship to receive such information, then the contact information is not sent to the requester. If authorized, the directory application sends the contact information associated with the contact to the requester. The email program application receives the information and can compare the contact information from the directory application with the contact information stored in the address directory. The email program application can replace any differing information with the contact information from the directory application. By maintaining current contact information and authorization information in his or her own profile, a member can control who can receive such contact information.
This introduction is given to introduce the reader to the general subject matter of the application. By no means is the invention limited to such subject matter. Exemplary embodiments are described below.
Various systems in accordance with the present invention may be constructed.
Referring now to the drawings in which like numerals indicate like elements throughout the several figures,
The client devices 102a-n shown each comprises a computer-readable medium, such as a random access memory (RAM) 112 coupled to a processor 110. The processor 110 executes computer-executable program instructions stored in memory 112. Such processors may comprise a microprocessor, an ASIC, and state machines. Such processors comprise, or may be in communication with, media, for example computer-readable media, which stores instructions that, when executed by the processor, cause the processor to perform the steps described herein. Embodiments of computer-readable media include, but are not limited to, an electronic, optical, magnetic, or other storage or transmission device capable of providing a processor, such as the processor 110 of client 102a, with computer-readable instructions. Other examples of suitable media include, but are not limited to, a floppy disk, CD-ROM, DVD, magnetic disk, memory chip, ROM, RAM, an ASIC, a configured processor, all optical media, all magnetic tape or other magnetic media, or any other suitable medium from which a computer processor can read instructions. Also, various other forms of computer-readable media may transmit or carry instructions to a computer, including a router, private or public network, or other transmission device or channel, both wired and wireless. The instructions may comprise code from any suitable computer-programming language, including, for example, C, C++, C#, Visual Basic, Java, Python, Perl, and JavaScript.
Client devices 102a-n may also comprise a number of external or internal devices such as a mouse, a CD-ROM, DVD, a keyboard, a display, or other input or output devices. Examples of client devices 102a-n are personal computers, digital assistants, personal digital assistants, cellular phones, mobile phones, smart phones, pagers, digital tablets, laptop computers, Internet appliances, and other processor-based devices. In general, a client device 102a may be any suitable type of processor-based platform that is connected to a network 106 and that interacts with one or more application programs. Client devices 102a-n may operate on any suitable operating system, such as Microsoft® Windows® or Linux. The client devices 102a-n may also support a browser or browser-enabled application program, such as Microsoft Corporation's Internet Explorer™, Netscape Communication Corporation's Netscape Navigator™, and Apple Computer, Inc.'s Safari™. The client devices 102a-n can also include an email program application 114 to allow the users 112a-n to communicate with each other. Examples of email program applications 114 include stand alone email clients such as Microsoft Corporation's Outlook™ or Qualcomm Enterprises' Eudora™, or email program application accessible via a browser program application on a client device 102. Examples of email program application accessible via a browser program application on a client device 102 can include Web page clients such as Microsoft Corporation's Hotmail™ or Google's Gmail™, or an email reader such as AOL™ as well as other email clients as known in the art.
Through the client devices 102a-n, users 112a-n can communicate over the network 106 with each other and with other systems and devices coupled to the network 106. For example, using an email program application 114 on a client device 102a or a web-based email program application on a server device (not shown) accessible via a browser program application on a client device 102a, a user 112a can send a request for the current email address or contact information for a member in a social network. As shown in
The server device 104 shown comprises a server executing a social network engine application program. Similar to the client devices 102a-n, the server devices 104 shown comprises a processor 116 coupled to a computer-readable medium, such as a random access memory (RAM) 118. The server device 104 is in communication with a social network database 130. Server device 104, depicted as a single computer system, may be implemented as a network of computer processors. Examples of a server device 104 are servers, mainframe computers, networked computers, a processor-based device, and similar types of systems and devices. Client processor 110 and the server processor 116 can be any of suitable number of computer processors, such as processors from Intel Corporation of Santa Clara, Calif. and Motorola Corporation of Schaumburg, Ill.
Memory 118 contains a social network engine application program, also known as a social network engine 120. The social network engine 120 allows users or members, such as user 112a, to interact with and participate in a social network. A social network can comprise profiles that can be associated with other profiles. Each profile may represent a member and a member can be, for example, a person, an organization, a business, a corporation, a community, a fictitious person, or other entity. Each profile can contain entries, and each entry can comprise information associated with a profile. Other examples of entries for a person profile can comprise information regarding relationship status, birth date, age, children, ethnicity, religion, political view, sense of humor, sexual orientation, fashion preferences, smoking habits, drinking habits, pets, hometown location, passions, sports, activities, favorite books, music, TV, or movie preferences, favorite cuisines, location information, IM name, phone number, residential address, mailing address, skills, career, or any other information describing, associated with, or otherwise associated with a profile. A profile can contain contact information associated with a member, such as, home telephone number, cell telephone number, home address, personal email address, etc. Similarly, a profile can contain business contact information associated with a members, such as, work telephone number, work address, business email address. A business profile can comprise such information as market sector, customer base, location, supplier information, net profits, net worth, number of employees, stock performance, website, business address, mailing address, telephone number, or other types of information associated with the business profile. Typically a member may also include a representative image(s), audio/video or other multimedia information, etc. Additionally, entries within a profile can comprise associations with other profiles. Associations between profiles within a social network can include, for example, friendships, business relationships, acquaintances, community associations, activity partner associations, common interest associations, common characteristic associations, or any other suitable type of association between profiles. Such associations may be direct (i.e., without intermediary associations) or indirect (i.e., having intermediary associations).
Server device 104 also provides access to storage elements, such as a social network storage element, in the example shown in
The server device 108 shown can be a directory server, e.g., a server executing a directory application or protocol 144, e.g., a Lightweight Directory Access Protocol (LDAP). The directory application 144 can respond to requests for the current email address or current contact information sent from the email program application 114 or web-based email program application. Similar to the client devices 102a-n, the server device 108 shown comprises a processor 140 coupled to a computer-readable memory 142. Server device 108, depicted as a single computer system, may be implemented as a network of computer processors. Examples of a server device 108 are servers, mainframe computers, networked computers, a processor-based device, and similar types of systems and devices. Server processor 140 can be any of a number of computer processors, such as processors from Intel Corporation of Santa Clara, Calif. and Motorola Corporation of Schaumburg, Ill.
Memory 142 can contain the directory application or protocol 144, e.g., LDAP. The directory application 144 can manage information related to members or users 112a-n within the social network. The directory application 144 can act as a gateway or central repository for information associated with the members or users 112a-n within a social network. In one embodiment, the profiles 132 for each member 112 are stored within the memory 142 of server device 108. In other embodiments, partial profiles or profile information are stored within the memory 142. For example, a member's name and email address; a member's contact information; a member's email address, relationships, and authorization can be stored in the memory 118. In other embodiments, the directory application 144 acts as a gateway to the social network engine 120 and obtains the necessary profile information from the social network database 130 and profiles 132 as needed. As described below, the directory application 144 can respond to lookup requests from the email application 114 or web-based email application with information associated with members 112a-n within the social network, e.g. profile information. In one embodiment, the directory application 144 provides the current email address of a member 112 within the social network to a client device 102 in response to an email address request. In another embodiment, the directory application 144 provides the current contact information of a member 112 within the social network to a client device 102 in response to a request for contact information.
It should be noted that the present invention may comprise systems having different architecture than that which is shown in
For example, edge 220 and edge 222 each comprise an association between profile A at vertex 202 and Profile D at vertex 208. The edge 220 represents a business association, and the edge 222 represents a friendship association. Profile A is also associated with profile E by a common characteristic association comprising edge 218. The association between profile A and profile E may be more attenuated than the association between profile A and D, but the association can still be represented by the social network depicted in
Each member represented by the profiles A-F comprising the vertices 202-212, for purposes of illustration is a person. Other types of members can be in social network 200. The associations 218-234 illustrated in
Other embodiments of the present invention may comprise directed associations or other types of associations. Directed associations associate a first profile with a second profile while not requiring the second profile to be associated with the first profile. For example, in a directed chart, profile A can be associated by a friendship association with profile B, and profile B can be unassociated by a friendship connection with profile A. Thus a display of profile A's friends would include profile B, but a display of profile B's friends would not include profile A.
Within a social network, a degree of separation can be determined for associated profiles. One method of determining a degree of separation is to determine the fewest number of edges of a certain type separating the associated profiles. This method of determining a degree of separation can produce a type-specific degree of separation. A type-specific degree of separation is a degree of separation determined based on one particular type of association. For example, a profile A has a friend association degree of separation of two from profile E. The fewest number of friendship associations between profile A and profile E is two—the friendship association comprising edge 220 and the friendship association comprising edge 234. Thus, for the associated profiles A and E, the degree of friendship separation, determined according to one aspect of one embodiment of the present invention, is two.
Another type-specific degree of separation can also be determined for profiles A and E. For example, a common characteristic degree of separation can be determined by determining the fewest number of common characteristic associations separating profile A and profile E. According to the embodiment depicted in
According to other aspects of certain embodiments of the present invention, the degree of separation may be determined by use of a weighting factor assigned to each association. For example, “best” friends can be weighted higher than “haven't met” friends. According to certain aspects of embodiments using a weighting factor, a higher weighting factor for an association can reduce the degree of separation between profiles and lower weighting factors can increase the degree of separation. This can be accomplished, for example, by establishing an inverse relationship between each associations and a corresponding weighting factor prior to summing the associations. Thus, highly weighted associations would contribute less to the resulting sum than lower weighted associations.
Various methods in accordance with the present invention may be constructed. For example, in one embodiment, the method begins with receiving a request for an email address for a first member in a social network. The request comprises an entity identifier associated with the first member. After receiving the request, the entity identifier is parsed from the request and the corresponding email address is obtained using profile information associated with the entity identifier. The email address is then sent to the requester where the email address is entered into the send-to parameter of an email message.
In another embodiment, the method begins with receiving a request for contact information associated with a first member in a social network. The request comprises an entity identifier associated with the first member, e.g., a contact. After receiving the request, the relationship between the contact and the sender of the request, e.g., a requester, is determined using profile information associated with the contact and a determination is made whether the relationship between the contact and the requester is an authorized relationship. If the requester is authorized to receive the contact information, then the contact information is sent to the requester. The sent contact information is then compared with the contact information for the contact stored in the requester's address book. If the information differs, then the differing contact information in the address book is replaced with the sent contact information.
The method 300 begins in block 302 when a user enters an entity identifier associated with a member of a social network into a sending parameter of an email message. For example, using an email program application 114 on a client device 102a or a web-based email program application accessible via a browser program application on a client device 102a, a user 112a types in a name of an entity identifier, e.g., an intended recipient of an email message, into “to” or “send-to” parameter of an email message. The entity identifier can take various forms depending on the email program application, with each entity identifier attempting to identify an intended recipient of the email message. For example, each entity identifier can be a name, first and last name, nickname, partial name, a first initial with the last name, an entity, an email address, an emailing group name, a group name, etc.
At block 304, an email address request comprising the at least one entity identifier is sent to the directory application 144. For example, the email program application (client or web-based) sends the email address request to the directory application 144 in response to a triggering event. Examples of triggering events can be using a send button, using function or function short keys to cause the triggering, e.g., simultaneously hitting the control key and “k” key in Microsoft Outlook™, clicking out of or exiting from the send-to parameter field, expiration of time, or other known triggers as known in the art. The email address request can also include an entity identifier associated with the requester 112a who causes the email address request to be sent.
Depending on the configuration of the email program application, the email program application can access one or more name exchange servers or directories, e.g., a local name exchange server, prior to causing the email address request being sent to the directory application 144. For example, the email program application can automatically replace the entity identifier with the name (typically, last name, first name) of each intended recipient associated with the entity identifier or can provide a list of potential recipients to the user who can select the intended recipient. In one embodiment, if the entity identifier is a group email name, the email program application can replace the entity identifier with an entity identifier for each user in the group email name.
Returning to
Similarly, if more than one email address is associated with an entity identifier, then the directory application 144 can cause a prompt to be sent to the requester to select an email address associated with the entity identifier. Alternatively, if more than one email address is associated with an entity identifier, then the appropriate email address can be selected based on the relationship between the intended recipient and the sender of the email address request. For example, if the profile associated with the intended recipient of an email message indicates that the sender of the email address request is a friend of the intended recipient, then the private email address of the intended recipient can be provided. Similarly, if the profile indicates that the sender of the email address request is a business acquaintance of the intended recipient of the email message, then a business email address of the intended recipient can be provided. In instances, where the profile indicates that the intended recipient and the sender of the email address request have multiple relationships, then the sender of the email address request can be provided with a list of the appropriate email addresses associated with the intended recipient. Then the directory application 144 can prompt the sender of the email address request to select one or more of the email addresses.
Since the directory application 144 does not need a member's entire profile, the server device 108 does not have to store entire profiles in memory 142 or obtain entire profiles 132 from the social network database 130. In one embodiment, the profile information stored in the memory 142 on the server device 108 can be limited. For example, the profile information in the memory 142 can include the member's name and email address for each member. In one embodiment, the directory application 144 accesses the social network database for all requested profile information. Regardless of how much profile information is stored in the memory 142, the profile information should match with the profile information stored in the social network database 130. Since a member of the social network can update his or her profile at any time, the member controls whether his or her email address is current.
Returning to
The method 400 illustrated in
After receiving the contact request, the method 400 proceeds to block 404, wherein the requester and contact are identified. For example, the directory application 144 parses the entity identifiers from the request to identify the requester and contact. If more than one contact are associated with an entity identifier then the directory application 144 can cause the requester to be prompted to identify the contact as discussed above with respect to method 300.
After identifying the requester and contact, the method 400 proceeds to block 406, wherein the relationship between the requester and contact is determined. To determine the relationship between the requester and the contact, the directory application 144 uses the profile information associated with the contact to determine what relationships, if any, exist between the contact and requester, e.g., whether the user profile lists any relationship between the requester and contact. Exemplary relationships can include none, friends, friends of friends, business associations, and other relationships known in the art. Relationships can also have varying levels, such as, for example, haven't met, acquaintance, friend, good friend, and best friend.
After determining the relationship between the requester and contact, the method proceeds to block 408, wherein a determination is made as to whether the identified relationship is authorized to receive the contact information and the type of contact information that can be received. For example, using the profile information, the directory application 144 determines the type of relationships that are authorized to receive contact information associated with the contact, such as friends, friends of friends, or all. An authorized relationship can also be based on an email address domain name, e.g., “@google.com”, where the contact request is granted based on an approved domain name. Similarly, a member of the social network can designate the type of contact information he or she is willing to provide to others. This designation can be part of the profile associated with the member. For example, a member can designate that only friends can receive the member's cell phone number and only business acquaintances can receive the member's business telephone number.
Since the directory application 144 does not need a member's entire profile, the server device 108 does not have to store entire profiles in memory 142 or obtain entire profiles from the social network database 130. In one embodiment, the memory 142 on the server device 108 can be limited, e.g., profile information which can include the member's relationship, authorization and contact information. In one embodiment, the directory application 144 accesses the social network database for all requested profile information. Regardless of how much profile information is stored in memory 142, the profile information should match with the profile information stored in the social network database 130. Since a member of the social network can update his or her profile at any time, a member can ensure that his or her contact information is current.
Returning to
After sending or outputting the contact information, the method 400 proceeds to block 412 where the contact information from the directory application 144, e.g., the sent contact information, is compared with the contact information in the address book, e.g., an electronic address book, with differing information being replaced with the contact information from the directory application 144. For example, the email program application receives the contact information from the directory application 144 and compares the two sets of contact information. The email program application can replace the differing contact information in the address book with the corresponding contact information from the directory application 144. In one embodiment, the replacement of the differing information is automatic. In another embodiment, the requester can be prompted to replace the differing contact information.
Thus, a member can help to maintain his or her contact information in other member's address books without having the other members physically enter the changes. If a member is in the process of changing jobs, the member can change the contact information in his or her profile and provide the updated information when someone sends a contact request. In addition, a member can determine which members can receive his or her contact information, as well as the specific contact information that can be provided, based on one or more authorization parameters within his or her profile.
Although the exemplary methods 300, 400 are described with the intended recipient of the email message and the contact, being members of a social network, the sender of the email address request and/or the sender of the contact request can be members of the same social network or can be members of a different social network than the intended recipient and/or contact. In another embodiment, the sender of the email address request and/or the sender of the contact request do not have to belong to any social networks. The exemplary methods 300, 400 are described with requests with single entity identifiers, however the requests can contain multiple entity identifiers for obtaining information for multiple members.
The foregoing description of the preferred embodiments of the invention has been presented only for the purpose of illustration and description and is not intended to be exhaustive or to limit the invention to the precise forms disclosed. Numerous modifications and adaptations thereof will be apparent to those skilled in the art without departing from the spirit and scope of the present invention.
Number | Name | Date | Kind |
---|---|---|---|
5287498 | Perelman et al. | Feb 1994 | A |
5537586 | Amram et al. | Jul 1996 | A |
5796393 | MacNaughton et al. | Aug 1998 | A |
5950200 | Sudai et al. | Sep 1999 | A |
5963951 | Collins | Oct 1999 | A |
6041311 | Chislenko et al. | Mar 2000 | A |
6052122 | Sutcliffe et al. | Apr 2000 | A |
6061681 | Collins | May 2000 | A |
6073105 | Sutcliffe et al. | Jun 2000 | A |
6073138 | de l'Etraz et al. | Jun 2000 | A |
6073141 | Salazar | Jun 2000 | A |
6092049 | Chislenko et al. | Jul 2000 | A |
6130938 | Erb | Oct 2000 | A |
6192119 | Wilson | Feb 2001 | B1 |
6256648 | Hill | Jul 2001 | B1 |
6327590 | Chidlovskii et al. | Dec 2001 | B1 |
6366962 | Teibel | Apr 2002 | B1 |
6389372 | Glance et al. | May 2002 | B1 |
6421678 | Smiga et al. | Jul 2002 | B2 |
6442567 | Retallick et al. | Aug 2002 | B1 |
6594673 | Smith et al. | Jul 2003 | B1 |
6658423 | Pugh et al. | Dec 2003 | B1 |
6665715 | Houri | Dec 2003 | B1 |
6678681 | Brin | Jan 2004 | B1 |
6697478 | Meldrum et al. | Feb 2004 | B1 |
6754322 | Bushnell | Jun 2004 | B1 |
6782425 | Germscheid et al. | Aug 2004 | B1 |
6799176 | Page | Sep 2004 | B1 |
6834195 | Brandenberg et al. | Dec 2004 | B2 |
6837436 | Swartz et al. | Jan 2005 | B2 |
6865546 | Song | Mar 2005 | B1 |
6867733 | Sandhu et al. | Mar 2005 | B2 |
6871186 | Tuzhilin et al. | Mar 2005 | B1 |
6912505 | Linden et al. | Jun 2005 | B2 |
7013292 | Hsu et al. | Mar 2006 | B1 |
7069308 | Abrams | Jun 2006 | B2 |
7080117 | De Pinto et al. | Jul 2006 | B2 |
7092821 | Mizrahi et al. | Aug 2006 | B2 |
7106848 | Barlow et al. | Sep 2006 | B1 |
7113917 | Jacobi et al. | Sep 2006 | B2 |
7117254 | Lunt et al. | Oct 2006 | B2 |
7155608 | Malik et al. | Dec 2006 | B1 |
7177904 | Mathur et al. | Feb 2007 | B1 |
7225249 | Barry | May 2007 | B1 |
7269590 | Hull | Sep 2007 | B2 |
7356490 | Jacobi et al. | Apr 2008 | B1 |
7366990 | Pitroda | Apr 2008 | B2 |
7383258 | Harik | Jun 2008 | B2 |
7418268 | Cabano et al. | Aug 2008 | B1 |
7433832 | Bezos et al. | Oct 2008 | B1 |
7433876 | Spivack et al. | Oct 2008 | B2 |
7440746 | Swan | Oct 2008 | B1 |
7478078 | Lunt | Jan 2009 | B2 |
7555110 | Dolan et al. | Jun 2009 | B2 |
7610287 | Dean et al. | Oct 2009 | B1 |
7742468 | Vagelos | Jun 2010 | B2 |
20010011247 | O'Flaherty et al. | Aug 2001 | A1 |
20020023230 | Bolnick et al. | Feb 2002 | A1 |
20020059130 | Cheng et al. | May 2002 | A1 |
20020059201 | Work | May 2002 | A1 |
20020103682 | Stemmer | Aug 2002 | A1 |
20020124053 | Adams et al. | Sep 2002 | A1 |
20020137490 | Gallant | Sep 2002 | A1 |
20020143874 | Marquette et al. | Oct 2002 | A1 |
20020169835 | Paul, Jr. et al. | Nov 2002 | A1 |
20020174073 | Nordman et al. | Nov 2002 | A1 |
20030020977 | Smith et al. | Jan 2003 | A1 |
20030050977 | Puthenkulam et al. | Mar 2003 | A1 |
20030063072 | Brandenberg et al. | Apr 2003 | A1 |
20030069749 | Shear et al. | Apr 2003 | A1 |
20030083898 | Wick | May 2003 | A1 |
20030101227 | Fink | May 2003 | A1 |
20030217151 | Roese et al. | Nov 2003 | A1 |
20040093224 | Vanska | May 2004 | A1 |
20040093317 | Swan | May 2004 | A1 |
20040122681 | Ruvolo et al. | Jun 2004 | A1 |
20040122803 | Dom et al. | Jun 2004 | A1 |
20040148275 | Achlioptas | Jul 2004 | A1 |
20040153512 | Friend | Aug 2004 | A1 |
20040162830 | Shirwadkar | Aug 2004 | A1 |
20040172378 | Shanahan | Sep 2004 | A1 |
20040193684 | Ben Yoseph | Sep 2004 | A1 |
20040215793 | Ryan et al. | Oct 2004 | A1 |
20040249811 | Shostack | Dec 2004 | A1 |
20040258220 | Levine et al. | Dec 2004 | A1 |
20040260781 | Shostack | Dec 2004 | A1 |
20050015432 | Cohen | Jan 2005 | A1 |
20050015457 | Warasawa | Jan 2005 | A1 |
20050021750 | Abrams | Jan 2005 | A1 |
20050050158 | Solari | Mar 2005 | A1 |
20050071741 | Acharya et al. | Mar 2005 | A1 |
20050105697 | Hollowell et al. | May 2005 | A1 |
20050120084 | Hu et al. | Jun 2005 | A1 |
20050152521 | Liljestrand | Jul 2005 | A1 |
20050165785 | Malkin et al. | Jul 2005 | A1 |
20050171832 | Hull | Aug 2005 | A1 |
20050171954 | Hull et al. | Aug 2005 | A1 |
20050177385 | Hull et al. | Aug 2005 | A1 |
20050177599 | Goodman | Aug 2005 | A1 |
20050193054 | Wilson et al. | Sep 2005 | A1 |
20050198031 | Pezaris et al. | Sep 2005 | A1 |
20050209999 | Jou | Sep 2005 | A1 |
20050210409 | Jou | Sep 2005 | A1 |
20050216300 | Appelman et al. | Sep 2005 | A1 |
20050216550 | Paseman et al. | Sep 2005 | A1 |
20050246420 | Little | Nov 2005 | A1 |
20050267766 | Galbreath et al. | Dec 2005 | A1 |
20050267940 | Galbreath et al. | Dec 2005 | A1 |
20060026288 | Acharya et al. | Feb 2006 | A1 |
20060077957 | Reddy et al. | Apr 2006 | A1 |
20060136419 | Brydon et al. | Jun 2006 | A1 |
20060184997 | La Rotonda et al. | Aug 2006 | A1 |
20060206604 | O'Neil et al. | Sep 2006 | A1 |
20070127631 | Difiglia | Jun 2007 | A1 |
20070171898 | Salva | Jul 2007 | A1 |
20070173236 | Vishwanathan et al. | Jul 2007 | A1 |
20070233736 | Xiong | Oct 2007 | A1 |
20070248077 | Mahle, Jr. et al. | Oct 2007 | A1 |
20080004941 | Calabria | Jan 2008 | A1 |
20080056475 | Brannick et al. | Mar 2008 | A1 |
20080133716 | Rao et al. | Jun 2008 | A1 |
20080192656 | Vagelos | Aug 2008 | A1 |
20090013386 | Puthenkulam et al. | Jan 2009 | A1 |
20110098156 | Ng et al. | Apr 2011 | A1 |
Number | Date | Country |
---|---|---|
1949220 | Apr 2007 | CN |
1288795 | Mar 2003 | EP |
11265369 | Sep 1999 | JP |
WO 0068860 | Nov 2000 | WO |
WO 0124551 | Apr 2001 | WO |
WO02079984 | Oct 2002 | WO |
WO 2005015470 | Feb 2005 | WO |
Entry |
---|
PCT International Search Report and Written Opinion, PCT/US06/09562, Jun. 17, 2008, 7 pages. |
Adamic, L., et al., “A Social Network Caught in the Web,” First Monday, Jun. 2003, 29 Pages, vol. 8, No. 6, [online] [Retrieved on Jul. 28, 2004] Retrieved from the internet <URL:http://firstmonday.org/issues/issue8—6/adamic/>. |
Sullivan, D., “Is it Really Personalized Search?” Search Engine Watch, Retrieved from the internet on May 13, 2004, 5 pages. |
Doctorow, C., “Running Notes from Revenge of the User,” Revenge of the User: Lessons from Creator/User Battles at the O'Reilly Emerging Technology Conference, Feb. 11, 2004, 5 pages, [online] Retrieved on Jul. 28, 2004] Retrieved from the internet <URL:http://craphound.com/danahetcon04.txt>. |
“About Multiply,” Multiply, 2004, 2 pages, [online] Retrieved on May 3, 2004] Retrieved from the internet <URL:http://multiply.com/info/about>. |
“Help,” Multiply, 2004, 2 pages, [online] Retrieved on May 3, 2004] Retrieved from the internet <URL:http://multiply.com/info/help>. |
“Multiply Private Policy,” Multiply, 2004, 4 pages, [online] Retrieved on May 3, 2004] Retrieved from the internet <URL:http://multiply.com/info/privacy>. |
“Multiply Terms of Service,” Multiply, 2004, 6 pages, [online] Retrieved on May 3, 2004] Retrieved from the internet <URL:http://multiply.com/info/tos>. |
Felicite.com, Wedding Registry & Gift Registry, Internet Archive Wayback Machine archived on May 30, 2003, 17 Pages, [online] [Retrieved on Feb. 2, 2007] Retrieved from the internet <URL:http://web.archive.org/web/20030530051929lhttp://www.felicite.com>. |
“PlanetAll,” From Internet Archive Wayback Machine, Nov. 1997, 19 pages, [online] [Retrieved on Mar. 17, 2004] Retrieved from the internet <URL: Internet Archive Wayback Machine: www.archive.org/www/planetall.com>. |
Target, “Targetcom Wish List,” 2 pages, [online] [Retrieved on Aug. 4, 2004] Retrieved from the internet <URL:http://www.target.com/gp/registry.html/ref=nav—t—gc/601-19177590687329?%5Fencoding=UTF8&type=wishlist>. |
Balabanovic, M., et al., “Content-Based, Collaborative Recommendation,” Mar. 1997, pp. 66-72, vol. 40, No. 3. |
Choi, J., “Netflix Prize for the best collaborative filtering algorithm,” Data mining and parallelization, CGL Blog, Jul. 16, 2008, [online] [Retrieved on May 13, 2009] Retrieved from the internet <URL: http://jychoi-report-cgl.blogspot.com/2008/07/netflix-prize-for-best-collaborative.html>. |
Glance, N., et al., “Knowledge Pump: Supporting the Flow and Use of Knowledge,” Information Technology for Knowledge Management, 1998, 22 Pages. |
Jensen, C., et al., “Finding Others Online: Reputation Systems for Social Online Spaces,” Group Spaces, CHI 2002, Apr. 20-25, 2002, pp. 447-454, vol. 4, Iss. 1. |
Kautz, H., et al., “ReferralWeb: Combining Social Networks and Collaborative Filtering,” Communications of the ACM, Mar. 1997, 4 Pages, vol. 40, No. 3. |
Lueg, C., “Considering Collaborative Filtering as Groupware: Experiences and Lessons Learned,” Proceedings of the Second International Conference of Practical Aspects of Knowledge Management, 1998, pp. 16-1-16-6. |
Resnick, P., et al., “Recommender Systems,” Communications of the ACM, Mar. 1997, pp. 56-58, vol. 40, No. 3. |
Rucker, J., et al., “Personalized Navigation for the Web,” Communications of the ACM, Mar. 1997, pp. 73-75, vol. 40, No. 3. |
“Collaborative filtering,” Wikipedia, Last modified Oct. 17, 2007, [online] [Retrieved on May 13, 2009] Retrieved from the internet <URL:http://web.archive.org/web/20071020061658/http/en.wikipedia.org/wiki/Collaborative—filtering>. |
“Mufin.com: content-based recommendations,” Net, Blogs and Rock‘n’Roll, Oct. 8, 2008, [online] [Retrieved on May 13, 2009] Retrieved from the internet <URL: http://www.netblogsrocknroll.com/2008/10/mufin-music-fin.html>. |
“Recommender system,” Wikipedia, Last modified Jul. 27, 2009, [online] [Retrieved on Aug. 6, 2009] Retrieved from the internet <URL:http://en.wikipedia.org/wiki/Recommendation—system>. |
Office Action for Canada Patent Application No. 2,603,364, Aug. 3, 2010, 9 Pages. |
Office Action for Canada Patent Application No. 2,603,364, Jan. 5, 2010, 6 Pages. |
Supplementary European Search Report, European Patent Application No. 06738600, May 3, 2010, 6 Pages. |
Lance, G.N., et al., “Computer programs for hierarchical polythetic classification (“similarity analyses”),” The Computer Journal, C.S.I.R.O. Computing Research Section, 1966, p. 60-64, vol. 9. |
Lance, G.N., et al., “A Generalized Sorting Strategy for Computer Classifications,” Nature, Oct. 8, 1966, p. 218, vol. 212. |
Lance, G.N., et al., “A General Theory of Classificatory Sorting Strategies 1. Hierarchical Systems,” The Computer Journal, C.S.I.R.O. Computing Research Section, 1967, pp. 373-380, vol. 9, No. 4. |
Lance, G.N., et al., “Mixed-data classificatory programs. I. Agglomerative Systems,” Austral. Comput. J., 1967, pp. 15-20, vol. 1. |
Milligan, G., “Ultrametric Hierarchical Clustering Algorithms,” Psychometrika, Sep. 1979, pp. 343-346, vol. 44, No. 3. |
Tan, P.-N., et al., “Introduction to Data Mining,” Chapter 8 Cluster Analysis: Basic Concepts and Algorithms (Section 8.3.3—The Lance-Williams Formula for Cluster Proximity, p. 524), 2006, pp. 487-568. |
Adamic, L., et al., “A social network caught in the Web”, First Monday, 2003, pp. 1-22. |
Agarwal, P et al., “Enabling Real-Time User Interests for Next Generation Activity-Oriented Social Networks”, A Thesis submitted to the Indian Institute of Technology Delhi in conformity with the requirements for the degree of Bachelor of Technology, 2005, 70 pages. |
Anwar, Z., et al., “Leveraging ‘Social-Network’ Infrastructure to Improve Peer-to-Peer Overlay Performance: Results from Orkut”, 2005, 9 pages. |
Baird, D., et al., “Neomillennial user experience design strategies: utilizing social networking media to support “Always On” Learning Styles,” J. Educational Technology Systems, vol. 34(1)5-32, 2005-2006. |
Boyd, D., et al., “Social Network Sites: Definition, History, and Scholarship”, Journal of Computer-Mediated Communication 13 (2008) 210-230. |
Churchill, E., et al., “Social Networks and Social Networking”, IEEE Internet Computing, Published by the IEEE Computer Society, Sep. Oct. 2005, pp. 14-19. |
Cohen, T., et al., “Social Networks for Creative Collaboration”, C&C'05, Apr. 12-15, 2005, ACM, pp. 252-255. |
Decker, S., et al., “The Social Semantic Desktop”, DERI Technical Report May 2, 2004, May 2004, 7 pages. |
Eagle, N., et al., “Social Serendipity: Proximity Sensing and Cueing”, MIT Media Laboratory Technical Note 580, May 2004, 18 pages. |
Erickson, T., et al., “Social Translucence: Using Minimalist Visualizations of Social Activity to Support Collective Interaction”, in Designing Information Spaces: The Social Navigation Approach (eds. K. Höök, D. Benyon, A Munroe), Springer-Verlag: London, 2003, pp. 17-41. |
Gross, R., et al., “Information Revelation and Privacy in Online Social Networks”, WPES'05, Nov. 7, 2005, ACM, pp. 71-80. |
Hammond, T., et al., “Social Bookmarking Tools (I)”, D-Lib Magazine, Apr. 2005, 23 pages, vol. 11, No. 4. |
Heer, J., et al., “Vizster: Visualizing Online Social Networks”, IEEE Symposium on Information Visualization, 2005, 8 pages. |
Leonard, A., “You are who you know”, published on www.salon.com, Jun. 15, 2004, 15 pages. |
Lockheed-Martin Corporation “Battlefield awareness and data dissemination intelligent information dissemination server,” AFRL-IF-RS-TR-1999-238, Final Technical Report, Nov. 1999, 31 pages. |
Marwick, A.E., “Selling Your Self: Online Identity in the Age of a Commodified Internet”, A thesis submitted in partial fulfillment of the requirements for the degree of Master of Arts University of Washington, 2005, 192 pages. |
Metcalf, S., et al., “Spatial Dynamics of Social Network Evolution”, Presented at the 23rd International Conference of the System Dynamics Society, Jul. 19, 2005, 13 pages. |
Mori, J., et al., “Real-world Oriented Information Sharing Using Social Networks”, GROUP'05, Nov. 6-9, 2005, ACM, pp. 81-84. |
Nardi, B., et al., “Blogging as Social Activity, or, Would You Let 900 Million People Read Your Diary?” CSCW, Nov. 6-10, 2004, ACM, pp. 222-231, vol. 6, Issue 3. |
Neumann, M., et al., “Semantic social network portal for collaborative online communities”, Journal of European Industrial Training, vol. 29 No. 6, 2005 pp. 472-487. |
O'Murchu, I., et al., “Online Social and Business Networking Communities”, DERI—Digital Enterprise Research Institute, DERI Technical Report Aug. 11, 2004, Aug. 2004, 22 pages. |
Steen, M., et al., “Development of web-centric, context-aware, adaptive mobile services requires empathy and dialogue”, Freeband FRUX, 2005, pp. 1-4. |
Van Eijk, R., et al., “We-centric, context-aware, adaptive mobile service bundles”, Telematica Instituut, Nov. 30, 2004, 48 pages, published on Freeband. |
Wenger, E., et al., “Technology for communities”, CEFRIO Book Chapter v 5.2, Jan. 18, 2005, pp. 1-15. |
Livejournal syndicated accounts (2004), last updated Jan. 6, 2004, can be retrieved at <URL:http://www.livejournal.com/syn/>, 2 pages. |
Online Business Network, “Social Networking Site Guide-Ryze,” web page at <URL:http://www.onlinebusinessnetworks.com|online-social-networks-guide/ryze>, as available via the Internet and printed Dec. 1, 2004, 8 pages. |
PC World, “PCWorld-ICQ Builds a Social Network,” web page at <URL:http://www.pcworld.com/news/articleIO.aid.115084.OO.asp>, as available via the Internet and printed Dec. 1, 2004, 5 pages. |
NomadNet, “NomadNet News,” web page at <URL:http://www.netnomad.com/> available via the Internet and printed Dec. 1, 2004, 12 pages. |
Yahoo!, “Yahoo! Help-Yahoo! GeoCities Tour,” web page at <URL:http://help.yahoo.com/help/us/geo/tour/tour-01.html>, as available via the Internet and printed Dec. 1, 2004, 20 pages. |
Yahoo!, “Yahoo! Chat,” web page at <URL:http://chat.yahoo.com/>, as available via the Internet and printed Dec. 1, 2004, 1 page. |
Yahoo! Groups, “Customize LostDrive-ln,” web page at <URL:http://groups.yahoo.com/groups/lostdrive-in/confwiz>, as available via the Internet and printed Jun. 2, 2004, 10 pages. |
“CodeFx: PHP: Introduction to AJAX,” NexusFX, Jul. 26, 2004, 1 page [online][retrieved on Jan. 27, 2011] Retrieved from the Internet <URL:http://www.nexus:&netlarticles/php/introduction—to—ajax>. |
Garrett, J., “Ajax: A New Approach to Web Applications,” Adaptive Path, Feb. 18, 2005, 5 pages [online] [retrieved on Apr. 26, 2007] Retrieved from the Internet <URL:http://www.adaptivepath.com/publications/essays/archives/000385.php>. |
Justus, C., “Google Suggest Dissected”, Server Side Guy Blog Spot, Dec. 14, 2004, 27 Pages, [online] [retrieved on Jan. 27, 2011] Retrieved from the Internet <URL:http://serversideguy.blogspot.com/2004/12/google-suggestdissected.html>. |
Willison, S., “Auto complete comes to age,” Dec. 10, 2004, 1 page [online] [retrieved on Jan. 27, 2011] Retrieved from the Internet <URL:http://blogs.sitepoint.com|2004/12/10/auto-complete-comes-of-age/>. |
“Autocomplete”, Hooperbloob, Wikipedia, Mar. 6, 2005, 2 pages [online] [retrieved on Jan. 27, 2011] Retrieved from the Internet <URL: http://en.wikipedia.org/w/index.php?title=Autocomplete&oldid=14177197>. |
Examination Report for European Patent Application No. EP06738600.3, Feb. 8, 2011, 6 Pages. |
First Examination Report for India Patent Application No. 1742/MUMNP/2007, Nov. 10, 2010, 2 Pages. |
Google, Inc., “Google Answers,” Google, 2004, 1 page, [online] [retrieved on Jul. 29, 2004] retrieved from the internet <URL:http://answers.google.com/answers/>. |
Google, Inc., “Google Answers: Frequently Asked Questions,” Google, 2003, 9 pages, [online] [retrieved on Jul. 29, 2004] retrieved from the internet <URL:http://answers.google.com/answers/faq.html>. |
Yahoo! Inc., “Yahoo! Groups,” Yahoo! Inc., 2004, 2 pages, [online] [retrieved on Jul. 29, 2004] retrieved from the internet <URL:http://groups.yahoo.com>. |
Yahoo! Inc., “Yahoo! Help—Groups,” Yahoo! Inc., 2004, 12 pages, [online] [retrieved on Jul. 29, 2004] retrieved from the internet <URL:http://help.yahoo.com/help/us/groups/groups-01.html>. |
Yahoo! Inc., “Yahoo! Help—Groups Database,” Yahoo! Inc., 2004, 9 pages, [online] [retrieved on Jul. 29, 2004] retrieved from the internet <URL:http://help.yahoo.com/help/us/groups/database>. |
AT&T Personal Reach Service: Benefits and Features, Mar. 29, 2010, 7 pgs. |
AT&T Personal Reach Service: Personal Reach Service, Mar. 29, 2010, 2 pgs. |
Dukes-Schlossberg et al., “Battlefield Awareness and Data Dissemination Intelligent Information Dissemination Server,” Air Force Research Laboratory, Rome Research Site, Rome, NY, Nov. 1, 1999, 31 pgs. |
International Search Report, International Application No. PCT/US2008/005118, Sep. 30, 2008, 2 pgs. |
MediaSift Ltd., DataSift: Realtime Social Data Mining Platform, Curate and Data Mine the Real Time Web with DataSift, Dedipower, Managed Hosting, [Retrieved on May 13, 2011], 1 pg. |
Ring Central, Inc., Internet, retrieved at http://www.ringcentral.com, Apr. 19, 2007, 1 pg. |
Singh et al., “CINEMA: Columbia InterNet Extensible Multimedia Architecture,” Department of Computer Science, Columbia University, May 2002, pp. 1-83. |
Superfeedr Track, Internet, retrieved at http://blog.superfeedr.com/track/filter/xmpp/pubsubhubbub/track, May 13, 2011, 8 pgs. |
Twitter Blog: Tracking Twitter, Internet, retrieved at http://blog.twitter.com/2007/09/tracking-twitter.html, May 13, 2011, 2 pgs. |
Twitter Announces Fire Hose Marketplace: Up to 10K Keyword Filters for 30 Cents, Internet, retrieved at http://www.readywriteweb.com/archives/twitter—announces—fire—hose—marketplace—up—to—10k.php, May 13, 2011, 7 pgs. |
Number | Date | Country | |
---|---|---|---|
20060224675 A1 | Oct 2006 | US |