This invention relates generally to social networks, and more particularly to invitations in a social network.
Social network environments present many types of invitations to users. Examples of an invitation include an advertisement, a request to join a group, a request for an information exchange, a survey, a request to write a blog entry, a request to verify a photo tag, and so forth.
It is often useful to be able to characterize major differences between two sets of users in a social network. A probability function may be useful for predicting the likelihood of a positive or negative response by a user to an invitation. In a co-pending application, the probability function may be determined from user information including keywords in selected user profiles and from the users' responses to a prior invitation. See U.S. patent application Ser. No. 11/893,797 filed on Aug. 16, 2007, entitled “System and Method for Invitation Targeting in a Web-Based Social Network.” However, those techniques do not allow for a determination of characteristics of the users who respond and/or do not respond to the invitation (e.g., what distinguishes the users who respond from the users who do not respond, how do the users who responded differ demographically from users in general and from users who do not respond, etc.). For example, the number of users who respond may not be sufficient to provide useful information or make statistically significant inferences. The raw information about the keywords used in determining the probability function may be insufficient to provide useful details about a correlation between user information and the users. Moreover, data manipulation used in determining the probability function may reduce the user information including the keywords to a format that is not easily interpreted and make it difficult to extract insights directly from the keywords or the probability function results.
In one embodiment, the present invention provides a method of using responses to an invitation for selecting keywords that are useful in determining characteristics of a user. The method includes selecting two groups of users and calculating a histogram of the keywords for each group. The histograms are compared and the keywords ranked from high to low based on the comparison. A predetermined number of the highest ranked keywords may be selected. Various criteria may be used for selecting either of the two groups. For example, the two groups may be selected from users who respond to an invitation and users who do not respond to the invitation, respectively. Alternatively, the two groups may be selected from users who are likely to respond to the invitation and a random selection of users, respectively. In some embodiments, the comparison of the histograms for the two groups may be based on an arithmetic difference between corresponding entries in the two groups for each keyword. Alternatively, the comparison may be based on a ratio difference, an information gain, an odds ratio, a relevancy score, and so forth.
In another embodiment, the invention provides a method for selecting a subset of keywords from a set of master keywords in user profiles of social network users. The method comprises computing a first histogram of each keyword in the set of master keywords based on the occurrence of the keywords in a first group of user profiles, computing a second histogram of each keyword in the set of master keywords based on the occurrence of the keywords in a second group of user profiles, computing a score based on a comparison of the first histogram and the second histogram for each keyword in the set of master keywords, ranking the master keywords based on the scores of the keywords, and selecting a subset of keywords from the master keywords based on the ranking.
The present invention provides a method for keyword selection in a web-based social network. In one embodiment, a first group and second group of users are selected. The number of occurrences of each keyword in the profiles of the users in the first group may be calculated to produce a first histogram. Likewise, a second histogram may be calculated for the second group. The first histogram may be compared to the second histogram by calculating a score for each keyword based on a difference between the number of occurrences of the keyword in the first group and the number of occurrences of the same keyword in the second group. The keywords may be ranked according to the difference calculated for each keyword, and a set of the highest ranked keywords selected. Alternatively, the comparison of the first histogram to the second histogram may be based on functions other than a difference.
The social network provider 130 is an entity or person that provides social networking services, communication services, dating services, company intranets, and/or online games, etc. The social network provider 130 may assemble and store profiles of the users 102 for use in providing the social networking services. In some embodiments, the social network environment 100 includes a segmented community, such as a separate, exclusive or semi-exclusive subset of the social network environment 100, wherein users 102 who are segmented community members may access and interact with other members of their respective segmented community. The social network environment 100 further includes a keyword extraction engine 140 coupled to the social network provider 130.
The profile database 200 manages profile information that is provided by users 102 of the social network. The profile information may contain keywords. Keywords may be words or phrases relating to information about the users 102. Keywords include words relating to demographics, interests, usage, actions, or other information that may describe each of the users 102. Keywords may be entered by the user, may be entered about the user 102, or may be inferred from other information about the user 102. A user profile may include multiple occurrences of one or more keywords. The profile information for the users 102 may be found in more than one database available to the social network provider 130, for example, the social network provider 130 and/or the keyword extraction engine 140.
The profile database 200 may store values including numerical values, binary values, and/or categorical values to represent various types of keywords. A numerical value may represent an age, a phone number, or other data normally expressed in numbers. A binary number may represent occurrence or non-occurrence of a keyword in the profile of a user 102. For example, if the keyword is football, a “1” means that the keyword “football” occurs at least once in the profile of the user 102 and a “0” means that “football” does not occur in the profile of the user 102. In some embodiments, a “1” may mean that a keyword (e.g., “football”) occurs more than a predetermined number of times. A categorical value may represent a selection from a list. For example, political views may be categorized as 1=liberal, 2=conservative, 3=independent, etc.
Demographic keywords may include information regarding age, gender, relationship status, home state, and school. Demographic keywords may be represented by numerical values, binary values, and/or categorical values. Keywords relating to interests include book titles, authors, movies, television programs, and music. In the illustrated embodiment, keywords relating to interests are represented by binary values. Examples of keywords relating to usage include information regarding friendships, blog posts, online gifts given and received via the social network provider 130, online purchases via the social network provider 130, photo uploads and downloads, photo tags, and photo tag confirmations, and may be represented by numerical values, binary values, and/or categorical values.
Table 1 illustrates various types of keywords that may be stored in the profile database 200. For example, the keyword “Birth Year” in the Keyword Names column of Table 1 is a Demographic keyword and may be represented by a numerical value. The keyword, “Political Views” is also a demographic keyword but may be represented by a categorical value (e.g., 1=liberal, 2=conservative, 3=independent, etc.). The entry “Top 5000 Favorite Movies” in the Keyword Names column represents 5000 different keywords each associated with a different one of 5000 of the most popular movie titles in the profile database, respectively. For example, the movie title “Gone With The Wind” may be a keyword. Each of the 5000 keywords is an Interest keyword and is represented by a binary value in the illustrated embodiment to indicate that the movie title occurs or does not occur in the profile of a user 102. While Demographic and Interest keyword types are illustrated in Table 1, other keyword types (e.g., contacts, skills, etc.) may also be included.
The group selection module 210 is configured to select a first group of users 102A and a second group of users 102B. The group selection module 210 may use various criteria for selecting users 102 for the first group and/or the second group. For example, an invitation may be sent to a number of users 102, and the group selection module 210 may select the users 102A from users 102 who respond positively to the invitation for the first group and the users 102B from users 102 who respond negatively to the invitation for the second group. Alternatively, the first or second group may include a random selection of all users 102.
In some embodiments, the group selection module 210 is configured to use a probability function to select the first group of users 102A and/or the second group of users 102B. The probability function may be used to calculate a probability that a user 102 will respond to an invitation. The group selection module 210 may select the users 102A from users 102 for whom the calculated probability of a positive response is greater than (or less than) a threshold. The second group may include a random selection of all users 102. Alternatively, the second group may be selected from users 102 for whom the calculated probability of a positive response is less than (or greater than) the threshold for inclusion in the first group, or another threshold. The threshold may be selected to provide a desired number of users 102A and/or 102B.
The methods of selecting two groups of users are not limited to using the various combinations of probability calculations, random selection, and/or user responses discussed above. Other methods of selecting pairs of groups may be used. For example, selection of pairs of groups may be based on activities initiated by the users 102, activities directed at the users 102 by others, inferred characteristics of the users 102, capabilities of the users 102, skill levels of the users 102, etc. More information about group selection and keyword selection is contained in a paper entitled “Personalization for Online Social Networks” by Yun-Fang Juan, et al., presently unpublished and attached hereto as an appendix.
The histogram module 220 is configured to calculate a first histogram for the first group and a second histogram for the second group. For each of the keywords, the histogram module 220 determines the number of profiles in which the keyword occurs in the first group and number of profiles in which the keyword occurs in the second group. The histogram module 220 may store the number as a percentage of the total number of profiles in the first group and the second group, respectively.
Table 2 includes “Keyword,” “First Group,” “Second Group,” and “Score” columns. Table 2 is sorted according to values in the “Score” column, which is discussed below. The “First Group” column in Table 2 represents the first histogram and the “Second Group” column represents the second histogram. Each of the keywords in the “Keyword” column is associated with a percentage in the “First Group” column and another percentage in the “Second Group” column. For example, the keyword “red hot chili peppers” is associated 6 percent in the “First Group” column and 0.9 percent in the “Second Group” column. Thus, the keyword “red hot chili peppers” occurs in 6 percent of the profiles of the users 102A in the first group and in 0.9 percent of the profiles of the users 102B in the second group.
Values other than percentages may be represented in the first and second histograms, for example, frequency of occurrences, total number of occurrences, probability of occurrence, etc. To avoid storing useless information, the histogram module 220 may omit a keyword, for example, when the keyword occurs in substantially all of the profiles or none of the profiles. While Table 2 illustrates 20 keywords, fewer or more keywords may be included in the first and the second histograms. Some of the keywords illustrated in Table 2 are demographic type keywords. For example, “politics (liberal),” “age range (20-25),” and “age range (50-55).” In some embodiments, a numerical value may be used to calculate a histogram entry. For example, an age entry for the first and the second histograms may be based on an average age, maximum age, minimum age, mean age, etc. of the users 102A in the first group and users 102B in the second group, respectively.
The score module 230 is configured to calculate a score for each keyword based on a function F(Aj, Bj) where, Aj is a value representing the jth keyword in the “First Group” column (first histogram) and Bj is a value representing jth keyword in the “Second Group” column (second histogram). An example of the function F(Aj, Bj) includes a difference between Aj and Bj. The Score column in Table 2 illustrates values representing an arithmetic difference (Aj-Bj) for each keyword. For example, the score for the keyword “red hot chili peppers” is 5.1, which is equal to 6 percent in the “First Group” column minus 0.9 percent in the “Second Group” column. In various embodiments, the score function F(Aj, Bj) includes an arithmetic difference, a ratio difference, an information gain, an odds ratio, a relevancy score, and so forth, as illustrated in Table 3.
The ranking module 240 is configured to arrange the histogram according to the scores of each keyword. The histogram may be ranked from highest score to lowest score, as illustrated in Table 2. For example, the keyword “red hot chili peppers” is ranked fifth in the histogram illustrated in Table 2. Alternatively, the histogram may be ranked from lowest score to highest score
The keyword selection module 250 may select a predetermined number of keywords from the ranked histogram. For example, keywords having the highest six scores (i.e., “24,” “sportscenter,” “wedding crashers,” “old,” “friday night lights,” and “red hot chili peppers”) may be selected from the histogram in Table 2. Alternatively, the keyword selection module 250 may select keywords having a score greater than a threshold value, before or after the ranking module 240 arranges the histogram according to score. For example, the three keywords “24,” “sportscenter,” and “wedding crashers” may be selected based on having a score greater than 7.0. In various embodiments, the keyword selection module 250 may select keywords based on other criteria, for example, a predetermined number of the keywords having the lowest scores, keywords having scores lower than a threshold value, and so on.
Although the keyword extraction engine 140 is described as being comprised of various components (i.e., the profile database 200, the group selection module 210, the histogram module 220, the score module 230, the ranking module 240, and the keyword selection module 250), fewer or more components may comprise the keyword extraction engine 140 and still fall within the scope of various embodiments.
While the method 300 is described as being comprised of various steps, fewer or more steps may comprise the process and still fall within the scope of various embodiments. The order of the steps in the method 300 may be varied and still fall within the scope the various embodiments. For example, the step 306 of computing a first histogram may be performed after the step 308 of computing the second histogram. In some embodiments, the steps of method 300 may be performed by the keyword extraction engine.
The embodiments discussed herein are illustrative of the present invention. As these embodiments of the present invention are described with reference to illustrations, various modifications or adaptations of the methods and/or specific structures described may become apparent to those skilled in the art. All such modifications, adaptations, or variations that rely upon the teachings of the present invention, and through which these teachings have advanced the art, are considered to be within the spirit and scope of the present invention. Hence, these descriptions and drawings should not be considered in a limiting sense, as it is understood that the present invention is in no way limited to only the embodiments illustrated.
This application is a continuation of U.S. application Ser. No. 13/428,765, filed Mar. 23, 2012, which is a continuation of U.S. application Ser. No. 13/214,211, filed Aug. 21, 2011, which is a continuation of U.S. application Ser. No. 11/893,820, filed Aug. 16, 2007, each of which is incorporated by reference in their entirety. This application also incorporates by reference the following: U.S. patent application Ser. No. 11/639,655 filed on Dec. 14, 2006, entitled “Systems and Methods for Social Mapping,” which in turn claims the benefit and priority of U.S. Provisional Patent Application Ser. No. 60/750,844 filed on Dec. 14, 2005, entitled “Systems and Methods for Social Mapping”; U.S. Pat. No. 7,797,256, filed on Aug. 2, 2006, entitled “Systems and Methods for Dynamically Generating Segmented Community Flyers”; U.S. Pat. No. 7,669,123, filed on Aug. 11, 2006, entitled “System and Method for Dynamically Providing a News Feed About a User of a Social Network”; U.S. patent application Ser. No. 11/580,210 filed on Oct. 11, 2006, entitled “System and Method for Tagging Digital Media”; U.S. patent application Ser. No. 11/796,184 filed on Apr. 27, 2007, entitled “Systems and Methods for Giving Gifts and Displaying Assets in a Social Network Environment,” which in turn claims the benefit and priority of U.S. Provisional Patent Application Ser. No. 60/899,121 filed on Feb. 2, 2007, entitled “Systems and Methods for Automatically Giving Gifts and Displaying Assets in a Social Network Environment”; and U.S. patent application Ser. No. 11/893,797 filed on Aug. 16, 2007, entitled “System and Method for Invitation Targeting in a Web-Based Social Network.”
Number | Name | Date | Kind |
---|---|---|---|
5937413 | Hyun et al. | Aug 1999 | A |
6029141 | Bezos et al. | Feb 2000 | A |
6963900 | Boyd | Nov 2005 | B2 |
7013292 | Hsu et al. | Mar 2006 | B1 |
7069308 | Abrams | Jun 2006 | B2 |
7249123 | Elder et al. | Jul 2007 | B2 |
7269590 | Hull et al. | Sep 2007 | B2 |
7519200 | Gokturk et al. | Apr 2009 | B2 |
7539697 | Akella et al. | May 2009 | B1 |
7606168 | Robinson et al. | Oct 2009 | B2 |
7613769 | Hess | Nov 2009 | B1 |
7797345 | Martino et al. | Sep 2010 | B1 |
7856449 | Martino et al. | Dec 2010 | B1 |
7860889 | Martino et al. | Dec 2010 | B1 |
8171128 | Zuckerberg et al. | May 2012 | B2 |
8832132 | Spertus et al. | Sep 2014 | B1 |
20010037721 | Hasegawa et al. | Nov 2001 | A1 |
20020059201 | Work | May 2002 | A1 |
20020107853 | Hofmann et al. | Aug 2002 | A1 |
20030145093 | Oren et al. | Jul 2003 | A1 |
20030222918 | Coulthard | Dec 2003 | A1 |
20030225632 | Tong et al. | Dec 2003 | A1 |
20040006470 | Kobayashi | Jan 2004 | A1 |
20040024846 | Randall et al. | Feb 2004 | A1 |
20040088177 | Travis et al. | May 2004 | A1 |
20040122686 | Hill et al. | Jun 2004 | A1 |
20040148275 | Achlioptas | Jul 2004 | A1 |
20040204973 | Witting et al. | Oct 2004 | A1 |
20050021750 | Abrams | Jan 2005 | A1 |
20050114130 | Java et al. | May 2005 | A1 |
20050114759 | Williams et al. | May 2005 | A1 |
20050120084 | Hu et al. | Jun 2005 | A1 |
20050154639 | Zetmeir | Jul 2005 | A1 |
20050159970 | Buyukkokten et al. | Jul 2005 | A1 |
20050171799 | Hull et al. | Aug 2005 | A1 |
20050171955 | Hull et al. | Aug 2005 | A1 |
20050177385 | Hull et al. | Aug 2005 | A1 |
20050197846 | Pezaris et al. | Sep 2005 | A1 |
20050198020 | Garland et al. | Sep 2005 | A1 |
20050198031 | Pezaris et al. | Sep 2005 | A1 |
20050198305 | Pezaris et al. | Sep 2005 | A1 |
20050203807 | Bezos et al. | Sep 2005 | A1 |
20050209999 | Jou | Sep 2005 | A1 |
20050216300 | Appelman et al. | Sep 2005 | A1 |
20050216550 | Paseman et al. | Sep 2005 | A1 |
20050235062 | Lunt et al. | Oct 2005 | A1 |
20050256756 | Lam et al. | Nov 2005 | A1 |
20060004892 | Lunt et al. | Jan 2006 | A1 |
20060026147 | Cone et al. | Feb 2006 | A1 |
20060041543 | Achlioptas | Feb 2006 | A1 |
20060042483 | Work et al. | Mar 2006 | A1 |
20060048059 | Etkin | Mar 2006 | A1 |
20060052091 | Onyon et al. | Mar 2006 | A1 |
20060064431 | Kishore et al. | Mar 2006 | A1 |
20060080613 | Savant | Apr 2006 | A1 |
20060085419 | Rosen | Apr 2006 | A1 |
20060106847 | Eckardt et al. | May 2006 | A1 |
20060136419 | Brydon et al. | Jun 2006 | A1 |
20060143066 | Calabria | Jun 2006 | A1 |
20060143183 | Goldberg et al. | Jun 2006 | A1 |
20060161599 | Rosen | Jul 2006 | A1 |
20060173838 | Garg et al. | Aug 2006 | A1 |
20060184617 | Nicholas et al. | Aug 2006 | A1 |
20060190281 | Kott et al. | Aug 2006 | A1 |
20060194186 | Nanda | Aug 2006 | A1 |
20060218225 | Hee Voon et al. | Sep 2006 | A1 |
20060229063 | Koch | Oct 2006 | A1 |
20060230061 | Sample et al. | Oct 2006 | A1 |
20060247940 | Zhu et al. | Nov 2006 | A1 |
20060248573 | Pannu et al. | Nov 2006 | A1 |
20060251339 | Gokturk et al. | Nov 2006 | A1 |
20060256008 | Rosenberg | Nov 2006 | A1 |
20060265227 | Sadamura et al. | Nov 2006 | A1 |
20060293976 | Nam | Dec 2006 | A1 |
20070038594 | Goodwin et al. | Feb 2007 | A1 |
20070043688 | Kountz et al. | Feb 2007 | A1 |
20070174389 | Armstrong et al. | Jul 2007 | A1 |
20070208916 | Tomita | Sep 2007 | A1 |
20070282987 | Fischer et al. | Dec 2007 | A1 |
20080005076 | Payne et al. | Jan 2008 | A1 |
20080010343 | Escaffi et al. | Jan 2008 | A1 |
20080033776 | Marchese | Feb 2008 | A1 |
20080040428 | Wei et al. | Feb 2008 | A1 |
20080070697 | Robinson et al. | Mar 2008 | A1 |
20080086458 | Robinson et al. | Apr 2008 | A1 |
20080091723 | Zuckerberg et al. | Apr 2008 | A1 |
20080281622 | Hoal | Nov 2008 | A1 |
20090049127 | Juan et al. | Feb 2009 | A1 |
20090055435 | Kiviluoto et al. | Feb 2009 | A1 |
20110185020 | Ramamurthy et al. | Jul 2011 | A1 |
20120036127 | Work et al. | Feb 2012 | A1 |
20130254192 | Work et al. | Sep 2013 | A1 |
20130290448 | Work et al. | Oct 2013 | A1 |
20130297589 | Work et al. | Nov 2013 | A1 |
Number | Date | Country |
---|---|---|
WO 2007070676 | Jun 2007 | WO |
Entry |
---|
Chipin. Chipin: The easy way to collect money [online], Dec. 15, 2006 http://web.archive.org/web/20061215090739/www.chipin.com/overview. |
Flores, F. et al., “Computer systems and the design of organizational interaction.” In ACM Transactions on Information Systems (TOIS), vol. 6, Issue 2, Apr. 1988. |
Hofmann, T. ‘Collaborative Filtering via Gaussian Probabilistic Latent Semantic Analysis’, SIGIR '03, Proceedings of 26th annual International ACM SIGIR conference on Research and development in information retrieval, Jul. 28-Aug. 1, 2003, pp. 259-266 [online]. Association of Computer Machinery [retrieved on Nov. 15, 2010]doi>10.1145/860435.860483. |
Parzek, E. Social Networking to Chipin to a Good Cause [online]. Business Design Studio, Jun. 29, 2006 http://www.businessdesignstudio.com/resources/blogger/2006/06social-netwo- rking-tochipin-to-good.html. |
PCT International Search Report and Written Opinion, PCT/US2008/008221, Oct. 1, 2008, 8 Pages. |
U.S. Appl. No. 11/493,291, filed Jul. 25, 2006, Mark Zuckerberg, Systems and Methods for Dynamically Generating a Privacy Summary. |
U.S. Appl. No. 11/499,093, filed Aug. 2, 2006, Mark Zuckerberg, Systems and Methods for Dynamically Generating Segmented Community Flyers. |
U.S. Appl. No. 11/502,757, filed Aug. 11, 2006, Andrew Bosworth, Systems and Methods for Generating Dynamic Relationship-Based Content Personalized for Members of a Web-Based Social Network. |
U.S. Appl. No. 11/503,037, filed Aug. 11, 2006, Mark Zuckerberg, Systems and Methods for Providing Dynamically Selected Media Content to a User of an Electronic Device in a Social Network Environment. |
U.S. Appl. No. 11/503,093, filed Aug. 11, 2006, Andrew Bosworth, Systems and Methods for Measuring User Affinity in a Social Network Environment. |
U.S. Appl. No. 11/503,242, filed Aug. 11, 2006, Mark Zuckerberg, System and Method for Dynamically Providing a News Feed About a User of a Social Network. |
U.S. Appl. No. 11/580,210, filed Oct. 11, 2006, Mark Zuckerberg, System and Method for Tagging Digital Media. |
U.S. Appl. No. 11/639,655, filed Dec. 14, 2006, Mark Zuckerberg, Systems and Methods for Social Mapping. |
U.S. Appl. No. 11/646,206, filed Dec. 26, 2006, Aaron Sittig, Systems and Methods for Generating a Social Timeline. |
U.S. Appl. No. 11/701,566, filed Feb. 2, 2007, Jed Stremel, System and Method for Automatic Population of a Contact File with Contact Content and Expression Content. |
U.S. Appl. No. 11/701,595, filed Feb. 2, 2007, Ezra Callahan, System and Method for Determining a Trust Level in a Social Network Environment. |
U.S. Appl. No. 11/701,698, filed Feb. 2, 2007, Jed Stremel, System and Method for Digital File Distribution. |
U.S. Appl. No. 11/701,744, filed Feb. 2, 2007, Andrew Bosworth, System and Method for Curtailing Objectionable Behavior in a Web-Based Social Network. |
U.S. Appl. No. 11/713,455, filed Feb. 28, 2007, Jed Stremel, Systems and Methods for Automatically Locating Web-Based Social Network Members. |
U.S. Appl. No. 11/726,962, filed Mar. 23, 2007, Charlie Cheever, System and Method for Confirming an Association in a Web-Based Social Network. |
U.S. Appl. No. 11/796,184, filed Apr. 27, 2007, Jared S. Morgenstern, System and Method for Giving Gifts and Displaying Assets in a Social Network Environment. |
U.S. Appl. No. 11/893,493, filed Aug. 15, 2007, Arieh Steinberg, Web-Based Social Network Badges. |
U.S. Appl. No. 11/893,559, filed Aug. 15, 2007, Adam D'Angelo, Platform for Providing a Social Context to Software Applications. |
U.S. Appl. No. 11/893,797, filed Aug. 16, 2007, Yun-Fang Juan, System and Method for Invitation Targeting in a Web-Based Social Network. |
U.S. Appl. No. 11/899,426, filed Sep. 5, 2007, Jared Morgenstern, System and Method for Collectively Giving Gifts in a Social Network Environment. |
U.S. Appl. No. 11/982,974, filed Nov. 5, 2007, Ruchi Sanghvi, Systems and Methods for a Web-Based Social Networking Environment Integrated Within One or More Computing and/or Networking Applications. |
U.S. Appl. No. 12/072,003, filed Feb. 21, 2008, Arieh Steinberg, Systems and Methods for Implementation of a Structured Query Language Interface in a Distributed Database Environment. |
U.S. Appl. No. 12/077,070, filed Mar. 13, 2008, Dave Fetterman, Systems and Methods for Network Authentication. |
U.S. Appl. No. 12/080,808, filed Apr. 2, 2008, Peter Deng, Systems and Methods for Calendaring. |
U.S. Appl. No. 12/151,734, filed May 7, 2008, Jared Morgenstern, Systems and Methods for Classified Advertising in an Authenticated Web-Based Social Network. |
U.S. Appl. No. 12/154,886, filed May 27, 2008, Nico Vera, Systems and Methods for Providing Privacy Settings for Applications Associated with a User Profile. |
U.S. Appl. No. 12/154,504, filed May 23, 2008, Adam D'Angelo, Personalized Platform for Accessing Internet Applications. |
U.S. Appl. No. 12/156,091, filed May 28, 2008, Mark Zuckerberg, Systems and Methods for Auction Based Polling. |
U.S. Appl. No. 60/965,624, filed Aug. 20, 2007, Adam D'Angelo, Systems and Methods for Targeting Advertisements in a Social Network Environment. |
U.S. Appl. No. 60/965,852, filed Aug. 22, 2007, Adam D'Angelo, Systems and Methods for Advertising. |
U.S. Appl. No. 60/966,442, filed Aug. 28, 2007, Ezra Callahan, System and Method for Incorporating an Entity or Group other than a Natural Person into a Social Network. |
U.S. Appl. No. 60/967,842, filed Sep. 7, 2007, Ezra Callahan, Systems and Methods for Dynamically Updating Privacy Settings. |
U.S. Appl. No. 61/005,614, filed Dec. 5, 2007, Yishan Wong, Systems and Methods for Community Translations on a Web-Based Social Network. |
United States Office Action, U.S. Appl. No. 13/428,765, Aug. 20, 2015, six pages. |
United States Office Action, U.S. Appl. No. 13/214,211, Dec. 2, 2011, nine pages. |
United States Office Action, U.S. Appl. No. 11/893,820, Nov. 29, 2010, 18 pages. |
Number | Date | Country | |
---|---|---|---|
20160379316 A1 | Dec 2016 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13428765 | Mar 2012 | US |
Child | 15263224 | US | |
Parent | 13214211 | Aug 2011 | US |
Child | 13428765 | US | |
Parent | 11893820 | Aug 2007 | US |
Child | 13214211 | US |