This application is related to co-pending and commonly owned U.S. patent application Ser. No. 11/929,678, titled “CONSTRUCTION, MANIPULATION, AND COMPARISON OF A MULTI-DIMENSIONAL SEMANTIC SPACE,” filed on Oct. 30, 2007, which is a divisional of U.S. patent application Ser. No. 11/562,337, filed on Nov. 21, 2006, which is a continuation of U.S. patent application Ser. No. 09/512,963, filed Feb. 25, 2000, now U.S. Pat. No. 7,152,031, issued on Dec. 19, 2006. All of the foregoing applications are fully incorporated by reference herein.
This application is also related to co-pending and commonly owned U.S. patent application Ser. No. 11/616,154, titled “SYSTEM AND METHOD OF SEMANTIC CORRELATION OF RICH CONTENT,” filed on Dec. 26,2006, which is a continuation-in-part of U.S. patent application Ser. No. 11/563,659, titled “METHOD AND MECHANISM FOR THE CREATION, MAINTENANCE, AND COMPARISON OF SEMANTIC ABSTRACTS,” filed on Nov. 27,2006, which is a continuation of U.S. patent application Ser. No. 09/615,726, filed on Jul. 13, 2000, now U.S. Pat. No. 7,197,451, issued on Mar. 27, 2007; and is a continuation-in-part of U.S. patent application Ser. No. 11/468,684, titled “WEB-ENHANCED TELEVISION EXPERIENCE,” filed on Aug. 30,2006; and is a continuation-in-part of U.S. patent application Ser. No. 09/691,629, titled “METHOD AND MECHANISM FOR SUPERPOSITIONING STATE VECTORS IN A SEMANTIC ABSTRACT,” filed on Oct. 18, 2000, now U.S. Pat. No. 7,389,225, issued on Jun. 17, 2008; and is a continuation-in-part of U.S. patent application Ser. No. 11/554,476, titled “INTENTIONAL-STANCE CHARACTERIZATION OF A GENERAL CONTENT STREAM OR REPOSITORY,” filed on Oct. 30, 2006, which is a continuation of U.S. patent application Ser. No. 09/653,713, filed on Sep. 5, 2000, now U.S. Pat. No. 7,286,977, issued on Oct. 23, 2007. All of the foregoing applications are fully incorporated by reference herein.
This application is also related to co-pending and commonly owned U.S. patent application Ser. No. 09/710,027, titled “DIRECTED SEMANTIC DOCUMENT PEDIGREE,” filed on Nov. 7, 2000, which is filly incorporated by reference herein.
This application is also related to co-pending and commonly owned U.S. patent application Ser. No. 11/638,121, titled “POLICY ENFORCEMENT VIA ATTESTATIONS,” filed on Dec. 13, 2006, which is a continuation-in-part of U.S. patent application Ser. No. 11/225,993, titled “CRAFTED IDENTITIES,” filed on Sep. 14, 2005, and is a continuation-in-part of U.S. patent application Ser. No. 11/225,994, titled “ATTESTED IDENTITIES,” filed on Sep. 14, 2005. All of the foregoing applications are fully incorporated by reference herein.
This application is also related to and fully incorporates by reference the following co-pending and commonly owned patent applications: U.S. patent application Ser. No. 12/267,279, titled “PREDICTIVE SERVICE SYSTEMS,” filed on Nov. 7, 2008; U.S. patent application Ser. No. 12/346,657, titled “IDENTITY ANALYSIS AND CORRELATION,” filed on Dec. 30, 2008; and U.S. patent application Ser. No. 12/346,662, titled “CONTENT ANALYSIS AND CORRELATION,” filed on Dec. 30, 2008.
This application also fully incorporates by reference the following commonly owned patents: U.S. Pat. No. 6,108,619, titled “METHOD AND APPARATUS FOR SEMANTIC CHARACTERIZATION OF GENERAL CONTENT STREAMS AND REPOSITORIES,” U.S. Pat. No. 7,177,922, titled “POLICY ENFORCEMENT USING THE SEMANTIC CHARACTERIZATION OF TRAFFIC,” and U.S. Pat. No. 6,650,777, titled “SEARCHING AND FILTERING CONTENT STREAMS USING CONTOUR TRANSFORMATIONS,” which is a divisional of U.S. Pat. No. 6,459,809.
The disclosed technology pertains to systems and methods for analyzing and correlating attributions.
As the amount of collaboration taking place on the Internet continues to rise, it becomes increasingly difficult but more important to be confident that the author of a particular submission is the actual author and not somebody else. It is also important to be able to identify situations in which two separate contributors are actually the same person.
Currently, search engines typically allow searches concerning a particular subject. However, such search engines allow for neither correlation of results over the results of several engines nor correlation of results over time. Some research projects involving correlations between content authored in multiple venues have been conducted, such as a University of Texas study that attempted to correlate Netflix users with IMDb review contributors in an attempt to de-anonymize the users. However, such correlation engines are not available for general purpose use on a data set of a user's choosing. Also, they do not provide the kind of results that would be easy for a novice user to understand.
An example of an attribution analysis and correlation system can include multiple communities, a content manager, persistent content, attributions, a semantic correlation module, and correlation results. For example, the content manager can receive as input a list of contributors, mine the communities for content pertaining to the contributors, and output the results into the persistent content. The semantic correlation module can then perform a semantic analysis on the persistent content and the pertinent attributions to generate the correlation results.
Embodiments of the disclosed technology can advantageously provide methods and systems for determining differences or similarities between two or more different attributions and/or contributors. For example, such methods and systems can include semantic analysis and correlation to determine whether certain content was authored by a particular contributor or whether two different contributors are actually the same person.
Embodiments of the disclosed technology can advantageously provide methods and systems for determining whether the authorship of a particular submission has changed. Embodiments of the disclosed technology can also provide methods and systems for tracking of contributor stability.
The foregoing and other features, objects, and advantages of the invention will become more readily apparent from the following detailed description, which proceeds with reference to the accompanying drawings.
Embodiments of the disclosed technology, such as the exemplary embodiments described below, can advantageously provide methods and systems for determining differences or similarities between attributions from multiple contributors. Such embodiments can assist a user in identifying a certain contributor and/or determining whether authorship of a particular submission has changed, for example.
Exemplary Contributors, Attributions, and Communities
As used herein, a contributor or collaborator generally refers to a user that provides online content (e.g., online contributions such as posted information). For example, a contributor can include a user that authors and posts submissions (e.g., documents, articles, blog entries, or other information) to an online community as part of a collaboration. As used herein, contributions (e.g., online contributions) that are each attributed to a particular contributor (e.g., user or persona) will generally be referred to as attributions.
A contributor or collaborator can refer to a particular user or to a particular user's persona (e.g., a generated identity that can allow the true identity of the user to remain anonymous). Thus, a single user can be credited as multiple contributors if he or she uses or has used multiple personas, each of which constitutes or constituted a separate contributor.
As used herein, communities generally refer to online user groups or collaborations. A user can provide links of his or her membership or association with one or more communities. The user can also provide summaries of his or her membership in a particular community (e.g., using a persona). In general, a user can be a member of many different communities. A user can also have multiple personas that all belong to the same community.
In general, for any given community, a member user can provide a statement of intent describing why the user (or one or more of the user's pertinent personas) is a member of the community and what the user hopes to gain by his or her membership in the community. In certain embodiments, such a statement of intent is withheld (e.g., not shared) with the rest of the community. Other information concerning the user's (or persona's) membership in the community can also be withheld from the community.
In certain embodiments of the disclosed technology, the membership information of a particular user (or one or more of the user's personas) for a certain community is not known (e.g., not public) but can be derived (e.g., in an ad hoc manner) via analysis of the community content.
Exemplary Attribution Analysis and Correlation System
A user can provide a list of contributors (e.g., personas) that the user wishes to evaluate. For example, if the user wishes to determine a measure of similarity or difference between contributor A and contributor B, the user would provide a list including contributors A and B. Alternatively, the list can consist of a single contributor in the event that the user is curious as to the likelihood that the contributor is no longer than the same person, for example.
Based on the list provided by the user, the content manager 104 can retrieve all pertinent attributions (e.g., contributions attributed respectively to contributors A and B) from the attributions 108. Based on the attributions retrieved from the attributions 108, the content manager 104 can mine (e.g., search) the communities 102 for content pertaining to (e.g., referencing, related to, and/or containing) any of the pertinent attributions.
The content manager 104 can save the results of the mining in the persistent content 106. For example, persistent links to the mined content can be saved in the persistent content 106. Alternatively (in situations where network links are not persistent, for example), a copy of the content itself can be saved in the persistent content 106.
Based on the persistent content 106 (and, in certain embodiments, the attributions 108), the semantic correlation module 110 can perform at least one type of semantic analysis (e.g., semantic and/or writing style correlation) on contributors A and B. The semantic correlation module 110 can produce as output correlation results 112, which can provide information pertaining to similarities and/or differences between contributors A and B.
The correlation results 112 can be stored (e.g., in local memory or in a database) and/or outputted to a display. In certain embodiments, a dashboard utility (not shown) can be used to provide a graphical representation of information pertaining to one or more of the correlation results 112.
Exemplary Content Management Service
In certain embodiments, a user can generate a list of contributors from one or more of the communities 206A-206N for evaluation. For example, during the course of a particular collaboration, the user may desire to ascertain the probability of pertinent attributions (e.g., contributions attributed to certain contributors) being the same or different. Thus, the user can provide to the content manager 204 search criteria that can include an intent declaration. The search criteria provided by the user can be saved for future reuse and can also be combined with other saved search criteria, for example.
The content manager 204 can mine (e.g., search) one or more of the communities 206A-206N for pertinent attributions 202A-202N. In certain embodiments, the content manager 204 can use one or more search engines that can include commonly available search engines such as Yahoo! or Google, for example, to search public content. The content manager 204 can also use private search engines that can access both public and private content.
The content manager 204 can provide as output results of the search (e.g., mined content), which can be advantageously stored as persistent content 208. The persistent content 208 can include links (e.g., persistent links) to the mined content. Alternatively (such as in situations where network links are not persistent, for example), a copy of the mined content itself can be stored in the persistent content 208.
In certain embodiments, a user can specify that all members of a community are to be evaluated. While such embodiments typically involve a greater resource requirement that those involving a simple declared list, the identity or identities of some or all members of the community can be advantageously derived by way of attribution analysis and correlation rather than relying on community registration records, which are often known to contain mistaken or possibly even fraudulent information.
Exemplary Semantic Correlation Service
In the example, the semantic correlation module 306 can evaluate (e.g., analyze and correlate) the persistent content 302 and pertinent attributions 304 and, based on the evaluating, generate the correlation results 308. The semantic correlation module 306 can utilize one or more of several different types of analysis and correlation mechanisms (e.g., semantic and/or writing style correlation) by comparing attributions of each of the contributors to be evaluated, for example. As part of the evaluation, the semantic correlation module 306 may construct and/or compare multiple semantic abstracts based on the persistent content 302 (and, in some cases, the attributions 304), for example.
Intermediate results of the semantic correlation module 306 can be advantageously saved (not shown) so that future requests can use already completed analysis and correlation, for example.
In certain embodiments, the semantic correlation module 306 can evaluate suspect content on a timeline to determine whether a change in authorship occurred at a specific time or date (or within a certain date/time range). The semantic correlation module 306 can use public information concerning a contributor to verify timeline information.
Consider an example in which a user wishes to determine the likelihood of a certain contributor being the author of a particular content that was just published (e.g., submitted). In the example, the contributor has published his or her calendar, which indicates that he or she is currently on vacation. If the semantic correlation module 306 determines that the contributor in question has never published content while on previous vacations, then the semantic correlation module 306 may determine a low probability that the particular content was authored by the suspect contributor. One having ordinary skill in the art will appreciate that this is but one of the many types of analysis the semantic correlation module 306 can perform as part of the evaluation process.
Consider another example in which the suspect contributor is known to be presently ill or undergoing surgery. In the example, the semantic correlation module 306 may determine, based on the illness or surgery, a low probability that the suspect contributor is the author of certain recently-published content. Again, one having ordinary skill in the art will appreciate that this is but one of the many types of analysis the semantic correlation module 306 can perform as part of the evaluation process.
In situations where a user may suspect that a particular authorship has changed, the user can identify the single contributor to a content manager, for example. Based on results of content mining within one or more communities by the content manager, the semantic correlation module 306 can perform semantic analysis and correlation on the mined content (e.g., on a timeline basis) to determine a likelihood as to whether the suspect authorship has indeed changed along the way.
In certain embodiments, a dashboard utility (e.g., a correlation meter 310) can be used to provide a graphical representation of certain information pertaining to the correlation results 308.
Exemplary Method of Constructing a Semantic Abstract
The dominant vectors and the dominant phrase vectors can be generated at any time before the semantic abstract is created. Once the dominant vectors and dominant phrase vectors are created, the original document is not necessarily required to construct the semantic abstract.
Exemplary Method of Comparing Two Semantic Abstracts
If the semantic abstracts are within the threshold distance, then the second content is recommended to the user on the basis of being semantically similar to the first content of interest, as shown at 610. If the other semantic abstracts is not within the threshold distance of the first semantic abstract, however, then the process returns to step 604, where yet another semantic abstract is identified for another prospective content. Alternatively, if no other content can be located that is “close” to the content of interest, processing can end.
Exemplary Method of Attribution Analysis and Correlation in Accordance with Implementations of the Disclosed Technology
At 702, a user can create a list of contributors to be evaluated and send the list to a content manager, which can receive the list as input. For example, the user may list two contributors that the user suspects may be the same person. In alternative embodiments, the user may specify a single contributor that the user suspects may have changed to a different person within a certain time period.
At 704, the content manager can retrieve one or more attributions (e.g., attributions 108 of
At 706, communities are mined (e.g., using a content manager) for content pertaining to the retrieved attributions and/or contributor information. The mining can involve the use of one or more search engines that can include commonly available search engines such as Google, for example.
At 708, results of the mining can be stored as persistent content. The persistent content can be updated or modified after each mining, for example. The persistent content can correspond to one or more of the contributors to be evaluated.
At 710, a semantic analysis and correlation can be performed (e.g., using a semantic correlation module) on some or all of the persistent content in light of the pertinent attributions. A semantic correlation module can access or receive some or all of the persistent content as input, for example. Performing the semantic analysis and correlation can include generating semantic abstracts for some or all of the persistent content (and also, in certain embodiments, the pertinent attributions).
At 712, results of the semantic analysis and correlation can be generated. Such correlation results can be provided as output. In certain embodiments, a dashboard can be used to graphically display some or all of the correlation results.
General Description of a Suitable Machine in Which Embodiments of the Disclosed Technology can be Implemented
The following discussion is intended to provide a brief, general description of a suitable machine in which embodiments of the disclosed technology can be implemented. As used herein, the term “machine” is intended to broadly encompass a single machine or a system of communicatively coupled machines or devices operating together. Exemplary machines can include computing devices such as personal computers, workstations, servers, portable computers, handheld devices, tablet devices, and the like.
Typically, a machine includes a system bus to which processors, memory (e.g., random access memory (RAM), read-only memory (ROM), and other state-preserving medium), storage devices, a video interface, and input/output interface ports can be attached. The machine can also include embedded controllers such as programmable or non-programmable logic devices or arrays, Application Specific Integrated Circuits, embedded computers, smart cards, and the like. The machine can be controlled, at least in part, by input from conventional input devices (e.g., keyboards and mice), as well as by directives received from another machine, interaction with a virtual reality (VR) environment, biometric feedback, or other input signal.
The machine can utilize one or more connections to one or more remote machines, such as through a network interface, modem, or other communicative coupling. Machines can be interconnected by way of a physical and/or logical network, such as an intranet, the Internet, local area networks, wide area networks, etc. One having ordinary skill in the art will appreciate that network communication can utilize various wired and/or wireless short range or long range carriers and protocols, including radio frequency (RF), satellite, microwave, Institute of Electrical and Electronics Engineers (IEEE) 545.11, Bluetooth, optical, infrared, cable, laser, etc.
Embodiments of the disclosed technology can be described by reference to or in conjunction with associated data including functions, procedures, data structures, application programs, instructions, etc. that, when accessed by a machine, can result in the machine performing tasks or defining abstract data types or low-level hardware contexts. Associated data can be stored in, for example, volatile and/or non-volatile memory (e.g., RAM and ROM) or in other storage devices and their associated storage media, which can include hard-drives, floppy-disks, optical storage, tapes, flash memory, memory sticks, digital video disks, biological storage, and other tangible, physical storage media.
Associated data can be delivered over transmission environments, including the physical and/or logical network, in the form of packets, serial data, parallel data, propagated signals, etc., and can be used in a compressed or encrypted format. Associated data can be used in a distributed environment, and stored locally and/or remotely for machine access.
Having described and illustrated the principles of the invention with reference to illustrated embodiments, it will be recognized that the illustrated embodiments may be modified in arrangement and detail without departing from such principles, and may be combined in any desired manner. And although the foregoing discussion has focused on particular embodiments, other configurations are contemplated. In particular, even though expressions such as “according to an embodiment of the invention” or the like are used herein, these phrases are meant to generally reference embodiment possibilities, and are not intended to limit the invention to particular embodiment configurations. As used herein, these terms may reference the same or different embodiments that are combinable into other embodiments.
Consequently, in view of the wide variety of permutations to the embodiments described herein, this detailed description and accompanying material is intended to be illustrative only, and should not be taken as limiting the scope of the invention. What is claimed as the invention, therefore, is all such modifications as may come within the scope and spirit of the following claims and equivalents thereto.
Number | Name | Date | Kind |
---|---|---|---|
5276677 | Ramamurthy et al. | Jan 1994 | A |
5278980 | Pedersen et al. | Jan 1994 | A |
5317507 | Gallant | May 1994 | A |
5325298 | Gallant | Jun 1994 | A |
5325444 | Cass et al. | Jun 1994 | A |
5390281 | Luciw et al. | Feb 1995 | A |
5412804 | Krishna | May 1995 | A |
5499371 | Henninger et al. | Mar 1996 | A |
5524065 | Yagasaki | Jun 1996 | A |
5539841 | Huttenlocher et al. | Jul 1996 | A |
5551049 | Kaplan et al. | Aug 1996 | A |
5619709 | Caid et al. | Apr 1997 | A |
5675819 | Schuetze | Oct 1997 | A |
5694523 | Wical | Dec 1997 | A |
5696962 | Kupiec | Dec 1997 | A |
5708825 | Sotomayor | Jan 1998 | A |
5721897 | Rubinstein | Feb 1998 | A |
5724567 | Rose et al. | Mar 1998 | A |
5768578 | Kirk et al. | Jun 1998 | A |
5778362 | Deerwester | Jul 1998 | A |
5778378 | Rubin | Jul 1998 | A |
5778397 | Kupiec et al. | Jul 1998 | A |
5794178 | Caid et al. | Aug 1998 | A |
5799276 | Komissarchik et al. | Aug 1998 | A |
5821945 | Yeo et al. | Oct 1998 | A |
5822731 | Schultz | Oct 1998 | A |
5832470 | Morita et al. | Nov 1998 | A |
5867799 | Lang et al. | Feb 1999 | A |
5873056 | Liddy et al. | Feb 1999 | A |
5873079 | Davis, III et al. | Feb 1999 | A |
5934910 | Ho et al. | Aug 1999 | A |
5937400 | Au | Aug 1999 | A |
5940821 | Wical | Aug 1999 | A |
5963965 | Vogel | Oct 1999 | A |
5966686 | Heidorn et al. | Oct 1999 | A |
5970490 | Morgenstern | Oct 1999 | A |
5974412 | Hazlehurst et al. | Oct 1999 | A |
5991713 | Unger et al. | Nov 1999 | A |
5991756 | Wu | Nov 1999 | A |
6006221 | Liddy et al. | Dec 1999 | A |
6009418 | Cooper | Dec 1999 | A |
6015044 | Peterson | Jan 2000 | A |
6041311 | Chislenko et al. | Mar 2000 | A |
6076088 | Paik et al. | Jun 2000 | A |
6078953 | Vaid et al. | Jun 2000 | A |
6085201 | Tso | Jul 2000 | A |
6097697 | Yao et al. | Aug 2000 | A |
6105044 | DeRose et al. | Aug 2000 | A |
6108619 | Carter et al. | Aug 2000 | A |
6122628 | Castelli et al. | Sep 2000 | A |
6134532 | Lazarus et al. | Oct 2000 | A |
6141010 | Hoyle | Oct 2000 | A |
6173261 | Arai et al. | Jan 2001 | B1 |
6205456 | Nakao | Mar 2001 | B1 |
6263335 | Paik et al. | Jul 2001 | B1 |
6269362 | Broder et al. | Jul 2001 | B1 |
6289353 | Hazlehurst et al. | Sep 2001 | B1 |
6292792 | Baffes et al. | Sep 2001 | B1 |
6295092 | Hullinger et al. | Sep 2001 | B1 |
6295533 | Cohen | Sep 2001 | B2 |
6297824 | Hearst et al. | Oct 2001 | B1 |
6311194 | Sheth et al. | Oct 2001 | B1 |
6317708 | Witbrock et al. | Nov 2001 | B1 |
6317709 | Zack | Nov 2001 | B1 |
6356864 | Foltz et al. | Mar 2002 | B1 |
6363378 | Conklin et al. | Mar 2002 | B1 |
6415282 | Mukherjea et al. | Jul 2002 | B1 |
6446061 | Doerre et al. | Sep 2002 | B1 |
6446099 | Peairs | Sep 2002 | B1 |
6459809 | Jensen et al. | Oct 2002 | B1 |
6460034 | Wical | Oct 2002 | B1 |
6470307 | Turney | Oct 2002 | B1 |
6493663 | Ueda | Dec 2002 | B1 |
6513031 | Fries et al. | Jan 2003 | B1 |
6523026 | Gillis | Feb 2003 | B1 |
6606620 | Sundaresan et al. | Aug 2003 | B1 |
6615208 | Behrens et al. | Sep 2003 | B1 |
6615209 | Gomes et al. | Sep 2003 | B1 |
6675159 | Lin et al. | Jan 2004 | B1 |
6732080 | Blants | May 2004 | B1 |
6754873 | Law et al. | Jun 2004 | B1 |
7103609 | Elder et al. | Sep 2006 | B2 |
7117198 | Cronin et al. | Oct 2006 | B1 |
7152031 | Jensen et al. | Dec 2006 | B1 |
7197451 | Carter et al. | Mar 2007 | B1 |
7286977 | Carter et al. | Oct 2007 | B1 |
7389225 | Jensen et al. | Jun 2008 | B1 |
7401087 | Copperman et al. | Jul 2008 | B2 |
7475008 | Jensen et al. | Jan 2009 | B2 |
7562011 | Carter et al. | Jul 2009 | B2 |
7949728 | Rivette et al. | May 2011 | B2 |
20020161747 | Li et al. | Oct 2002 | A1 |
20020199166 | Volcani et al. | Dec 2002 | A1 |
20030033301 | Cheng et al. | Feb 2003 | A1 |
20030217047 | Marchisio | Nov 2003 | A1 |
20040122841 | Goodman et al. | Jun 2004 | A1 |
20040254920 | Brill et al. | Dec 2004 | A1 |
20050144162 | Liang | Jun 2005 | A1 |
20060020593 | Ramsaier et al. | Jan 2006 | A1 |
20060200556 | Brave et al. | Sep 2006 | A1 |
20060287898 | Murashita et al. | Dec 2006 | A1 |
20070061301 | Ramer et al. | Mar 2007 | A1 |
20070094031 | Chen | Apr 2007 | A1 |
20070106491 | Carter et al. | May 2007 | A1 |
20070106651 | Isaacson et al. | May 2007 | A1 |
20070233671 | Oztekin et al. | Oct 2007 | A1 |
20080027924 | Hamilton et al. | Jan 2008 | A1 |
20080126172 | Melamed et al. | May 2008 | A1 |
20080222574 | Coyne | Sep 2008 | A1 |
20080235189 | Rayman et al. | Sep 2008 | A1 |
20080235220 | Chen et al. | Sep 2008 | A1 |
20080309677 | Fleury et al. | Dec 2008 | A1 |
20080316227 | Fleury et al. | Dec 2008 | A1 |
20090063467 | Abhyanker | Mar 2009 | A1 |
20100082660 | Muilenburg et al. | Apr 2010 | A1 |
20100274815 | Vanasco | Oct 2010 | A1 |
Entry |
---|
“CANDID Executive Summary”; Nov. 19, 1998; pp. 1-4. |
“Methodology”; 1997; pp. 1-5. |
“Platform for Internet Content Selection (PICS)” htto://www.w3.org; 1997-2003; pp. 1-8. |
“WordNet—a lexical database for the English language”; Cognitive Science Laboratory, Princeton University, www.cogsci.princeton.edu; printed on Nov. 5, 2004; 2 pages. |
Bartell et al., “Latent Semantic Indexing is an Optimal Special Case of Multidimensional Scaling”; Dept. of Computer Science & Engineering; University of California, San Diego; 1992; 7 pages. |
Chakrabarti, Soumen, Dom, Byron, Kumar, S. Ravi, Raghavan, Prabhakar, Rajagopalan, Sridhar, and Tomkins, Andrew, “Hypersearching the Web”; Scientific American, Jun. 1999; pp. 54-60. |
Chomsky, Noam, “Language and Thought”; 1993; pp. 18-19, 22-27, 44-45, 60-61. |
Chomsky, Noam, “The Minimalist Program”; 1995; pp. 13-127. |
Chu et al., “Knowledge-Based image retrieval with spatial and temporal constructs”; IEEE; Nov. 1998; pp. 872-888. |
Cook, Vivian and Newson, Mark, “Chomsky's Universal Grammar—An Introduction”; 1988; pp. 40-74, 131-272. |
Culler, Jonathan, “Ferdinand de Saussure—Revised Edition”; 1986; pp. 38-57. |
Deng, “Ne Tra-V: Toward an object based video representation”; IEEE; Sep. 1998; pp. 612-627. |
Eco, Umberto, “Semiotics and the Philosophy of Language”; 1984; pp. 46-86. |
Eco, Umberto, Santambrogio, Marco, and Violi, Patrizia (editors), “Meaning and Mental Representations”; 1988; p. 221. |
Edwards R. E., “Functional Analysis: Theory and Applications”; 1965; pp. 10-13, 32-33, 50-53, 62-65, 88-103, 174-203, 224-233. |
EPIC Report, “Faulty Filters: How content filters block access to kid-friendly information on the internet”; 1997; pp. 1-8. |
Faudemay et al., “Intelligent delivery of personalized video programmes from a video database”; IEEE; 1997; pp. 172-177. |
Geiger et al., “Dynamic programming for detecting, tracking, and matching deformable contours”; 1995; pp. 294-302. |
Gudivada et al., “Design and evaluation of algorithms for image retrieval by spatial similarity”; 1995; pp. 116-144. |
Halmos, Paul R., “Naïve Set Theory”; Undergraduate Texts in Mathematics, Litton Educational Publishing; 1960; Springer-Verlag, New York, NY; 1974; pp. 56-57, 66-69. |
Han et al., “Image organization and retrieval with automatically constructed feature vectors”; 1996. |
Hocking, John G. and Young, Gail S., “Topology”; 1961; pp. 6-7, 56-59, 68-71. |
Hsu et al., “A Knowledge-Based Approach for retrieving images by content”, IEEE; Aug. 1996; pp. 522-532. |
Hutson, V. and Pym, J.S., “Applications of Functional Analysis and Operator Theory”; 1980; index, preface, and Table of Contents. |
Jain et al., “Object matching using deformable templates”; IEEE; 1996; pp. 267-278. |
Kahn, Donald W., “Topology: An Introduction to the Point-Set and Algebraic Areas”; 1975; pp. 10-15. |
Khare, Rohit and Rifkin, Adam, “Capturing the State of Distributed Systems with XML”; Oct. 26, 1997; pp. 1-12. |
Kupeev et al., “On shape similarity”; IEEE; 1994; pp. 227-231. |
Liu et al., “Partial shape classification using contour matching in distance transformation”; IEEE; Nov. 1990; pp. 1072-1080. |
Lundquist, Carol, Grossman, David A., and Frieder, Ophir, “Improving Relevance Feedback in the Vector Space Model”; 1997; ACM 0-89791-970-X; pp. 16-23. |
Mahesh, “Ontology Development for Machine Translation: Ideology and Method”; Computing Research Laboratory, New Mexico State University; 1996; 1-79. |
Mehrotra et al., “Feature based retrieval of similar shapes”; IEEE; 1993; pp. 108-115. |
Mehrotra et al., “Similar-shape retrieval in shape data management”; IEEE; 1995; pp. 57-62. |
Meier et al., “Segmentation and tracking of moving objects for content-based video coding”; IEEE; Jun. 1999; pp. 144-150. |
Mostafa et al., “A Multilevel Approach to Intelligent Information Filtering: Model. System, and Evaluation”; ACM Transactions on Information Systems, vol. 15, No. 4; Oct. 1997; pp. 368-399. |
Nes et al., “Region-based indexing in an image database”; 1997; pp. 1-9. |
Onyshkevych, B. et al., “A Lexicon for Knowledge-Based MT”; Machine Translation; 1995; pp. 1-49. |
Ozer et al., “A graph based object description for information retrieval in digital image and video libraries”; IEEE; Jun. 22, 1999; pp. 1-4. |
Pejtersen, Annelise Mark, “Semantic Information Retrieval”; Communications of the ACM, vol. 41, No. 5; Apr. 1998; pp. 90-92. |
Pesetsky, David, “Zero Syntax Experiencers and Cascades”; 1995; pp. 1-122. |
Ravela et al., “Retrieving images by similarity of visual appearance”, IEEE; 1997; pp. 67-74. |
Saber et al., “Integration of color, shape and texture for image annotation and retrieval”; IEEE; 1996; pp. 851-854. |
Singh, “Unifying Heterogeneous Information Models”; Tesserae Information Systems, Inc., http://citeseer.ist.psu.edu.com; printed on Nov. 5, 2004; pp. 1-13. |
Smith et al., “Searching for images and videos on the world-wide web”; 1996; pp. 1-17. |
Smith, George W., “Computers and Human Language”; 1991; pp. 205-257. |
Vapillon et al., “Analyzing and filtering contour deformation”; IEEE; 1998; pp. 267-271. |
Wired News, “SurfWatch Allowed Key Patent”; Nov. 16, 1998, pp. 1-3. |
Yang et al., “A similarity measure of deformable shapes”; IEEE; 1997; pp. 1455-1459. |
Aman et al., “Identifying Expressions of Emotion in Text”, TSD 2007, LNAI 4629, pp. 196-205. |
Neviarouskaya et al., “Narrowing the Social Gap among People Invoiced in Global Dialogue: Automatic Emotion Detection in Blog Posts”, ICWSM, 2007 (2 pages). |
Schneier, B., “Anonymity and the Netflix Database”, retrieved from http://www.schneier.com/blog/archives/2007/12; Dec. 18, 2007 (2 pages). |
Schneier, B., “Why Anonymous Data Sometimes Isn't”, retrieved from http://www.wired.com/politics/security/commentary/securitymatters/2007/12/securitymatters—1213; Dec. 13, 2007 (3 pages). |
“Intelligent Collaboration & Visualization”; pp. 1-16, retrieved on Apr. 17, 2009. |
“Intelligent Collaboration & Visualization”; pp. 1-16, retrieved Apr. 2009. |
Number | Date | Country | |
---|---|---|---|
20100169315 A1 | Jul 2010 | US |