WO2005013079A2 - Service de rencontres accessible sur l'internet a appariement d'interets pondere et filtre pour le filtrage d'amis/de partenaires potentiels mettant en oeuvre des criteres d'attirance physique et/ou de personnalite - Google Patents

Service de rencontres accessible sur l'internet a appariement d'interets pondere et filtre pour le filtrage d'amis/de partenaires potentiels mettant en oeuvre des criteres d'attirance physique et/ou de personnalite Download PDF

Info

Publication number
WO2005013079A2
WO2005013079A2 PCT/US2004/024523 US2004024523W WO2005013079A2 WO 2005013079 A2 WO2005013079 A2 WO 2005013079A2 US 2004024523 W US2004024523 W US 2004024523W WO 2005013079 A2 WO2005013079 A2 WO 2005013079A2
Authority
WO
WIPO (PCT)
Prior art keywords
members
ofthe
user
community
online community
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/US2004/024523
Other languages
English (en)
Other versions
WO2005013079A3 (fr
Inventor
Ronald N. Shostack
Sean Renet
Anthony Rennert
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Dateplaycom Inc
Original Assignee
Dateplaycom Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from US10/632,771 external-priority patent/US20040167794A1/en
Priority claimed from US10/740,174 external-priority patent/US20040260781A1/en
Priority claimed from US10/740,279 external-priority patent/US20040249811A1/en
Application filed by Dateplaycom Inc filed Critical Dateplaycom Inc
Publication of WO2005013079A2 publication Critical patent/WO2005013079A2/fr
Publication of WO2005013079A3 publication Critical patent/WO2005013079A3/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H04L12/16—Arrangements for providing special services to substations
    • H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
    • H04L12/1813—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast for computer conferences, e.g. chat rooms
    • H04L12/1822—Conducting the conference, e.g. admission, detection, selection or grouping of participants, correlating users to one or more conference sessions, prioritising transmission

Definitions

  • This invention relates generally to the field of Internet dating services and to services designed to facilitate a compatible matching amongst individuals seeking companionship via the World Wide Web.
  • a computer user with Internet access first logs in, and is then presented with a screen showing real time messages sent from other users.
  • the messages are displayed in serial fashion along with a "handle" identifying each message sender.
  • any user can direct a message to any other particular user, and choose to strike up a chat based on the content ofthe displayed message.
  • Individuals thus have at their disposal a readily accessible, convenient form of "virtual conversation" that may be used to identify potential companions or acquaintances. [0005]
  • Unfortunately although helpful, finding potential mates or companions using the Internet is sometimes still difficult.
  • chat communities including those featured on dating-related web sites, have proliferated to include enormous numbers of members, each generating message information in relatively undifferentiated, disorganized fashion. Consequently, finding compatible chat members may take time. Further, once a pair of users find one another and strike up a virtual conversation, the continuous stream of messages from other users may prove distracting.
  • an integrated package of Internet-based date related services specifically designed to facilitate finding a suitable mate or companion.
  • Such an integrated package would provide easily visible, continually updated compatibility-screening information for each participant in a chat environment, and could optionally guide participants to chat rooms having other compatible participants.
  • the package of services would preferably provide an environment conducive to one-to-one conversation and to eliciting discussion ofthe type of subject matter useful in determining whether to pursue a relationship further.
  • Some members will add notations stating that they do not wish members to contact them unless the member has a reasonable belief that the approached member will find them attractive. Lacking information as to how the general population of members may judge a given member, the searching member has no reliable method to determine such a belief. A solution is thus needed to assist members in specifying their perspective concerning the group of members to whom they may or may not be physically attracted.
  • An example of a conventional web site that extends such a "community evaluation" method to account for members' physical attractiveness is a website found at www.hotornot.com. This site provides a member's picture and then solicits the community to provide a numerical ranking ofthe member's physical attractiveness. As shown in a sample screen shot in Figure 1, a member's picture is displayed and the member community is offered the opportunity to provide a physical attractiveness rank from 1 through 10. Once a member of the community provides a ranking, the website displays the overall ranking assigned by the community and the ranking provided by the member providing the ranking. This information also may be displayed for a previous member in the vertical picture at the left ofthe screen shot.
  • the "hot or not” site also operates a dating service which is found at www.meetme.hotornot.com.
  • the "meet me” site asks the community whether it wishes to meet the featured member. There are two possible responses — Yes or No. If the respondent selects No, no further action is taken and the next featured member is displayed. However, if the respondent selects Yes, then he or she is asked to become a member ofthe "meet me" site. Upon signing up as a new member, the user is taken to a screen displaying a picture of an existing member as shown in Figure 2. The site asks whether the user wants to meet the featured member and the user selects Yes or No. In the case illustrated in Figure 3, the user has selected Yes.
  • the picture ofthe new member is sent to the member whom the user wished to meet and the latter member is then able to select Yes or No to whether they want to meet the new member. If the latter member selects No, no further action is taken. However, if the latter member selects Yes, then an email exchange is begun with the intention of further conversation which may lead to a meeting in person.
  • the next screen to appear ( Figure 4) informs the user that his or her request has been passed to the featured member. If the featured member also wants to meet the user, the user will be notified by way of inclusion ofthe featured member in the user's "double-match" list which is accessible on the left side ofthe screen shot illustrated in Figure 4.
  • a "Meet People” option also located at the left side ofthe screen shot in Figure 4 puts the user back in the mode of selecting members he or she wishes to meet.
  • a member is not afforded the opportunity to search through the member community and to receive profiles that have been selected or deselected on the basis of physical attractiveness. Further, a member is not provided with a capability to exclude his or her profile from viewing or contact by members based on the community's judgment as to the physical attractiveness ofthe member.
  • prospective members to on-line dating service may specify not only their likes and dislikes but also may receive community feedback on the desirability of certain personality characteristics. For example, while men tend to be visual, basing their evaluations more significantly on a member's physical appearance, women tend to be more relationship-oriented, basing their evaluations more significantly on a member's perceived likeability by the community. Consequently, it is desired to provide community feedback on a member's perceived likeability as well as the member's physical attractiveness.
  • a web site provider establishes a site customized to facilitate finding a companion or potential mate.
  • the site provides functionality for determining whether a first and second subscriber are a relationship match, the extent to which the first and second subscribers are likely to be compatible on a friendship level and whether or not the level of friendship compatibility exceeds certain thresholds.
  • To use the site would-be subscribers first register with the site by creating a profile of information specifying the qualities they deem desirable in a mate or companion, as well as the relative significance of such qualities to other qualities. Once registered, the subscribers have access to, and may participate in, various chat room environments.
  • chat rooms are preferably arranged in hierarchical fashion such that each room belongs to a "sub-lobby" and each "sub- lobby" belongs to a "lobby.”
  • the lobbies each preferably correspond to respective categories of discussion topics, with each sub-lobby designating sub-categories of discussion topics within the larger categories. In this way, a subscriber can easily navigate to a chat room dedicated to a topic of interest to the subscriber.
  • lobby, sub-lobby and room selection screens feature displayed indicators showing the concentration of participants compatible with the user in each respective lobby, sub-lobby or chat room.
  • Such compatibility indicators are determined by comparison ofthe user's profile with that ofthe current chat participants. In this way, a subscriber can navigate to a chat room having high concentration of potential mates or friends participating.
  • a subscriber also preferably has the option to avoid manual navigation altogether by allowing the service to determine automatically the chat room having the highest concentration of compatible mates and/or friends. Once the room is determined, a screen corresponding to the determined room is displayed and the subscriber can accordingly participate in the chat.
  • the site provider also features a "virtual date" service whereby two chat participants choosing to do so can engage in a private chat and at the same time view a digital video clip corresponding to a romantic vacation.
  • the one-one chat environment eliminates the distraction that may result when chat messages are continuously generated by numerous chat participants.
  • the video clip provides a convenient topic for discussion that may reveal further details about a potential mate.
  • a method for establishing/judging member profiles based on community opinions as to individual members' physical attractiveness and/or personality characteristics.
  • the same method can be applied to other standards such as likeability, "coolness” factor, etc.
  • Two different approaches are taken in implementing this "physical/personality attractiveness" evaluation, each relying on a pairing of the concepts of community opinion and individual rank whereby one can determine the suitability of members to other members by reference to community-based opinions ofthe physical/personality attractiveness of members.
  • methods are described herein for predicting the likelihood that a specific member will find other specific members to be physically attractive or to have a suitable personality and the member database is searched using such criteria.
  • a method and web-based server apparatus programmed to match members of an online community based on interest and or activity based compatibility to each other is provided.
  • input is accepted from respective members indicating the degree of subscription or non-subscription the respective members have to predetermined interests on a scale of least interested to most interested and/or indicating the amount of importance the member ascribes to participation in a respective activities on a scale of least important to most important
  • interest-based and/or activity based compatibility between members is determined by comparing scaled inputs for respective interests and/or activities based on at least one of a total number of matching interests and activities and a degree of alignment among matching interests and activity importance indicators.
  • Members ofthe online community are then matched on the basis ofthe determined interest-based compatibility and/or the determined activity-based compatibility.
  • Figure 1 illustrates a sample screen shot ofthe "hot or not" website, where a member's picture is displayed and the member community is offered the opportunity to provide a physical attractiveness rank from 1 through 10.
  • Figure 2 illustrates a sample screen shot ofthe "meet me” portion ofthe "hot or not” website that asks members ofthe community whether they wish to meet the featured member.
  • Figure 3 illustrates a sample screen shot ofthe case where the member selects "yes" in response to the request of Figure 2 to meet the featured member.
  • Figure 4 illustrates a sample screen shot that informs the user that his or her request to meet a featured member has been passed to the featured member.
  • Figure 5 illustrates a sample screen shot where a member provides data input relating to physical appearance at the Match.com website for use in a search relating to a member's physical appearance.
  • Figure 6 is a high level overview of a network environment in which aspects of the present invention may be implemented.
  • Figure 7 is a block diagram depicting components ofthe client stations shown in Figure 6 in greater detail.
  • Figure 8 is a high level flow chart depicting a process of a user profile creation in accordance with an aspect ofthe present invention.
  • Figure 9 is a high level flow chart depicting a process of user navigation to a desirable chat room environment in accordance with an aspect ofthe present invention.
  • Figure 10 is a high level flow chart depicting in greater detail the step of determining the concentration of compatible participants in available chat rooms shown in Figure 9.
  • Figure 11 is a high level flow chart depicting in greater detail the step of determming a desirable chat room environment automatically as shown in Figure 9.
  • Figure 12a is a high level flow chart depicting in greater detail the step of determining the extent to which a user and a participant are a relationship match as shown in Figure 11.
  • Figure 12b is a high level flow chart depicting in greater detail the step of determining the extent to which a user and participant are a friendship match as shown in Figure 11.
  • Figure 13 is a high level flow chart depicting a user initiation of a virtual date in accordance with an embodiment ofthe present invention.
  • Figures 14 and 14a are web page interfaces that may be used to perform the step of selecting and forwarding a new or existing registered subscriber choice as depicted in Figure 8.
  • Figures 15 and 15a are web page interfaces that may be used to perform the step of selecting and forwarding a screen name, password and e-mail address during registration as depicted in Figure 8.
  • Figure 16 is a web page interface that may be used to perform the step of selecting and forwarding a relationship basics choice, friendship preferences choice or screen image choice as depicted in Figure 8.
  • Figures 16a and 16b are player profile web page interfaces that may be used as alternatives to that shown in Figure 16.
  • Figure 17 is a web page interface that may be used to perform the step of selecting and forwarding a first set of relationship basics information as depicted in Figure 8.
  • Figure 18 is a web page interface that may be used to perform the step of selecting and forwarding a second set of relationship basics information as depicted in Figure 8.
  • Figures 18a-l 8c are alternative web page interfaces that may be used to perform the step of selecting and forwarding the information depicted in Figures 17 and 18.
  • Figures 18d-l 8f are alternative web page interfaces that may be used to perform the step of selecting and forwarding the information depicted in Figures 17 and 18.
  • Figure 19 is a web page interface that may be used to perform the step of selecting and forwarding friendship preferences information as depicted in Figure 8.
  • Figures 19a-19c are alternative web page interfaces that may be used to perform the step of selecting and forwarding the information depicted in Figure 19.
  • Figures 19d-19e are alternative web page interfaces that may be used to permit the user to specify his/her interests and pursuits on a weighted scale so as to permit increased selectivity in a compatibility search.
  • Figure 20 is web page interface that may be used to perform the step of selecting and forwarding a screen image icon as depicted in Figure 8.
  • Figure 20a is an alternative web page interface that may be used to perform the step of selecting and forwarding a screen image icon as depicted in Figure 8.
  • Figures 21 and 21a are web page interfaces that may be used to perform the step of selecting and forwarding a lobby identification as depicted in Figure 9.
  • Figures 22 and 22a are web page interfaces that may be used to perform the step of selecting and forwarding a sub-lobby identification as depicted in Figure 9.
  • Figures 23 and 23a are web page interfaces that may be used to perform the step of choosing a chat room as depicted in Figure 9.
  • Figure 24 is a web page interface that may be used to perform the step of providing a chat room page corresponding to a determined chat room as depicted in Figure 9.
  • Figures 24a and 24b are alternative web page interfaces that may be used to perform the step of providing a chat room page corresponding to a determined chat room as depicted in
  • Figures 24c and 24d are web page interfaces that may be used to perform the step of sending a private message to a chat participant.
  • Figures 24e and 24f are web page interfaces that may be used to perform the step of inviting a chat participant to a private chat room.
  • Figure 24g is a web page interface that may be used to perform the step of initiating a virtual date.
  • Figure 24h is a web page interface that may be used to perform the step of selecting a virtual date activity type.
  • Figure 24i is a web page interface that may be used to perform the step of selecting an interactive movie for a virtual date.
  • Figure 24j is a web page interface that may be used to perform the step of selecting an interactive figure to be featured in an interactive movie.
  • Figure 24k is a web page interface that may be used to implement a virtual date in accordance with an embodiment ofthe preset invention.
  • Figure 25 depicts a set of Internet relay chat servers configured in a spanning tree formation.
  • Figure 26 is a web page interface that may be presented to an existing registered user of a dating related web site upon log-in in accordance with an embodiment ofthe present invention.
  • Figure 27 illustrates a sample profile screen for a hypothetical member.
  • Figure 28 illustrates a sample screen on which the user can provide a specific ranking of the degree to which the user finds the indicated member to be physically attractive in accordance with a first embodiment ofthe invention.
  • Figure 29 illustrates a sample screen where users can input search criteria employing the criteria of physical attractiveness to filter the list of members in the member database in accordance with the first embodiment.
  • Figure 30 illustrates a sample screen where users can input parameters to restrict the display of their profile to other members within the member database based on the other members' physical attractiveness in accordance with the first embodiment.
  • Figure 31 illustrates a sample screen showing those members meeting the user's selected physical attractiveness criteria and any other selected criteria that are found in a search ofthe member database.
  • Figure 32 illustrates a sample screen through which users can restrict the display of their profile while in a chat room to other members within the member database based on the other members' physical attractiveness in accordance with the first embodiment.
  • Figure 33 illustrates a sample screen showing those members who appear to a particular user in a chat room based on display criteria including each member's physical attractiveness and member selections concerning display of their profile while in chat rooms.
  • Figure 34 illustrates a snapshot of a set of members returned from a hypothetical database search for use in allowing the user to assign a ranking ofthe degree to which he/she finds that member to possess an attractive personality.
  • Figure 35 illustrates a sample screen on which the user can provide a ranking ofthe degree to which the user finds the selected member to have an attractive personality.
  • Figure 36 illustrates several interest and pursuit categories that provide information for allowing a user to evaluate the personality ofthe selected member.
  • Figure 37 illustrates additional Pursuit categories that appear as the user continues to scroll down the page of Figure 36.
  • Figure 38 illustrates a sample screen with questions that allow the member to describe his/her personality in his/her own words.
  • Figure 39 illustrates a sample screen that allows users to specify a profile for personality attractiveness settings.
  • Figure 40 illustrates a sample screen that allows users to restrict the display of their profile to other members within the member database based on the other members' personality attractiveness.
  • Figure 41 illustrates a sample screen showing the results of a search for members meeting personality attractiveness criteria and any other selected criteria.
  • Figure 42 illustrates a sample screen that allows users to restrict the display of their profile while in a chat room to other members within the member database based on the other members' personality attractiveness.
  • Figure 43 illustrates a sample screen showing that members appear or do not appear to other members in a chat room based on display criteria including members' personality attractiveness and member selections concerning display of their profile while in chat rooms.
  • Figure 44 illustrates a sample screen on which the user can provide a specific ranking of the degree to which the user finds the indicated member to be physically atfractive in accordance with a second embodiment.
  • Figure 45 illustrates a sample screen where users can input search criteria employing the criteria of physical attractiveness to filter the list of members from the member database in accordance with the second embodiment.
  • Figure 46 illustrates a sample screen where users can input parameters to restrict the display of their profile to other members within the member database based on the other members' physical attractiveness in accordance with the second embodiment.
  • Figure 47 illustrates a sample screen through which users can restrict the display of their profile while in a chat room to other members within the member database based on the other members' physical attractiveness in accordance with the second embodiment.
  • Figure 48 illustrates a sample screen on which the user can provide a ranking on a scale of, e.g., 1-10 ofthe degree to which the user finds another member to have an attractive personality.
  • FIG. 6 shows a high level overview of a network environment in which aspects ofthe present invention may be implemented.
  • One or more client stations 20a, 20b, 20c can be coupled via the Public Switched Telephone Network (PSTN) to an Internet Access Provider (IAP) station.
  • PSTN Public Switched Telephone Network
  • IAP Internet Access Provider
  • the LAP station in turn, is connected in the "Internet” 14 ( " i.e., the well known globally interconnected network of host servers, including World Wide Web servers 11).
  • an IAP subscriber at client station 20 dials a modem at the LAP station, which typically includes a rack of modems (i.e., modulator- demodulators) which can then accept multiple incoming calls simultaneously.
  • modems i.e., modulator- demodulators
  • the call is completed over the PSTN by a switching station at the central office of a telephone service provider.
  • the client station 20 is connected in the Internet 14, and the client station 20 can issue data requests to web sites on web servers 11 using the IAP station as a conduit.
  • the client station 20 maintains a permanent connection to the Internet 14 using a network or similar interface, in which case dialing in is not required.
  • the LAP subscriber may access an information database (i.e., the Internet 14) spanning the globe much as if such information were stored locally at the subscriber's client station 20a, 20b, 20c.
  • an information database i.e., the Internet 14
  • a number of protocols are used to exchange commands and data between computers connected to the Internet.
  • the protocols include the File Transfer Protocol (FTP), the Hyper Text Transfer Protocol (HTTP), the Simple Mail Transfer Protocol (SMTP), and the Gopher document protocol.
  • the HTTP protocol is used to access data on the World Wide Web, often referred to as "the Web.”
  • the Web is an information service on the Internet providing documents and links between documents. It is made up of numerous Web sites located around the world that maintain and distribute electronic documents. A Web site may use one or more Web server 11 computers that store and distribute documents in a number of formats, including the Hyper Text Markup Language (HTML).
  • An HTML document contains text and metadata (commands providing formatting information), as well as embedded links that reference other data or documents.
  • the referenced documents may represent text, graphics, or video. The presently described embodiment is thus described below with reference to an LAP subscriber or user having access to a web server 11 having HTML documents representing web pages.
  • the web pages together facilitate Web based dating services in accordance with an embodiment ofthe present invention.
  • FIG. 7 illustrates a block diagram depicting components ofthe client stations 20 shown in Figure 6 in greater detail.
  • the client station 20 in Figure 6 includes conventional computer hardware components including a Central Processing Unit (“CPU") 120, a system memory 121, and a system bus 151 that couples the system memory 121 to CPU 120 and other computer system 20 components.
  • the system memory 121 typically includes read only memory (ROM), random access memory (RAM) or other conventional known memory types.
  • Instructions comprising application program modules, including an operating system are typically stored in and retrieved from memory 121 by CPU 120, which executes these instructions.
  • a user's client incorporates application program modules that include a browser element.
  • a Web Browser is a client application or an integrated operating system utility that communicates with server computers via FTP, HTTP and Gopher protocols.
  • a Web browser functions to request and receive web pages and data from a web server 11 storing an Internet Dating web site service and to graphically present the web pages to a user on a display device.
  • the display device 147 is also coupled to the system bus 151 via a video graphics adaptor card 130.
  • the display device 147 which maybe a CRT monitor, LCD terminal or other display, includes a screen for the display of information visible to the user.
  • the user controls the web browser by entering commands and other input into the computer 20 via input devices such as a keyboard 195, mouse, scanner or other input device.
  • the keyboard 195 is coupled to CPU 120 via a serial port 131 coupled to system bus 151.
  • the present invention includes an Internet based dating web site providing a variety of services useful to those individuals seeking a friend or mate.
  • this site consists of web pages comprising HTML data requested and graphically interpreted by the user's web browser.
  • FIG. 8 illustrates a high level flow chart depicting a process of new subscriber registration at a dating web site in accordance with the invention, including profile subscriber creation.
  • Step 300 upon a user's keying of a URL (or selection of a displayed web page hyperlink), the client station 20 browser forwards an http request for a the Internet Dating service home page to the site provider's web server 11 or to a web server 11 hosting the site provider's site .
  • the web server software causes the corresponding home page consisting of HTML data to be returned to the client station 20.
  • the web page returned includes an image map having image-based parts with corresponding hyperlinks allowing the user to specify whether he/she is new to the site or is already a registered subscriber.
  • Figure 14 depicts an exemplary "home page” web page interface with "new player” and "existing player” selections as displayed on display device 147.
  • Figure 14a depicts a similar "home” page in accordance with an alternative embodiment.
  • Step 305 if the user has selected the "existing player" choice, then the web server 11 returns a log-on screen allowing the user to authenticate himself/herself as an existing subscriber. Once authentication information is provided, a web page is returned initiating a process, in accordance with an embodiment ofthe present invention, of user navigation to a desirable chat room environment having participants compatible with the user. This process is described in greater detail below with reference to Figure 9.
  • the web server 11 returns a query form page initiating a process of subscriber profile creation in accordance with an embodiment ofthe present invention.
  • the web server 11 first returns a query form page allowing entry of authentication information corresponding to the user in a user profile stored at the web server 11 and maintained by the site provider.
  • Figure 15 depicts an exemplary query form page interface allowing entry of a screen name, password, re-entry of password and electronic mail address information.
  • Figure 15a depicts a similar query from page in accordance with an alternative embodiment.
  • the screen name corresponds to a name the user will go by as a chat participant when using the virtual chat services provided by the web site.
  • the screen names need not correspond to the user's actual name and thus allows for some anonymity during chat participation.
  • the password will allow the user to log onto the web site as an existing subscriber in future access sessions, and will also allow the web server 11 to identify and retrieve the user's profile thus obviating the need for profile re-creation prior to each access session.
  • the password re-entry field allows confirmation ofthe password typed in by the user.
  • the electronic mail address field allows entry ofthe user's electronic mail address. This e-mail information allows the site provider to communicate with subscribers (for example, to provide a forgotten password or to provide dating, vacation or singles related special offers to the user).
  • Step 320 the user specifies screen name, password and electronic mail information and causes the browser element to forward the selections to the site provider's web server 11.
  • the web server 11 receives the user request and extracts and stores data corresponding to the user's selected choices in a user profile corresponding to the user.
  • the web server 11 returns a query form page initiating a process for completing the subscriber profile.
  • Figures 16a and 16b depict exemplary web page displays that may notify the user that this process has begun.
  • the user has a choice of completing selected portions of a player profile.
  • the player profile completion process is initiated with a screen such as Figure 16, which depicts an exemplary web page with image maps with conventional displayed "buttons.”
  • the exemplary web page of Figure 16 allows entry of a relationship basics choice, a friendship preferences choice or a screen image icon choice. That is, the displayed buttons correspond to "relationship basics," “friendship preferences,” or “screen image icon” choices.
  • the "relationship basics” information selection initiates a process allowing the user to specify those qualities he or she desires in a mate.
  • the "friendship preferences” choice initiates a process allowing the user to specify those qualities he or she desires in a friend.
  • the "screen image icon" choice allows a user to specify a graphics image corresponding to the user that is displayed for the benefit of other participants whenever the user participates in chat sessions facilitated at the web site.
  • the screen image icon may be an actual picture ofthe user or may be chosen from a predefined set of icons maintained by the site provider.
  • Step 330 if the user has selected the "relationship basics" choice, then the web server 11 returns a web page query form allowing entry of a first set of information specifying the qualities the user desires in a mate.
  • Figure 17 depicts an exemplary web page interface allowing user entry of a first set of "relationship basics” information.
  • the "seeking" field allows entry a gender for the desirable mate.
  • the "I prefer to meet people” field allows the user to specify that he wishes to date only individuals in his city, region or country, as the case may be.
  • the web server 11 can use this information in conjunction with information specified in the "postal code” and "county” fields to determine the geographic area within which the user desires to find a mate.
  • the desired age range field allows the user to specify the age range ofthe user's desired mate.
  • Step 335 the user specifies user's date of birth, user's gender, mate's desired gender, age criteria for desired mate, user's country, and geographic criteria for desired mate information and causes the browser element to forward the selections to the site provider's web server 11.
  • the web server 11 receives the user request and extracts and stores data corresponding to the user's selected choices in a user profile.
  • the web server 11 returns a query form page allowing the entry of still further information specifying the qualities the user desires in a mate.
  • Figure 18 depicts an exemplary web page interface allowing user entry of a second set of "relationship basics" information.
  • the "religions I prefer to date” field allows entry of a religion(s) for the user's desirable mate.
  • the "religions I prefer not to date” field allows the user to specify that he/she does not wish to date individuals belonging to the specified religions.
  • Step 345 the user specifies information in the "My religion is," "Religions I prefer to date” and “religions I prefer not to date” fields and causes the browser element to forward the selections to the site provider's web server 11, thus completing the user specification ofthe relationship basics portion ofthe profile.
  • the relationship basics may be selected and forwarded to the web server 11 two, four or any other number of screens.
  • Figures 18a - 18c depict screen interfaces for selecting and forwarding the relationship basics information using three screens instead of two.
  • Figures 18d - 18f similarly depict three screen interfaces for selecting and forwarding relationship basics information.
  • the user may also select and forward a relationship type (i.e., friendship or romantic relationship).
  • a relationship type i.e., friendship or romantic relationship.
  • the web server 11 Upon receiving the relationship basics information, extracts and stores data corresponding to the user's selected choices in a user profile corresponding to the user. The web server 11 also returns a web the page (as in Step 325) allowing entry of a relationship basics choice, a friendship preferences choice or a screen image icon choice (as exemplified in Figure 16).
  • the web server 11 returns a web page query form allowing entry of a set of information specifying areas of interest (e.g., books, movies, cooking) to the user.
  • Area of interest e.g., books, movies, cooking
  • Figure 19 depicts an exemplar of such a web page interface.
  • each of three menus allow specification of multiple areas of interest that can be later compared with areas of interest of other site participants to determine compatibility with the user. Note that in the presently described embodiment the items selected in the second and third columns displayed in Figure 19 will be different than those selected in the first column.
  • the area of interest information may be selected and forwarded to the web server 11 with two, three or any other number of screens.
  • Figures 19a - 19c depict screen interfaces for selecting and forwarding the are of interest information using three screens with check boxes instead of one screen with pull down menus.
  • an additional scheme for interest matching is provided whereby interest-based compatibility is assessed as a function of an indication by members concerning not just a true-false response set but the degree of subscription or non-subscription a member has to each interest. That is, members are provided the opportunity to indicate on a scale of -5 to +5 the degree to which they are interested or disinterested in a given item or interest area (example: Art). The results are then accumulated to establish the degree of interest-based alignment among members.
  • Figures 19d and 19e depict screen interfaces for eliciting such interest-based compatibility information.
  • the compatibility checking software may then assess the degree of common interest between respective members based on the total number of matching interests as well as the degree of alignment among those matching interests, thereby providing more a significantly more accurate and nuanced compatibility assessment.
  • the browser element forwards the selections to the site provider's web server 11.
  • the web server 11 receives the user request and extracts and stores data corresponding to the user's selected choices in a user profile corresponding to the user.
  • the web server 11 also returns a web the page (again as in Step 325) allowing entry of a relationship basics choice, a friendship preferences choice or a screen image icon choice (as exemplified in Figure 16).
  • the user wishes to complete the profile with information relating to the screen icon he/she wishes to present to other participants during chat sessions.
  • the web server 11 returns a web page query form allowing entry of a set of information corresponding to a screen icon representing the users.
  • Figure 20 depicts an exemplar of such a web page interface.
  • the interface provides a series of predefined screen icons from which the user may choose.
  • the user specifies an icon and selects the "next button" causing the browser element to forward the selection to the site provider's web server 11.
  • the user creates a digital photo of him or herself (e.g., using conventional scanning processes) and forward the picture to the site provider (e.g., via electronic mail or via a special screen interface).
  • Figure 20a depicts a web page interface allowing a choice among screen image icons forwarded to the site provider earlier.
  • the user profile is complete and the user can log on as an existing subscriber ofthe site in future site access sessions. Further, as the option of changing aspects of his or her corresponding profile by aspects ofthe profile. For example, upon logging on as an existing subscriber the user may choose the "relationship basics," “friendship preferences,” or “screen image” choices, as in step 325 of Figure 8, to re-define those respective aspects ofthe profile. Each time the profile is redefined in this manner an updated version ofthe profile is stored on the web server 11 or in a database associated with the web server 11 maintained by the site provider.
  • the user can take advantage ofthe relationship facilitation services provided by the dating related web site. For example, in the presently described embodiment, upon logging in as an existing user, the user is presented with a screen such as that depicted in Figure 26 allowing the user to take advantage of on line chat room and other services facilitated by the dating related web site. If the user selects the "View Player Profile" option, the user is directed to a screen that enables the user to view the information assembled about a player in the corresponding player profile. In that event, the user can send e- mails to such other players that seem interesting.
  • the user is presented with the ability to arrive at a desired chat room environment by navigating to a chat room with participants having relative compatibility with the user. This navigation is made easier by the hierarchical organizations of chat rooms featured at the dating related web site.
  • the chat rooms are organized into sub-lobbies, which in turn are organized into lobbies.
  • the lobbies each correspond to a broad category of conversation topic characterizing the subject ofthe chat in each chat room within the lobby. Further, each room within a sub-lobby features sub-topics of conversation falling within the broad topic associated with the lobby within which the sub-lobby is organized.
  • a user can thus find a chat room featuring an optimal chat topic by selecting a broad topic of interest (e.g., sports) on the lobby level, a narrower sub-topic of interest falling within the broad topic (e.g., hockey) on the sub-lobby level, and then a chat room within the selected sub-lobby.
  • a broad topic of interest e.g., sports
  • a narrower sub-topic of interest falling within the broad topic e.g., hockey
  • the web-page interfaces corresponding to the lobby, sub-lobby and chat room selections provide feedback indicating the concentration of compatible participants in each lobby, sub-lobby or chat room, as the case may be.
  • the user's selection of chat rooms may be based not only on a favorable topic of conversation featured at the chat room, but also on the likelihood that a greater percentage of participants are compatible with the user.
  • Figure 9 depicts a process of subscriber navigation to a desirable chat room in accordance with an embodiment ofthe present invention. The process described assumes the user has already logged on as an existing subscriber and intends to participate in a chat.
  • the web server 11 determines the concentration of compatible participants in each room, sub- lobby and lobby within which a chat is taking place. This step depicted in greater detail in Figure 10 in accordance with an embodiment ofthe present invention.
  • the web server 11 first retrieves the user's profile from storage in a database.
  • the user's profile is filled completely as describe above in connection with Figure 8, though in other embodiments the profile may be partially filled with only relationship related information or only friendship related information.
  • Step 505 the web server 11 retrieves a first lobby from a stored set of lobbies (e.g., a "sports" lobby).
  • data corresponding to the set of lobbies is preferably stored in a relational database configured with associations or links specifying the hierarchical relationship between lobbies, sub-lobbies within lobbies and rooms within sub-lobbies as described above.
  • Step 510 variables having information corresponding to this particular lobby are initialized, hi particular, "Participants,” “Relationship Matches,” and "Friendship Matches" variables are set to zero.
  • Step 515 the first sub-lobby within the retrieved lobby having an active chat room is retrieved from the relational database of lobby, sub-lobby and chat room information.
  • variables having information corresponding to this particular sub-lobby are then initialized in Step 520. That is, "Participants,” “Relationship Matches” and “Friendship Matches” variables are set to zero.
  • Step 525 the web server 11 retrieves the first active chat room within the retrieved sub-lobby from the relational database of lobby, sub-lobby and chat room information. To perform this task, the web server 11 also checks which chat rooms within the current sub- lobby are active. As with the sub-lqbby, variables having information corresponding to this particular room are then initialized in Step 530. That is, "Participants,” “Relationship Matches” and “Friendship Matches" variables are set to zero.
  • Step 535 the first participant within the retrieved chat room is retrieved by checking for the participants active in the room.
  • the "Participants" variables for the current lobby, sub-lobby, and room are incremented by one in Step 540 and the participant's profile stored at the web server 11 (or associated database) is retrieved for comparison with user's, hi particular, in Step 545 the web server 11 compares the participant's profile to the user's to determine whether there is a relationship match between the two.
  • An exemplary process for determining whether there is a relationship match between two subscribers ofthe dating-related web site in accordance with an embodiment ofthe present invention is described more fully in connection with Figure 12a below.
  • Step 550 the web server 11 compares the participant's profile to the user's to determine the degree to which there is a friendship match between the two. If such a procedure returns a sufficient degree friendship compatibility, then the "Friendship Matches" variables for the current lobby, sub-lobby and room are also incremented by one.
  • Step 555 the web server 11 determines whether the current participant is the last in the currently considered chat room. If not then the next participant in the room is retrieved along with a corresponding profile and the process of Steps 540-555 is repeated, hi this way the process is repeated for each participant in the room and thus eventually yields the number of participants in the room, the number of such participants that are relationship matches and the number of such participants that are friendship matches. Thus, once the web server 11 determines during an iteration of Step 555 that there are no more participants, in Step 560 the web server determines the concentration of relationship matches and friendship matches in the room processed.
  • a "Relationship Match Concentration" variable for the current room is set to the number of relationship matches over the number of participants and is stored for future retrieval at the web server 11 or an associated database.
  • a "Friendship Match Concentration” variable for the current room is set to the number of friendship matches over the number of participants in the room and is stored.
  • Step 565 the web server 11 determines whether the current room is the last in the currently considered sub-lobby. If not then the next room in the sub-lobby is retrieved and the process of Steps 530-565 is repeated. In this way the process is repeated for each room in the currently considered sub-lobby. This ensures that relationship match and friendship match concentration data for each room in the sub-lobby is stored and also eventually yields the number of participants in the sub-lobby, the number of such participants that are relationship matches and the number of such participants that are friendship matches.
  • Step 570 the web server can determine the concentration of relationship matches and friendship matches in the sub-lobby processed. That is, a "Relationship Match Concentration" variable for the current sub-lobby is set to the number of relationship matches in the sub-lobby over the number of participants in the sub-lobby and is stored for future retrieval at the web server 11 or an associated database. Similarly, a "Friendship Match Concentration" variable for the current sub-lobby is set to the number of friendship matches for the current sub-lobby over the number of participants in the current sub-lobby and is stored.
  • Step 575 the web server 11 determines whether the current sub-lobby is the last in the currently considered lobby. If not then the next sub-lobby in the current lobby is retrieved and the process of Steps 520-575 is repeated. In this way the process is repeated for each sub-lobby of rooms in the currently considered lobby. This ensures that relationship match and friendship match concentration data for each room in each sub-lobby in the currently considered lobby is stored and also eventually yields the number of participants in the current lobby, the number of such participants that are relationship matches and the number of such participants that are friendship matches.
  • Step 580 the web server can determine the concentration of relationship matches and friendship matches in the lobby processed. That is, a "Relationship Match Concentration" variable for the current lobby is set to the number of relationship matches in the lobby over the number of participants in the lobby and is stored for future retrieval at the web server 11 or an associated database. Similarly, a "Friendship Match Concentration" variable for the current lobby is set to the number of friendship matches for the current lobby over the number of participants in the current lobby and is stored.
  • Step 585 the web server 11 determines whether the current lobby is the last. If not then the next lobby is retrieved from the database of lobby/sub-lobby/room information the process of Steps 510-585 is repeated. In this way the process is repeated for each lobby of sub- lobbies having active chat rooms. This ensures that relationship match and friendship match concentration data for each room and sub-lobby of rooms in each lobby, as well as for each lobby, is eventually stored, completing the process. Once the server 11 determines during an iteration of Step 585 that there are no more lobbies, the process ends in Step 590.
  • the web server 11 having determined and stored the concentration of compatible friends and potential mates in each active room, sub-lobby and lobby, the process of subscriber navigation to a desirable chat room may begin. That is, in Step 410, in response to an "Enter Chat Room" selection by an existing subscriber the web server 11 returns a query form page initiating a process for navigating through the available chat room lobbies. In particular, the web server 11 returns a web page allowing entry of a sports lobby choice, a politics lobby choice, a travel, lobby choice, a romantic conversation lobby choice, a move/film lobbies choice and a music lobby choice.
  • Figure 21 depicts an exemplary web page with image maps with conventional displayed "buttons" corresponding to these choices.
  • Figure 21a depicts a similar web page in accordance with an alternative embodiment.
  • the lobbies are preferably stored in a relational database specifying the associations amongst lobbies, sub-lobbies and rooms.
  • the web page of Figure 21 also displays indicators showing the concentration of compatible friends and mates in each active lobby.
  • the displayed indicators comprise one to three check marks reflecting the concentration of compatible mates and one to three green lights reflecting the concentration of compatible friends.
  • this information relating to the concentration of compatible participants is derived from the concentration variables stored in Step 400 of Figure 9 and determined in accordance with the discussion of Figure 10.
  • Step 430 the web server 11 returns a web page allowing entry of a sports "football” sub-lobby choice, “hockey” sub-lobby choice, “basketball” sub-lobby choice, "coach recently fired at MSU” sub-lobby choice and “drug testing” sub-lobby choice.
  • Figure 22 depicts an exemplary web page with image maps with conventional displayed "buttons” corresponding to these choices.
  • the first three choices, “football,” “hockey,” and “basketball,” refer to sub-topics of discussion involving particular sports within the broader category ofthe "sports" topic chosen in Step 420.
  • the web page also displays indicators showing the concentration of compatible friends and mates in each active sub-lobby within the chosen "sports" lobby. Again, the displayed indicators comprise one to three check marks reflecting the concentration of compatible mates and one to three green lights reflecting the concentration of compatible friends. And again, by providing for the display of indicators showing the concentration of likely compatible friends and mates, the dating related web site allows more informed user navigation to a desired chat room.
  • the user selects the music lobby in Step 420 and a sub- lobby screen such as that shown in Figure 22a is displayed.
  • Step 440 the user selects the "hockey" sub- lobby choice in Step 440 and, in response, in Step 450 the web server 11 returns a web page allowing a choice of either automatic navigation to a desired chat room within the chosen sub- lobby, or manual selection of a chat room within the chosen sub-lobby.
  • Figure 23 depicts an exemplary web page with query form fields and image maps with conventional displayed "buttons" corresponding to these choices. ( Figure 23 a shows a similar screen wherein the user instead specified the "music" lobby and "jazz" sub-lobby choices).
  • the web server 11 determines a chat room in accordance with the user's choice in step 460. Otherwise if the user selects the automatic navigation choice, then in Step 470 the web server 11 determines a chat room using an algorithm for automatically determining a chat room within the selected sub-lobby having optimally compatible participants.
  • Figure 11 shows an exemplary method for automatically determining for the user, given a selected sub-lobby, a chat room having optimally compatible participants, hi particular, the exemplary process is initiated in Steps 600 and 605, with "MaxPoints" and “Room Chosen” variables initialized to zero and "none,” respectively.
  • Step 610 the next room (that is, the first room in the first iteration) in the sub- lobby is retrieved by the web server 11.
  • a "Room Points" variable for the retrieved room is set to zero and in Step 620 the current room is identified as the room retrieved.
  • Step 625 the next participant (that is, the first participant in the first iteration) in the retrieved room is retrieved by the server 11.
  • Steps 630 and 635 the web server determines whether the user and the retrieved participant are a relationship match, the extent to which the user and the retrieved participant are likely compatible on a friendship level and whether or not the level of friendship compatibility exceeds certain thresholds.
  • Figure 12a shows in greater detail the step of determining whether there is a relationship match between the user and retrieved participant as depicted in Step 630 of Figure 11.
  • the web server 11 uses the profiles ofthe retrieved participant and user to determine if either: a) the retrieved participant is not ofthe gender desired by the user; b) the retrieved participant is not within the age range desired by the user; c) the participant is outside a city the user desires to meet people in; d) the participant is outside the region the user desires to meet people in; e) the participant is outside the country the user desires to meet people in; f) the participant is a member of a religion the user stated he preferred not to date; or g) the participant is not a member of a religion the user stated he preferred to date.
  • Step 735 a "Relationship Match” variable is set to true and in Step 745 the "Relationship Match” variable is returned indicating a relationship match between the user and participant. Otherwise, if any one of the conditions considered in Steps 700-730 is true, the "Relationship Match” variable is set to "false” in Step 740 and is returned in Step 745 indicating no relationship match exists between the user and participant.
  • the "relationship match” may include "friendship match” criteria ofthe type described below in connection with Figure 12b.
  • Figure 12b shows in greater detail the step of determining the extent to which the user and the retrieved participant are compatible on a friendship level and whether or not the level of friendship compatibility exceeds certain thresholds as depicted in Step 635 of Figure 11.
  • Steps 750 and 755 the "Points Earned" and "Points Possible” variables are initialized to zero.
  • Steps 760 through 775 the web server 11 cycles through each area of interest specified by either the user or the participant.
  • areas of interest e.g., books, movies
  • the web server 11 or a database associated with the web server 11 also includes a database of associating weighting values (i.e., a number of points) with each area of interest. For "sports" may have an associated value of 50 points, while “books” may have an associated value of 100 points.
  • the weighting value ofthe areas of in interest is a judgment that the site provider may make based on a variety of factors and effectively allows the site provider to prioritize the importance of areas interest with respect to the compatibility determination (e.g., having sports activities in common may be considered more important than having an interest in books in common).
  • the web server 11 retrieves the next area of interest specified by either the user or participant. If both the user and the participant specified the area of interest (e.g., books), then in Step 765 the weight value ofthe area of interest is retrieved and added to the "Points Earned" variable value and to the "Points Possible” variable value.
  • Step 770 if only one ofthe user or participant have the area of interest in their profiles, only the "Points Possible" variable is incremented by the weight value ofthe area of interest.
  • Step 775 the web server 11 checks if there are other areas of interest specified by either the user or participant and, if so, processing begins again with Step 760 and continues until all areas of interest specified by either the user or the participant have been processed.
  • Steps 780 through 787 the web server 11 cycles through each of a set "area of interest combinations" stored at the web server 11 or an associated database.
  • "area of interest combinations” are combinations comprising two areas of interest (e.g., hockey and skiing, movies and theatre) for which the site provider has provided an association.
  • such associations are implemented with links in a relational database storing the area of interest combinations, hi the presently described embodiment, the areas of interest combinations are created by the site provider to account for the fact that two individuals may have similar areas of interest even if they do not specify an identical area of interest.
  • a participant that specified "skiing" as an area of interest may have interests similar to a participant specifying other winter sports, such as "hockey” as an interest. If the site provider determines that this would in general be the case, then the area of interest combination "skiing- hockey" can be included in the relational database.
  • the web server 11 ofthe presently described embodiment, or a database associated with the web server 11 also includes records associating weighting values (i.e., a number of points) with each area of interest combination. For example, a "skiing-hockey" area of interest combination may have an associated point value of 20 points while a "movie-theatre" are of interest combination may have an associated point value of 10 points.
  • the weighting values associated with area of interest combinations allow the site provider to prioritize the importance of area interest combinations and their respective impact on the compatibility determination (e.g., if a first participant enjoys hockey while a second enjoys skiing, that fact may be considered more relevant than if the first participant enjoys movies while the second enjoys theatre), hi Step 780, the web server 11 retrieves the next area of interest combination in a database. If the user specified one component ofthe area of interest combination pair while the participant specified the other component, then in Step 785 the weight value ofthe area of interest combination is retrieved and added to the "Points Earned" variable value and to the "Points Possible” variable value. In Step 790, the web server 11 checks if there are other area of interest combinations in the database storing this information and, if so, processing begins again with Step 780 and continues until all area of interest combinations in the database have been processed.
  • a "Percentage Match” variable is set to the "Points Earned” value divided by the "Points Possible” value.
  • the "Percentage Match” variable indicates the degree to which there is a friendship compatibility between the user and participant.
  • the "Percentage Match” value is discretized by characterizing the level of friendship compatibility into one of three categories. That is, if the "Percentage Match” value is greater than or equal to a certain threshold value (e.g., 80%), then a "Friendship Match” variable is set to "green” indicating a high degree of friendship compatibility between the user and participant.
  • the "Percentage Match” value is less than the threshold value but greater than or equal to another threshold value (e.g., 60%), then the "Friendship Match” variable is set to "yellow” indicating a medium degree of friendship compatibility between the user and participant. Otherwise, if the "Percentage Match” value is less than both threshold values, the "Friendship Match” variable is set to "red” indicating a low degree of friendship compatibility between the user and participant.
  • another threshold value e.g. 60%
  • the matching algorithm ofthe present invention is in no way intended to be limited to Figures 12a or 12b.
  • the process of determining whether a user and retrieved participant are compatible friends may be implemented, perhaps more efficiently, using a single loop program structure, rather than a two loop program structure.
  • data is stored for each registered player corresponding to that player's interest.
  • the data is structured such that each such interest is also stored with four similar or often related interests, thus also specifying four area of interest combinations formed partly by the players interest. For example, the following:
  • members in group chat rooms are placed in such chat rooms based on a calculation of interest-based compatibility to each other member ofthe chat room.
  • the degree of compatibility among specific members ofthe chat room is conveyed by display of a light that is alternatively green, yellow, or unlit relative to each other member ofthe chat room.
  • the computation of compatibility is based on a true-false response set by each member relative to a set of pre-defined interests. Each interest is examined for each member combination and aggregated to a total number of common selected interests.
  • the interest-based compatibility is instead assessed as a function of an indication by members concerning not just a true-false response set but the degree of subscription or non-subscription a member has to each interest. That is, members are provided the opportunity to indicate on a scale of -5 to +5 the degree to which they are interested or disinterested in a given item or interest area (example: Art). The results are then accumulated to establish the degree of interest-based alignment among members. A sample interface for eliciting such information is illustrated in Figure 19d.
  • the dating website operator may choose whether the degree of interest is best assessed based on two competing approaches: (1) The total number of matching interests. (2) The degree of alignment among matching interests.
  • the algorithm to accommodate the total number of matching interests may be summarized as follows: (1) Compare each interest item for two members. (2) Ignore the interest item unless both members are interested in the item (+1 through +5) or both members are disinterested in the item (-1 through -5). (3) hi the case of mutual interest or mutual disinterest in the item, note each such occurrence as a common perspective on the interest. (4) Accumulate the total number of common perspectives. (5) Assess the degree of compatibility as a function ofthe total number of common perspectives.
  • the member_interest_match is not determined as the member has no preference for that item.
  • a differential with the neutral could also be calculated in accordance with the invention.
  • Each match between members will be aggregated to the total of common perspectives as described above. Likewise, the degree of match between members will be included in the total value of absolute differences and compared to the total of common perspectives as discussed above with respect to the degree of alignment method. Over time, as the web site operator comes to assess the validity ofthe Interests set versus the Pursuits set, the associated values ofthe Pursuits set may be adjusted to a wider or tighter range than shown above. AUTOMATIC NAVIGATION
  • Step 640 the web server 11 next increments the "Room Points” value for the retrieved room by three if "Relationship Match” has a value of "true.”
  • Step 645 the web server 11 increments the "Room Points” value for the retrieved room by two if "Friendship Match” has a value of "green.”
  • Step 650 the web server 11 increments the "Room Points” value for the retrieved room by one if "Friendship Match” has a value of "yellow.” If none of these conditions apply, then the "Room Points" value for the retrieved room is not incremented as a result of processing ofthe participant retrieved in Step 625.
  • Step 655 the server 11 checks whether the
  • Step 660 the server 11 determines whether the value of "Room Points" for the retrieved room exceeds the value currently stored in the "MaxPoints" variable. (Note that this condition will always be satisfied for the first room retrieved in the process depicted in Figure 11). If so, then the "MaxPoints" variable is set to the "Room Points” value for the retrieved room and the "Room Chosen” variable is set to the retrieved room.
  • Step 665 the server 11 determines whether the retrieved room is the last to be processed in the selected sub-lobby.
  • steps 610 through 660 are repeated until all rooms in the selected sub-lobby have been retrieved and processed.
  • "MaxPoints” is always set to the "RoomPoints” value for the room having the greatest “Room Points” while "Room Chosen” is assigned a value identifying that room.
  • Step 670 the "Room Chosen” variable is returned as an indicator ofthe chat room having the most optimally compatible participants.
  • Step 480 once the chat room is determined, whether automatically in accordance with the "Room Chosen" variable discussed in connection with Figure 11 or manually by the user, the web server 11 (or a chat server) finally serves a page representation of a chat room environment corresponding to the chat room determined in Step 460 or 450.
  • the page representing a chat room environment may also be generated locally by chat software on the client 99.
  • the chat server and web server may represent respective software components on a single physical server).
  • An exemplary page representing a chat environment and facilitating an Internet Relay in accordance with the presently described embodiment is shown in Figures 24 an 24a.
  • Internet Relay Chat is known in the art as a conventional way for Internet subscribers to "chat" with one another via keyboards 195 in real time.
  • the client 20 may have any chat client software installed thereon that connects to a chat server.
  • the user's client 20 has chat client software installed that may be downloaded from the dating related web site in conventional fashion.
  • the client 20 is also connected and logged on to a chat server and channel upon receipt ofthe chat room page of Figure 24 and 24a. In Figures 24 and 24c, the messages are viewed from the large center window depicted.
  • chat server is connected in the Internet with other chat servers in conventional "spanning tree" fashion (shown in Figure 25) to speed the transmission of participant messages from server to server.
  • User messages are sent from the keyboard 195 by the client chat software to the connected chat server and are then broadcast from chat server to other chat servers to which participants have access. Messages are thus broadcast to the client software of other participants logged in to the chat room selected in real time, and such participants have the same ability to generate and broadcast messages.
  • each message is associated with a handle identifying the sender ofthe message, ha the chat environment depicted in Figure 24, the screen names (e.g., "kim,” “shelly,” “ken") stored in participant user files function as such handles.
  • the screen image icons stored in participant profiles are also associated with the chat participants in the chat environment depicted in Figure 24. (Again, these icons may represent pre-defined icons that allow the participants to maintain anonymity, or actual photos ofthe participants as shown in the alternative chat room environment depicted in Figure 24).
  • a checkmark will be shown in the relationship possibility indicator displayed with the screen icon, screen name and gender ofthe participant.
  • the web server 11 determines whether there is a relationship match among chat participants in accordance with the exemplary algorithm discussed in connection with Figure 12a.
  • a separate chat server performs those functions required to facilitate chat functionality.
  • a green light will be shown in the friendship possibility indicator displayed with the screen icon, screen name and gender ofthe participant.
  • the web server 11 may determine the extent of friendship compatibility among chat participants and whether that compatibility exceeds a threshold indicating a friendship match (i.e., "green") in accordance with the exemplary algorithm discussed in connection with Figure 12b and the weighting algorithms described above.
  • the web server 11 (or chat server) will continually monitor the profiles of all players on the system and advise the participants when rooms develop that have more Friendship or Relationship matches than the chat in which they are currently participating. This determination may be derived by repeatedly executing an algorithm such as the exemplary algorithm discussed in connection with Figure 10.
  • FIG. 24b shows a series of chat messages among participants
  • the user and that participant may choose to take advantage of a "virtual date" feature.
  • the screen in Figure 24b also features a "Send Private Message" button.
  • the web server 11 or chat server responds by forwarding data corresponding to a screen such as that shown in Figure 24c.
  • the user elects to send a private message and a "Send a Private Message Screen" is caused to be served from the web sever 11 (or chat server).
  • An exemplary screen interface is depicted in Figure 24d. This screen allows the user to specify a private message which is sent to only the recipient indicated in the "Player Name" field.
  • the client computer Upon selection ofthe "Send” button, the client computer generates packets comprising the specified message destined for the web server 11 (or chat server(s)).
  • the web server (chat server 11) maintains a network address listing for the computer of each participant in the chat room and maintains associations between participant identifiers and corresponding network addresses in accordance with techniques known in the art.
  • the web server (chat server) 11 can complete the private message by causing the message to be sent only to the computer corresponding to the recipient specified by the sender. In this way, participants can conduct private virtual conversations that may express interests and feelings they do not wish to make public.
  • Step 800 one ofthe two conversants decides to book a private room.
  • the player selects the "Book a Private Room" button shown in Figure 24d.
  • the web server 11 serves data corresponding to a screen such as that shown in Figure 24e.
  • the screen gives the player the option of booking a room and inviting another player to the private room.
  • the web server 11 causes a screen such as that depicted in Figure 24f to be served to the invited player's computer. Again, this is accomplished as the web server 11 maintains lists of network addresses and corresponding participants for each participant in the chat room.
  • the invite player selects the "Accept" button.
  • Step 810 data corresponding to a screen such as that shown in Figure 24g is served to both players' computers.
  • the page allows the players to engage in a private chat.
  • an interface such as that shown in Figure 24h is displayed on both player screens.
  • the screen provides choices corresponding to virtual activities the players may engage in.
  • chat chat server 11 allows the players to participate in a private chat. In this way, the players can discuss a choice before making it.
  • one ofthe players selects the "Interactive Movies" selection.
  • a screen such as that shown in Figure 24i is displayed on both player screens.
  • the interface allows the players to select the interactive movie clip, or "Virtual Date," that the players wish to see.
  • the players may select an "Island Getaway” vacation or a "Space Fantasy” vacation, hi the presently described embodiment, an interface such as that depicted in Figure 24j is also displayed on the player screens allowing each player to specify an icon that will represent them during he course of their "virtual date.”
  • Step 830 hi response to the players' selections, in Step 830, a digital video clip corresponding to the choice is downloaded and executed on both player client computers using techniques known in the art.
  • the clip also displays two icons — one male and one female — that are displayed as taking part in the video clip.
  • the players respective icons respond in interactive fashion —that is, the icons are controlled by each player. For example, in some scenes a layer could elect to initiate a 'hug' action which would cause the screens to both players to show a 'hug' sequence.
  • the interactive movies also include sound effects that can be initiated by one player and heard by both.
  • the both players are given the continued ability to engage in private chat as depicted in the upper left corner of Figure 24k and Steps 830 and 840 of Figure vl3.
  • the information provided by the prospective member when joining the dating system of the invention is used in accordance with the invention to evaluate and filter the member database to facilitate the finding of a compatibility match when a member searches the member database, hi particular, the present invention permits a member to search the member database based on a member's physical appearance and/or personality as determined by the community of members.
  • This feature ofthe invention allows members for which physical appearance is a very significant criterion to search based on physical appearance while also permitting other members for which personality is a very significant criterion to search based on personality compatibility.
  • community based opinions ofthe respective members' physical appearances and personalities are used to provide more suitable matches.
  • Such a system thus accounts for gender- specific differences in approaches to dating. Of course, both approaches may be combined to provide a more robust search approach.
  • the present invention further includes two methods for evaluating the physical attractiveness and/or personality of individual members of an online dating service and factoring physical attractiveness and/or personality criteria into member searches.
  • a first approach accumulates a total number of "attractive" votes per every hundred voters to infer the degree to which someone is considered physically attractive and/or has a desirable personality, puts them in groups and then searches the member database based on the groups the user wants to see relative to his/her own ranking.
  • a second approach instead sets up a table of rankings (1 through 10) that is cross-correlated to the dominant rank ofthe members doing the ranking and then searches the member database looking for members who have been assigned a given rank by other members who have the same dominant rank as the user.
  • the physical attractiveness criteria and the relationship criteria are rated by the community and processed in the same fashion by the algorithms ofthe invention.
  • the matching algorithms will be described in the context of matching physical attractiveness with the understanding that the same algorithms may be used to match personality characteristics in accordance with the invention.
  • interfaces illustrating physical attractiveness and personality matching in accordance with the invention will be provided for purposes of clarification.
  • the system may display target members for evaluation by, for example, allowing a user to choose an option of evaluating new members, of evaluating members encountered in a chat room or other remoting service provided by the system, of evaluating members that contact that member, or of evaluating members found in a search.
  • the evaluating member's ID, target member's ID and rating are stored and the target member's rating average is updated.
  • each member ofthe member pool is evaluated as to his/her physical atfractiveness and/or personality by other members ofthe member pool.
  • the physical attractiveness evaluation is based on pictures provided by the member and is separated into two primary categories: Physically attractive or Not physically attractive.
  • the personality attractiveness evaluation is based on inputs provided by the member in response to interests, activities and other relationship criteria provided by the member in an initial or subsequent questionnaires provided by the web site.
  • members rank other members' pictures according to whether the member being ranked is judged to be: Very physically attractive Above average physically atfractive Average physically attractive Not physically attractive Members receive no (0) points if the ranking member assigns the characteristic of "Not physically attractive” and receive one (1) point if the ranking member assigns any other ofthe three remaining characteristics "Very physically attractive", “Above average physically attractive", or "Average physically attractive”. A tally of points is maintained and members are placed into one of four groups based on the total number of points they have accumulated. Of course, members may also be granted more points for being more physically attractive.
  • the system cannot know how each member views every other member since there are too many members to whom each member would have to provide rankings. Consequently, the system will have to infer the classification that a given member would choose to assign to another given member. To accomplish this inference, the system refers to the population of members who have received rankings from other members and correlates those rankings to the rank received by the member who is conducting the search. Note that, to be eligible to conduct an appearance based search, a member preferably will have to have received a predetermined number of rankings, e.g., at least 50 rankings.
  • the groups are delineated by the average number of points received by the members. The group delineations can be modified up or down to reflect whether members believe the site is accurately classifying the physical atfractiveness of the pool of members.
  • the determination ofthe group to which a member is assigned depends on the total points accumulated by that member relative to the number of members who ranked the member.
  • a member was judged to be physically attractive by all 100 members who provided rankings, that member would receive a score of 100. If a member was judged to be physically attractive by 70 members who provided rankings, that member would receive a score of 70. If a member was judged to be physically attractive by 50 members who provided rankings, that member would receive a score of 50. If a member was judged to be physically attractive by
  • the searching member has received at least 50 rankings from other members and that the average of those rankings has resulted in their accumulating 68 points which then places them in the 3 rd group. Further assume that the profile ofthe searching member indicates his/her desire to meet other members who are in the category directly below him/her. No member is informed as to the category to which he/she has been assigned or the category to which other members have been assigned. However, the online dating site knows that the group directly below this member is the 4 th group. Accordingly, the results ofthe search will include only those members who are classified in the 4 th group. [Of course, the searching member will have specified other filtering criteria such as a desired age range, location, etc.
  • the determination can be applied in two ways. For one, the member may be informed of his/her degree of harshness in ranking other members of his/her group and may be asked to indicate whether he/she only wants to see the top 10%, 35%, 70% or 100% ofthe group. For another, the Category Percentile Cutoffs from Table 2 applied by the community to all its ranked members may be upwardly adjusted so that the 1 st group includes only the most physically attractive members ofthe "Very physically attractive" group, the 2 nd group includes more "Very physically attractive” members and less “Average physically attractive” members, and so on.
  • the system ofthe invention may determine the compatibility of website members from the indications by members of their areas of interest and place compatible members in the same chat room. If it is further hypothesized that the extent to which members may be easy or harsh judges of other members is an important additional indicator of the likelihood of a personality match, hi other words, harsh judges of other members may be well regarded by other harsh judges and may be generally disliked by easy judges. The determination of whether a member is a harsh or easy judge of other members is made independently of how the member might view themselves in this regard so the validity ofthe determination is more assured.
  • This personality feature is employed as a criterion upon which to associate members in the chat rooms and that members can search just as they might search on criteria such as age ranges, location, and gender. Providing an order to assign to the search results as to those members who have been previously judged by the searching member. [0187]
  • the order in which profiles are displayed to the searching member who has elected to use physical attractiveness as a criterion can be set to the extent the searching member may have previously ranked members who are now included in the returned profile list. For example, members who the searching member ranked as "Very physically attractive" will be displayed first then followed by members who the members ofthe searching members group ranked as "Very physically attractive" and so on through the following categories.
  • searching member ranked as "Not physically attractive” will be eliminated in the search results even though the community placed them in the searching member's group.
  • the application ofthe criteria of physical attractiveness to limit the search results provided to a searching member has been illustrated above. Also of importance is the acceptability ofthe searching member to each member included in the list of profiles compiled by the search. Some searching members may not be concerned with whether the members ofthe returned list will be likewise attracted to them. Other members will prefer to further narrow the list only to those members for whom there is two-way attraction. Further, some members may elect to block other members from being able to see them on the system if the other members do not fall into the group to which the searching member has been classified.
  • each member who elects to block or "hide” from other members will be given the choice to specify a range of other groups that are acceptable to him/her. For example, a person in the 1 st group might elect to be visible to members ofthe 2 nd and 3 rd group but not to be visible to members ofthe 1 st and 4 th group.
  • the online dating site operator does not provide or assume those judgments. [0189] All the tests and methodology described above as they are applied to the searching member can be equally applied to the members who are included in the list of members meeting the searching member's qualifications. For those members who elect to narrow the list to only display two-way matches, the web-site will eliminate members from the list when the searching member is not in a category of physical attractiveness the listed member wishes to meet.
  • the "clicking" (searching) member will be unable to email or "Quick Message" profiles of members who have excluded them due to physical incompatibility.
  • excluded members will not see the picture, profile information, or the chat messages of members that excluded them on the physical attractiveness criteria.
  • the present invention provides a mechanism where members rated as "not attractive” by the searcher are automatically deleted from any search results and members not rated by the searcher but collectively rated as being outside ofthe searcher's range for "physical attractiveness” also may be deleted from the search results.
  • This feature minimizes the possibility of a more attractive person being approached by a person to whom he/she is not attracted in an environment which would otherwise have placed them "face to face”.
  • This solution also minimizes the occurrences of members quitting because they are emailed too frequently by members to whom they are not attracted. Such a problem is magnified when the contact is immediate as in the case ofthe chat environment.
  • the first "physical attractiveness" method ofthe invention may be implemented in the matching (search) software loaded on the online dating service's website.
  • Sample pseudocode for implementing the techniques ofthe first method are set forth below: 1) User Interaction: Evaluation of Target Member
  • Group 1 - Attractive votes divided by total votes 0% to 25%
  • Group 2 - Atfractive votes divided by total votes 26% to 50%
  • Group 3 - Attractive votes divided by total votes 51% to 75%
  • Group 4 - Attractive votes divided by total votes 76% to 100%
  • Group 1 - Attractive votes divided by total votes 0% to 25%
  • Group 2 - Attractive votes divided by total votes 26% to 50%
  • Group 3 - Attractive votes divided by total votes 51% to 75%
  • Group 4 - Attractive votes divided by total votes 76% to 100%
  • Group 1 - Attractive votes divided by total votes 0% to 28%
  • Group 2 - Attractive votes divided by total votes 29% to 56%
  • Group 3 - Atfractive votes divided by total votes 57% to 83%
  • Group 4 - Attractive votes divided by total votes 84% to 100%
  • Filter_Search_Results_by_Physical_Attractiveness_Criteria_Relationship equals Yes
  • User's_Calculated_Range equal to user's physical attractiveness group plus user selected upward search range for relationships plus user selected downward search range for relationships
  • Member's_Calculated_Range equal to user's physical attractiveness group plus member selected upward search range for relationships plus member selected downward search range for relationships If user physical atfractiveness group is within Member's_Calculated_Range Include member in relationship search result Repeat
  • Filter_Search_Results_by_Physical_Attractiveness_Criteria_Friendship equals Yes
  • User's_Calculated_Range equal to user's physical atfractiveness group plus user selected upward search range for friendships plus user selected downward search range for friendships
  • Member' s_Calculated_Range equal to user's physical attractiveness group plus member selected upward search range for friendships plus member selected downward search range for friendships If user physical attractiveness group is within Member' s_Calculated_Range
  • User's_Calculated_Range equal to user's physical attractiveness group plus user selected upward search range for relationships plus user selected downward search range for relationships
  • User's_Calculated_Range equal to user's physical attractiveness group plus user selected upward search range for friendships plus user selected downward search range for friendships
  • FIG. 27 provides a sample snapshot of a profile screen for a hypothetical member.
  • the user has chosen to review the Interests section ofthe hypothetical member.
  • Above the Interests button is a button titled "Click here to Rate Physical Atfractiveness”.
  • a new screen ( Figure 28) is displayed on which the user can provide a specific ranking ofthe degree to which the user finds the member to be physically attractive. The user selects a ranking and also whether to notify the member that the user has selected a ranking.
  • the user may revisit the ranking screen of Figure 28 at a later date and review or revise his/her ranking.
  • the ranking provided by the user is compiled to the database.
  • Rankings provided by other members are also compiled to the database. Based on the rankings provided by all users who ranked this member, the member is placed within a group of members and the groups are delineated by the level to which users found the member to be physically attractive. As noted above, different users may judge member pictures more easily or harshly than all the members as a whole. To address this, a ratio is determined and then applied to adjust the cutoffs used to delineate the groups.
  • FIG. 29 illustrates a sample screen showing search results including members meeting physical attractiveness criteria and any other selected criteria that are returned for review by the user.
  • the screen illustrated in Figure 32 users can restrict the display of their profile while in a chat room to other members within the member database based on the other members' physical attractiveness.
  • members may appear or not appear to other members in a chat room based on display criteria including members' physical attractiveness and member selections concerning display of their profile while in chat rooms.
  • the invention also allows the user to filter potential mates using personality attractiveness as a criteria.
  • Figure 34 illustrates a snapshot of a set of members returned from a hypothetical database search, hi the right panel, is a button, "Rate Attractiveness", that the user can click to be taken to a screen that will let the user assign a ranking ofthe degree to which he/she finds that member to possess an attractive personality. The user may then evaluate a target member by clicking the Rate Attractiveness button. A new screen, such as that in Figure 35, is displayed on which the user can provide a ranking ofthe degree to which the user finds the member to have an attractive personality. The user selects a ranking from those offered in Figure 35 and may revisit the ranking screen below at a later date and review or revise his/her ranking.
  • the evaluation may be adjusted after the meeting to reflect the actual personality ofthe rated person (at least from the perspective ofthe reviewer).
  • the evaluation is based on information provided by members concerning their Interests and Pursuits and their responses to essay questions. Examples ofthe screens members complete to convey this information are illustrated in Figures 36-38.
  • Figure 36 illusfrates several ofthe approximately 40 Interest and Pursuit categories that become visible as the user continues to scroll down the page.
  • the actual list of interests and pursuits is not shown in Figure 36.
  • the interests and pursuits are provided in accordance with a rating key indicating the extent ofthe person's interest in the listed interest or pursuit.
  • additional Pursuit categories appear as the user continues to scroll down the page.
  • additional questions may appear as the user continues to scroll down the page. These questions allow the member to describe himself/herself in his/her own words.
  • the user Based on information such as that provided by a member in response to the input screens of Figures 36-38, the user ranks the personality ofthe target member.
  • the ranking provided by the user is then compiled to the database along with the rankings provided by other members.
  • the system ofthe invention then derives the average rank ofthe target member based on the compiled rankings. Based on the rankings provided by all users who ranked this member, the member is placed within a group of members and the groups are delineated by the level to which users found the member to have an attractive personality. Since different users may judge members' personalities more easily or harshly than all the members as a whole, a ratio is determined as in the physical atfractiveness example above and then applied to adjust the cutoffs used to delineate the groups.
  • Users can search the member database employing the criteria of personality attractiveness to filter the list of members who are returned for their review.
  • the sample screen of Figure 39 illustrates how users may specify a profile for personality attractiveness settings
  • Figure 40 illustrates how user may restrict the display of their profile to other members within the member database based on the other members' personality attractiveness.
  • members meeting personality attractiveness criteria and any other selected criteria are returned for review.
  • users may restrict the display of their profile while in a chat room to other members within the member database based on the other members' personality attractiveness.
  • members appear or do not appear to other members in a chat room based on display criteria including members' personality atfractiveness and member selections concerning display of their profile while in chat rooms.
  • the system creates atfractiveness pools for user groupings.
  • the system may elect to create 10 pools where the first pool is the lower boundary (users chosen as least attractive by other members) and the tenth pool is the upper boundary (users chosen as most attractive by other members).
  • a rating description table is created to hold the rating pool numbers and rating pool descriptions.
  • the system may also create a system ranking table which holds the user's LD, the user's system rank, the target member LD, the rating given to a target member by the user, and the date the rating was inserted and/or updated.
  • the system also creates a member attractiveness table to hold the system pool number, the target member ID, and the target member's average rating.
  • a user becomes a member of the system by completing a member application identifying member interests, basic user information, and a picture ofthe member.
  • each member ofthe member pool is evaluated as to his/her physical and/or personality attractiveness by other members ofthe pool.
  • the physical attractiveness evaluation is based on pictures provided by the member and is separated into ten primary categories, "1 through 10" to reflect whether a member is not attracted to the featured member which would result in a score of 1, extremely attracted to the featured member which would result in a score of 10, or attracted to some level between 2 and 9.
  • the personality attractiveness evaluation is based on interests and pursuits and other personal information provided by a member.
  • the second method could employ the same groupings as are used by the first method. In either case, the logic ofthe method will remain the same.
  • the second embodiment will now be described in the context of a physical atfractiveness evaluation; however, as in the first embodiment, the same algorithm may be used for the personality attractiveness algorithm except that the personality attractiveness data is used in place of physical attractiveness data.
  • a score ranging between 1 and 10 to measure the physical attractiveness ofthe target member to the evaluating member is specified and stored by the web-site for future database manipulation.
  • member 2000 no member learns the scores of other members nor the scores associated with his/her own profile.
  • member 2000 When members wish to review the pool of members as sorted by physical attractiveness to the reviewing member, referred to below as member 2000, then member 2000 will specify a range below and above member 2000 's ranking to instruct the website to display the profiles of other members falling within that range.
  • Member scores are placed into ten groups, A through J, each corresponding to the series of potential rankings 1 through 10.
  • Member 2000 a heterosexual male, joins the site. Over time, various members rank member 2000 using a range between 1 through 10. The web-site maintains a record ofthe rankings that have been applied to the female members ofthe pool. Consequently, the system knows that a given female member may be ranked as a 1 by male members who are themselves predominantly ranked as 8's.
  • the methodology breaks down into two parts - female members who member 2000 will find attractive and female members who will find member 2000 attractive. There is a different approach to each query. As to female members who member 2000 will find attractive, the system does the following: First, the web-site asks member 2000 for a range of rankings relative to his own. Specifically, member 2000 is asked to specify a range below and above his own ranking for which he is interested in viewing the profiles of other members. Assume member 2000 responds that he is interested in viewing profiles that are ranked 2 points below his own ranking and 3 points above his own ranking as seen in the table above. The results in the table will be used to illustrate how profiles are assembled in response to member 2000's search inquiry.
  • the system will obtain the table of attractiveness rankings for each female member meeting any other criteria specified by member 2000 such as location and age parameters.
  • the table ofthe example female member indicates that she is viewed by male members, who are predominantly ranked as 7's, as being in groups B, C and D which carry rankings of 2, 3, and 4.
  • the range of acceptable females to member 2000 will be between 3 and 8.
  • the female member is viewed as a 2, 3, and 4 and will be preliminarily included in the search result since at. least one of her ranks falls within member 2000' s search range.
  • the next step is to determine whether member 2000 is within the female's range.
  • the logic works in the same manner. If the female has elected to restrict the display of her profile based on physical attractiveness, then the female's range is obtained from the database and the system refers to member 2000' s ranking table to determine the rank in which he is viewed by the female members of the community who have a predominate ranking equivalent to that ofthe female member and whether that rank is within the female's range.
  • the user may also decide what pools he/she wants to be visible to. For example, a user may choose to be available for searches in all pools two above and one below his/her pool.
  • the only limitation is the logical upper and lower bounds ofthe pools themselves. That is, if there are 10 pools, and the user is a member of pool 10, though the user interface may allow the user to choose to be viewed by other users in pools two above his/her pool, the system will appreciate that there are no pools above the user's pool and will discount the selection. However, this information is saved so that if the user drops to a lower pool the user will become visible to the appropriate pools. The user may change this limitation at any time.
  • the user may decide what pools he/she wishes to search within by specifying the number of pools above and below his/her pool to consider in a search.
  • the user may change this limitation at any time as well.
  • Those "target members" returned in the search will be within the user's “physical atfractiveness” boundaries and will be those members who also match any other specified preference criteria.
  • the present invention provides a mechanism where members rated as "not attractive” by the searcher are automatically deleted from any search results and members not rated by the searcher but collectively rated as being outside ofthe searcher's range for "physical attractiveness” also may be deleted from the search results.
  • This methodology answers the common complaint discussed above concerning a member's desire not to be approached by members that the member being approached is not likely to find attractive. Besides being judged an annoyance, the fact of unwanted approaches is a major reason members quit dating services. As such, this "physical attractiveness" feature ofthe invention is a substantial improvement over current online dating systems. Pseudocode
  • the second "physical attractiveness" method ofthe invention may be implemented in the matching (search) software loaded on the online dating service's website.
  • Sample pseudocode for implementing the techniques ofthe second method are set forth below:
  • the Dominant Weighted Rank ofthe Target Member equals 6. 4) Derive Weighted Validity Factor for each Vote from Group The previous section, Derive Dominant Rank of Target Member, compared how many members assigned a given rank for the target member. An adjustment is required to avoid an undue weighting by the natural preponderance of members who would be expected to be viewed as being of average physical attractiveness. The following algorithm is included to compensate for clusters of predominate rankings.
  • User Interaction User Search Preference - Relationships User Search Preference - Friendships Display user profile search preferences Where category equals User Search Preference for Relationships Set Filter_Search_Results_by_Physical_Atfractiveness_Criteria_Relationship to No Let user select whether to filter members by criteria of physical attractiveness If user selects to filter members by criteria of physical attractiveness Set Filter_Search_Resultsj3y_Physical_Attractiveness_Criteria_Relationship to Yes Let user select rankings (from one to ten) to be included in members returned to user from user- defined database search Store selection Where category equals User Search Preference for Friendships Set Filter_Search_Results_by_Physical_Attractiveness_Criteria_Friendship to No Let user select whether to filter members by criteria of physical atfractiveness If user selects to filter members by criteria of physical attractiveness Set Filter_Search_Results_by_Physical_Attractiveness_Criteria_Friendship
  • User's_Evaluated_Range equal to specific physical attractiveness rankings selected by user
  • User's_Calculated_Range equal to user's dominant physical attractiveness rank plus user selected upward search range for relationships plus user selected downward search range for relationships
  • Member's_Evaluated_Range equal to specific physical attractiveness rankings selected by member If member provided ranking is not within Member' s_Evaluated_Range do next member Obtain member's dominant physical atfractiveness rank From user's table of Perspective-based Ranks, obtain user's Closest Target Member Rank relative to member's dominant physical atfractiveness rank If user's Closest Target Member Rank is within Member' s_Calculated_Range for profile display Include member in relationship search result Repeat
  • User's_Evaluated_Range equal to specific physical attractiveness rankings selected by user
  • User's_Calculated_Range equal to user's dominant physical attractiveness rank plus user selected upward search range for friendships plus user selected downward search range for friendships
  • Member's_Evaluated_Range equal to specific physical attractiveness rankings selected by member If member provided ranking is not within Member' s_Evaluated_Range do next member Obtain member's dominant physical atfractiveness rank From user's table of Perspective-based Ranks, obtain user's Closest Target Member Rank relative to member's dominant physical attractiveness rank If user's Closest Target Member Rank is within Member' s_Calculated_Range for profile display Include member in friendship search result Repeat
  • User's_Evaluated_Range equal to specific physical attractiveness rankings selected by user
  • User's_Calculated_Range equal to user's physical attractiveness group plus user selected upward search range for relationships plus user selected downward search range for relationships
  • User's_Evaluated_Range equal to specific physical attractiveness rankings selected by user
  • User's_Calculated_Range equal to user's physical attractiveness group plus user selected upward search range for Friendships plus user selected downward search range for Friendships
  • the second embodiment ofthe "physical/personality atfractiveness" feature ofthe present invention also allows the user of a dating site to filter potential friends/mates using physical attractiveness and/or personality attractiveness as criteria.
  • the user may choose to review the Interests section ofthe hypothetical member, as illustrated in Figure 27.
  • the Interests button is a button titled "Click here to Rate Physical Atfractiveness.”
  • a new screen ( Figure 44) is displayed on which the user can provide a specific ranking ofthe degree to which the user finds the member to be physically attractive.
  • the user selects a ranking on scale of 1-10 and also determines whether to notify the member that the user has selected a ranking.
  • the user finishes the interaction by clicking the RECORD button whereupon the user is returned to the screen of Figure 27.
  • the user may revisit the ranking screen of Figure 44 at a later date and review or revise his/her ranking.
  • the ranking provided by the user in conjunction with the user's dominant rank as seen by the other members ofthe member's database is compiled to a table for the target member.
  • Users can search the member database employing the criteria of physical attractiveness to filter the list of members who are returned for their review. For example, as shown in Figure 35, users may specify whether to use physical attractiveness as a criterion and may specify the number of levels above and below that user's ranking to accept in the search.
  • users also can restrict the display of their profile to other members within the member database to certain levels above and below the user's level based on the other members' physical attractiveness. Members meeting such physical atfractiveness criteria and any other selected criteria ofthe type explained in detail above are returned for review. The returned information is displayed in a screen like that illustrated in Figure 31.
  • users also can restrict the display of their profile while in a chat room to other members within the member database based on the other members' physical atfractiveness. As a result, members appear or do not appear to other members in a chat room based on display criteria including members' physical attractiveness and member selections concerning display of their profile while in chat rooms.
  • a sample "results" screen is illustrated in Figure 33.
  • the invention also allows the user to filter potential mates using personality attractiveness as a criteria.
  • This embodiment may use the same sample screens illustrated in Figures 34 and 36-43 to allow the user to assign a ranking ofthe degree to which he/she finds another member to possess an atfractive personality.
  • a new screen such as that illustrated in Figure 48 is displayed on which the user can provide a ranking on a scale of, e.g., 1- 10 ofthe degree to which the user finds the member to have an attractive personality.
  • the user selects a ranking and may revisit the ranking screen below at a later date and review or revise their ranking.
  • the ranking provided by the user in conjunction with the users' dominant rank as seen by the other members ofthe members' database is compiled to a table for the target member, thereby providing a table of perspective-based ranks ofthe target member.
  • users then can search the member database employing the criteria of personality atfractiveness to filter the list of members who are returned for their review.
  • the users may also restrict the display of their profiles to others and obtain profiles in response to a searches as illustrated in connection with Figures 40- 43 with respect to the first embodiment.

Landscapes

  • Engineering & Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Information Transfer Between Computers (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

La présente invention a trait à un site Internet concernant des rencontres comportant un certain nombre de services d'intérêt à des abonnés à la recherche de partenaire ou d'ami(e). Un abonné potentiel indique d'abord une information de profil comprenant un information d'authentification, une information concernant les qualités souhaitées chez un(e) ami(e) ou partenaire, l'importance relative de catégories respectives, et une icône d'affichage à l'écran. L'information de profil est mémorisée dans une base de données associée à un serveur Web hébergeant le site de rencontres. L'abonné peut alors procéder à l'ouverture d'une session sur le site et bénéficier des environnements de forums de conversation offerts sur le site. Des groupes sont organisés de manière hiérarchique en groupes et sous-groupes d'intérêt correspondants aux thèmes et aux sous-thèmes de conversation. En outre, les écrans de groupes et de sous-groupes d'intérêt indiquent la concentration de participants compatibles dans les forums de groupes ou de sous-groupes d'intérêt correspondants permettant ainsi une navigation aisée vers un forum souhaitable. Outre la navigation manuelle, le site offre une navigation automatique permettant la recherche par l'utilisateur d'un forum de discussion avec des participants compatibles une fois la sélection d'un sous-groupe établie. Lors de sa participation dans une session de discussion, l'utilisateur et un participant peuvent choisir une option de «rencontre virtuelle» offert au niveau du site pour bénéficier d'un environnement de conversation privée et visualiser un clip vidéo privé en vue d'une rencontre. Des critères «d'attirance physique» et «d'attirance de personnalité» permettent également la sélection par l'utilisateur de membres dans la base de données sur la base de notations de communauté de l'attirance physique et/ou de l'attirance de personnalité des membres et la limitation d'accès au profil de l'utilisateur aux membres possédant une notation d'attirance à l'intérieur d'une plage définie par l'utilisateur voisine de celle de la notation d'attirance correspondante pour l'abonné.
PCT/US2004/024523 2003-08-01 2004-07-29 Service de rencontres accessible sur l'internet a appariement d'interets pondere et filtre pour le filtrage d'amis/de partenaires potentiels mettant en oeuvre des criteres d'attirance physique et/ou de personnalite Ceased WO2005013079A2 (fr)

Applications Claiming Priority (6)

Application Number Priority Date Filing Date Title
US10/632,771 US20040167794A1 (en) 2000-12-14 2003-08-01 Web based dating service with filter for filtering potential friends/mates using physical attractiveness criteria
US10/632,771 2003-08-01
US10/740,174 2003-12-18
US10/740,279 2003-12-18
US10/740,174 US20040260781A1 (en) 2000-12-14 2003-12-18 Web based dating service with weighted interests matching
US10/740,279 US20040249811A1 (en) 2000-12-14 2003-12-18 Web based dating service with filter for filtering potential friends/mates using physical and/or personality attractiveness criteria

Publications (2)

Publication Number Publication Date
WO2005013079A2 true WO2005013079A2 (fr) 2005-02-10
WO2005013079A3 WO2005013079A3 (fr) 2005-05-06

Family

ID=34119865

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2004/024523 Ceased WO2005013079A2 (fr) 2003-08-01 2004-07-29 Service de rencontres accessible sur l'internet a appariement d'interets pondere et filtre pour le filtrage d'amis/de partenaires potentiels mettant en oeuvre des criteres d'attirance physique et/ou de personnalite

Country Status (1)

Country Link
WO (1) WO2005013079A2 (fr)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7549125B2 (en) * 2003-10-23 2009-06-16 Microsoft Corporation Information picker
US7818194B2 (en) * 2007-04-13 2010-10-19 Salesforce.Com, Inc. Method and system for posting ideas to a reconfigurable website
US7831455B2 (en) * 2007-03-08 2010-11-09 Salesforce.Com, Inc. Method and system for posting ideas and weighting votes
US7840413B2 (en) 2007-05-09 2010-11-23 Salesforce.Com, Inc. Method and system for integrating idea and on-demand services
CN102955840A (zh) * 2011-08-11 2013-03-06 吉菲斯股份有限公司 共享在线社交网络中的信息的系统和方法
US8725728B1 (en) 2011-12-16 2014-05-13 Michael A. Colgan Computer based method and system of generating a visual representation of the character of a user or business based on self-rating and input from other parties
US9633380B2 (en) 2013-09-04 2017-04-25 Volodymyr Zdorovtsov Method and system for third party brokered authentication of reciprocity of interest

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7240298B2 (en) 2002-12-19 2007-07-03 Microsoft Corporation Contact page
US7418663B2 (en) 2002-12-19 2008-08-26 Microsoft Corporation Contact picker interface
US7636719B2 (en) 2002-12-19 2009-12-22 Microsoft Corporation Contact schema
US7953759B2 (en) 2004-02-17 2011-05-31 Microsoft Corporation Simplifying application access to schematized contact data

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5583763A (en) * 1993-09-09 1996-12-10 Mni Interactive Method and apparatus for recommending selections based on preferences in a multi-user system
US6052122A (en) * 1997-06-13 2000-04-18 Tele-Publishing, Inc. Method and apparatus for matching registered profiles
US6471521B1 (en) * 1998-07-31 2002-10-29 Athenium, L.L.C. System for implementing collaborative training and online learning over a computer network and related techniques
AU6392899A (en) * 1998-09-15 2000-04-03 Local2Me.Com, Inc. Dynamic matching TM of users for group communication
US20020045154A1 (en) * 2000-06-22 2002-04-18 Wood E. Vincent Method and system for determining personal characteristics of an individaul or group and using same to provide personalized advice or services
US20020040310A1 (en) * 2000-09-30 2002-04-04 Aaron Lieben Method of tracking participants'behavior in a computerized dating or matchmaking service to determine underlying feature preferences that are used to rank matches based on level of compatibility

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7549125B2 (en) * 2003-10-23 2009-06-16 Microsoft Corporation Information picker
US7831455B2 (en) * 2007-03-08 2010-11-09 Salesforce.Com, Inc. Method and system for posting ideas and weighting votes
US7818194B2 (en) * 2007-04-13 2010-10-19 Salesforce.Com, Inc. Method and system for posting ideas to a reconfigurable website
US7840413B2 (en) 2007-05-09 2010-11-23 Salesforce.Com, Inc. Method and system for integrating idea and on-demand services
CN102955840A (zh) * 2011-08-11 2013-03-06 吉菲斯股份有限公司 共享在线社交网络中的信息的系统和方法
US8725728B1 (en) 2011-12-16 2014-05-13 Michael A. Colgan Computer based method and system of generating a visual representation of the character of a user or business based on self-rating and input from other parties
US9633380B2 (en) 2013-09-04 2017-04-25 Volodymyr Zdorovtsov Method and system for third party brokered authentication of reciprocity of interest

Also Published As

Publication number Publication date
WO2005013079A3 (fr) 2005-05-06

Similar Documents

Publication Publication Date Title
US20040260781A1 (en) Web based dating service with weighted interests matching
US20040249811A1 (en) Web based dating service with filter for filtering potential friends/mates using physical and/or personality attractiveness criteria
US20040167794A1 (en) Web based dating service with filter for filtering potential friends/mates using physical attractiveness criteria
US11556544B2 (en) Search system and methods with integration of user annotations from a trust network
JP5395014B2 (ja) 信頼性ネットワークからのユーザ注釈を一体化したサーチシステム及び方法
US8775418B2 (en) Method for social search
US8117272B1 (en) Matching social network users
US9971839B1 (en) Personalizing search queries based on user membership in social network communities
Best et al. Online interactions and social capital: Distinguishing between new and existing ties
US8380801B2 (en) System for targeting third party content to users based on social networks
US8019875B1 (en) Systems and methods for indicating a user state in a social network
US6480885B1 (en) Dynamically matching users for group communications based on a threshold degree of matching of sender and recipient predetermined acceptance criteria
US8566253B2 (en) System and method for managing information flow between members of an online social network
KR101171599B1 (ko) 소셜 네트워크를 이용한 신뢰할 수 있는 사용자 생성 콘텐트에의 액세스
US20100145869A1 (en) Method for controlling the matching process in an online dating system
US20080114737A1 (en) Method and system for automatically identifying users to participate in an electronic conversation
US20040172415A1 (en) Methods, systems, and software for automated growth of intelligent on-line communities
US20130282698A1 (en) System and Method for Directing Questions to Consultants Through Profile Matching
US20040210565A1 (en) Personals advertisement affinities in a networked computer system
JP2014112407A (ja) 信頼ネットワークを含むユーザ判断を一体化したサーチシステム及び方法
Lewandowski et al. Deriving query intents from web search engine queries
WO2008073633A2 (fr) Système et procédé utilisant les goûts en matière de films pour obtenir une compatibilité
WO2005013079A2 (fr) Service de rencontres accessible sur l'internet a appariement d'interets pondere et filtre pour le filtrage d'amis/de partenaires potentiels mettant en oeuvre des criteres d'attirance physique et/ou de personnalite
Pizzato et al. Learning user preferences in online dating
CA2455693A1 (fr) Procedes, systemes et logiciel de gestion automatisee de la croissance de communautes internet evoluees

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
122 Ep: pct application non-entry in european phase