US20110099164A1 - Apparatus and method for search and retrieval of documents and advertising targeting - Google Patents
Apparatus and method for search and retrieval of documents and advertising targeting Download PDFInfo
- Publication number
- US20110099164A1 US20110099164A1 US12/909,703 US90970310A US2011099164A1 US 20110099164 A1 US20110099164 A1 US 20110099164A1 US 90970310 A US90970310 A US 90970310A US 2011099164 A1 US2011099164 A1 US 2011099164A1
- Authority
- US
- United States
- Prior art keywords
- query
- user
- search
- stored
- queries
- 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.)
- Abandoned
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/06—Generation of reports
- H04L43/065—Generation of reports related to network devices
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/33—Querying
- G06F16/332—Query formulation
- G06F16/3322—Query formulation using system suggestions
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N7/00—Computing arrangements based on specific mathematical models
- G06N7/01—Probabilistic graphical models, e.g. probabilistic networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/04—Processing captured monitoring data, e.g. for logfile generation
- H04L43/045—Processing captured monitoring data, e.g. for logfile generation for graphical visualisation of monitoring data
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0805—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/16—Threshold monitoring
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/535—Tracking the activity of the user
Definitions
- the invention is related to the field of digital information management and, in particular, to search and retrieval of the same.
- Natural language query is one suggested replacement for Boolean query method.
- search Insider www.searchinsider.com
- search engines such as AltaVista and Yahoo (www.yahoo.com) provide require much improvement.
- the present status of information search and retrieval in the Internet is characterized by long and tedious search process, poor relevancy of retrieved documents and low level of success in retrieval of relevant documents.
- the system comprises a Server, Clients having a Human Interface (H/I) and communication with the server, a Database, a connection to the Internet and Software of that system.
- H/I Human Interface
- a User of the Client is using the H/I to compose a query view various information pieces including retrieved documents or titles or summary of those documents.
- the Software traces the user's search activity, collecting data such as queries and relevant or irrelevant documents and information sources. The data is evaluated and stored in the Database.
- the data is also compared to other data, collected from all users, available from the Database.
- a data that is relevant to assist the current search process is presented to the user.
- This data include highly ranked queries that are similar to the query composed by the current user and highly ranked documents retrieved in the past by those queries.
- the Database is the accumulation of many such search processes, made by a single user or by many users, in the same subject, the current user can benefit from the many hours invested by himself or by others to find information in this subject.
- This method is effective for a single user searching the internet or his own computer and it is particularly effective when used within an organization or work group, whereas the organization members search for information that is relevant to the activity of that organization.
- the Database generated overtime is highly relevant to all members of such organization or work group.
- FIG. 1 is a diagrammatic representation of FIG. 1 .
- FIG. 2 is a diagrammatic representation of FIG. 1 .
- FIG. 3A and FIG. 3B (referred to as FIG. 3 ).
- a workflow chart describing a preferred process of working with the system of the present invention.
- System 100 for search and retrieval of documents includes:
- System 100 is also connected to at least one source of digital information 116 by communication means 118 .
- a source of digital information is the Internet. This connection may be done using any method, some of the methods are described in “Using the Internet”, 2nd edition by Mary Ann Pike, ⁇ 1995.
- system 100 can be implemented in a single computer, on a web-server or using any other infrastructure or technology.
- Initial search is characterized by no data in System Database 108 .
- System 100 can not assist the user to find the information he is looking for.
- System 100 traces the user's search session, collects data from the search session, processes the data and stores the results in the database.
- the user composes a Boolean query using Human Interface 114 .
- the user submits the query to a search engine such as AltaVista.
- a set of titles and summaries is presented to the user by the search engine.
- the user may now select some of the titles for a detailed review and ignore the others.
- a window is displayed with the document.
- the window contains a dual button interface indicating Y and N.
- Y indicates that the document is relevant to the user and N indicates irrelevant document.
- System 100 also traces activities such as printing a document or saving a document on disk. These actions are considered as parts of positive evaluations of a document.
- the user repetitively composes improved queries, submits them to the search engine and evaluates results (direct or indirect evaluation).
- the user may submit queries to different sources such as AltaVista, Yahoo and Lycos (www.lycos.com).
- meta-search engines such as MetaCrawler (www.metacrawler.com) may be used.
- This data includes at least some details such as the following:
- a process of the data is begun at this stage to produce a set of valuable information in the System Database, the information contains details such as:
- the data collected during the search session is then stored in the System Database together with the set of parameters and calculated ranks. This also includes submitted queries, URLs, summaries, terms and their relations and ranking.
- FIG. 2 demonstrates a preferred embodiment of Human Interface 114 of FIG. 1 .
- Query Composition section 200 contains Query window 202 where the current query is composed and Related Queries window 204 for display of relevant queries stored in System Database 108 .
- Query window 202 where the current query is composed
- Related Queries window 204 for display of relevant queries stored in System Database 108 .
- Basic query composition is done in Query window 202 , by typing words, expressions, Boolean operators and conventional singes. Following are some examples:
- Related queries are displayed in Related Queries window 204 .
- terms from Query window 202 are used to search System Database for stored queries that contains such terms.
- the queries are displayed in Related Query window according to their rank, highest rank first.
- the queries containing terms of Query window 202 are specially ranked for display in Related Queries window 204 .
- This ranking may first rank the queries in accordance to the number of terms from Query window 202 that are contained in these queries and then, a sub-level sorting is performed, where all queries of the same ranking are sub-sorted by their own rank (as stored in System Database 108 ). Other ranking schemes are possible.
- the top query of Related Query window 204 is highlighted. Any other query of window 204 can be highlighted by clicking on it. More then one query may be highlighted simultaneously. Double clicking a query of Query window 204 will copy the query to Query window 202 , instead of what was previously in that window. Related Query window 204 will refresh then, according to the new query in Query window 202 .
- Related Terms section 206 within Query Composition section 200 supports the process of query composition by listing terms that are related to the terms of the query in Query window 202 .
- Related Terms section 206 contains four windows:
- Button ‘Go’, 216 is used to indicate that the composition of the query is complete and the system is to retrieve information in accordance to that query.
- the above example of preferred embodiment can be used in a more simple form such as displaying to the user only a list of Related Terms, in a single window.
- the Related Terms section may display the list of “Term 1 , Term 2 , . . . , Term 9 ” in a single window without any additional information.
- Document section 218 is used to display titles and summaries of documents in accordance to the highlighted Query in Related Queries section 204 .
- Title window 220 are titles that are highly relater to the highlighted query of window 204 , Query 2 in the example of FIG. 2 .
- the titles are available from System Database 108 and are displayed in order according to their ranking. High rank displayed first.
- the next group of titles is extracted from System Database 108 . These titles are related to the non-highlighted title with the highest rank in window 208 . If this does not provide the required number of titles, the next group of titles is extracted from System Database 108 . These titles are related to the non-highlighted title with the second highest rank in window 208 . This procedure is repeated until the required number of titles is provided.
- Each such group of titles is sub-sorted according to the rank of the titles.
- Titles are also filtered for display by Which Title? window 232 .
- Title? window 232 In the example of FIG. 2 , only New titles are presented. These are titles that have not been reviewed yet by the present user. The filtering action of the preferences is explained in more details hereinbelow, in the Preference section part.
- a double click on a title of window 220 will display the document of that title.
- Window 224 is an indicative window that displays the URL of the highlighted title of Window 220 .
- the summaries of the documents that are displayed in Summary window 222 are related to the list of titles in window 220 .
- the summary of the highlighted title, Title 3 of window 220 in the example of FIG. 2 is displayed in bold underlined characters, at the top of window 222 , indicated as Summary 3 .
- Unused area, below Summary 3 is used for summaries of subsequent tiles, as provided by the size of window 222 .
- These summaries are presented in the same order as the titles of window 220 .
- the roll slider of this window allows both up-rolling for summaries preceding Sammary 3 and down-rolling for summaries succeeding Sammary 3 .
- Double clicking a summary will display the document of that summary.
- Preferences section 226 is used for input, by the user, of preferences for the search session.
- a maximum number of titles to be presented is indicated in window 228 , adjustable by the user.
- Date Range windows 230 indicate the earliest and latest dates of that rang. Only documents that were updated in System Database 108 within this range will be presented. The dates are adjustable by the user.
- Database windows 234 indicates the database to be used by the system.
- Local window 238 is used to select the preferred local database to perform as System Database 108 . This may be one of few local databases or a portion of a database. The different options may be indicated by names such as:
- the selected database is used during the user's interaction with the human interface of FIG. 2 including when a query is submitted for search (old or new query).
- Internet window 240 is used to select the preferred Internet database sources. This is useful for submission of queries for search of new documents (or titles) that are not in the local database. Pre-configured selections of sources are available at this window.
- FIG. 2 For simplicity, all elements of FIG. 2 are indicated with the digit 2 for the hundreds digit, such as 202 , 206 and 214 .
- the system can handle multiple simultaneous search sessions, conducted by different users, independently.
- Each user may use his own preferences configuration in Preferences window 226 .
- the data collected from each user is added to System Database 108 to serve all users. Parts of System Database 108 may be limited for use by only few users, not accessible to others.
- the preferences of window 226 will be as indicated in FIG. 2 :
- the user may view documents, step back to the search process modifying his search activity in a variety of ways such as composing new queries, editing queries and changing preferences of window 226 .
- System 100 is processing the new search information and generates new data for System Database 108 .
- This data is added to the previously stored data for future aided search sessions, as described hereinabove (section of Initial search process).
- the database might not contain Related Terms or Related Queries to support the user with the query composition process.
- the query composed by the user is submitted to the internet sources, such as Alta Vista (www.altavista.com).
- server 102 finds no Related Terms or Related Queries; the server analyses the results page received from the internet source in search for relevant terms and or expressions.
- search algorithm may consist of a simple method such as: fins first word adjacent to the term “sharon”. Select only single words that are separated from “sharon” by expressions ⁇ B> or ⁇ /B>, ignore connection words and punctuation marks.
- the commonly html search results of the internet source can be saved as a text file using the save function of the operation system such as Microsoft Windows XP.
- These terms can be ranked using on-page criteria such as number of appearance in the page to provide a higher relevancy presentation order.
- the Related Queries presented to the user as response to his query may contain a composition of Related Queries extracted from the internet source result page and system database 108 .
- Related Terms presented to the user as response to his query may contain a composition of Related Terms extracted from the internet source result page and system database 108 .
- the terms from the different sources may be displayed using different colors (example: blue for terms extracted from Internet resources search results and black for terms extracted from system database 108 ).
- Other distinguishing methods can be used such as underlining one group or presenting each group in a separate window.
- the user may select display options that provide any of the combinations such as:
- Simple queries such as of one or two Key Terms are the most intuitive and are frequently the first ones composed in a search session.
- the user may submit such a simple query that in a present art search system will fail to produce useful results and provide many falls results.
- submission of such a query will actually result in submission of a number of more sophisticated queries, these are Related Queries available from System Database 108 .
- These queries may be those of a rank above a predetermined threshold.
- the results will be those that are associated with the highly ranked Related Queries. This methods enables valuable results from a simple and intuitive query—not effective by itself.
- a search session is defined to be the process of searching information related to a specific subject.
- a search session includes the composing of queries, submission of queries to a search engine, evaluation of results, modification of queries as a response to such search results, submission of such modified queries—and so on.
- semi-automatic session tracing is performed by the system. Queries are identified to belong to the same search session in the following way:
- New search session starts by a query (normally after the application is activated). Each new or modified query is compared to all the previous queries. If at least one keyword of this query is used in one of the previous queries of that session—the new query is belongs of the same session.
- a user may search for information on 35 mm film dimensions. He may start with a query “film and 35 mm” and change strategy to search for standard organizations with the query “iso”. To overcome this problem in the present embodiment, when this occurs, the system responds to the user with a question: “Have you started a new search session? Y/N”. If the user answers “N” the queries “film and 35 mm” and “iso” are associated with the same search session.
- the data that is collected and processed trough the search sessions is used to generate and support direct information exchange and communication among the members of an organization.
- the user interface of FIG. 2 may contain “Names” indicator. By clicking this indicator, System 100 , opens a new window. This window contains names, email addresses and phone numbers of the users who used the Related Queries and Titles in the past.
- the order of names in the window may by according to the order of Related Queries of window 236 of FIG. 2 . Where two or more names are related to a query the order of presentation of these names would be according to the number of Related Queries with which the names are associated, names associated with more queries to appear first.
- the names are adjacent to checkboxes.
- the user may now, for example, use the checkboxes to select a subgroup of the names and then select an Email option.
- An email form addressed to the checked names will be opened.
- the user may then write an email to this group of user, asking for more information about their activity in the subject of his search session.
- the user may also select to use the phone numbers to call these people.
- a user may look for an international standard in a specific matter.
- the ISO Internet site www.iso.ch
- He may find a reference to the standard he needs but the standard itself is not available there.
- the standard has to be ordered separately, be paid for and delivered by mail.
- the user may place a relevant query in query window 202 in order to get names of people, in the organization, who are involved in that subject. Then he can email them an inquiry to find whether they have in possession the requested document. By doing so he may shorten the time and cost to get the required document.
- the information accumulated in the system database 108 can be used to provide the user with Search Targeted Promotions.
- a Promotions Database containing items such as advertisements, coupons and special discount or other types of information is stored in the system database or another database in the system computer or any other storage accessible by the system.
- association is made in a variety of ways. In the present example the association is made by the URL of the provider. As demonstrated in the following table:
- Ad2 for example is associated with URL www.b.com.
- searching for a related URL in the database is not limited to the complete and exact URL only.
- a more sophisticated algorithm may search for a useful fraction of the complete URL. For example, when given a title-related URL such as “http://www.coveo.com/en/News/Default.aspx”, the system can extract only “.coveo.com” and search for this string in the Promotion Database. In such a case a related URL such as “http://www.coveo.com/en/Contact/ContactUs.aspx” may be the result of this process.
- the string used to search a related URL can be extracted from the complete URL using simple algorithms such as:
- the promotion may be presented in a variety of ways including, but not limited to, on a specific area in the results page, a separate pop-up page or a banner.
- the order of displaying such promotions may be according to the order of the titles in the search results page. This will fit an already implemented relevancy algorithm generated by the user activity and thus, be of the same relevancy value to the user. If more then one promotion is in the list for the same URL, the system can be designed to display them in a pre-determined order such as alphabetic order, present only one promotion for each URL, selected arbitrarily from the promotions available for this URL or any other method.
- the user query database includes the following list of queries with related titles, associated URLs and ranking.
- the promotion database includes the following items:
- step by step process is described herein as a specific and non limiting example:
- the user may be presented with promotions that are selected with the above process except that the queries, titles and URLs used in the process are an aggregate of at least a part of the queries, titles and URLs from all users or from a users sub-group selected by the user.
- the accumulated database can be used to target advertising or promotions to the user without the use of promotions database.
- the accumulated database is used to provide the advertising source with more information that is normally available, to support this source with better selection of more suitable advertisement. This method will be explained by the following example.
- the user query database includes the following queries with related titles, associated URLs and ranking [R]:
- www.Google.com may receive both queries and generate the combined result page and send it to the user already containing the search results for “Vancouver” and the Sponsored Ads for “Vancouver restaurants”.
- the whole process can take place at the Internet source, such as www.google.com.
- the invention is not limited to the above usage of related terms. Also complete queries used in the past by the user can be used for this process. For example, when submitting the query “Vancouver” the system can search for a related query and find “Vancouver Indian restaurants” as a highly ranked query in the user database. This query can be used to search for relevant Sponsored Ads.
- the system can use also documents that are registered to the user.
- documents can be registered to the user via the URLs in his database, as described in this invention or via “Favorites” as provided by Internet Explorer of Microsoft Corporation.
- Related terms can be extracted from such documents using the method of “Aided search with Key Terms and Queries external to accumulated database” described hereinabove. These terms can be used to compose the secondary query aimed for the extraction of Sponsored Ads that are better targeted to the specific user.
- ranking can be a weighted balance between older ranking and newer ranking. This approach serves to fit better possible changes in user activity.
- One such weighting method can be time driven.
- the ranking of an item is eroded as a function of time that passed since it was last used.
- R(now) is the current rank
- R(last) is the rank of the item following the last ranking action
- F is the monthly rank reduction factor m is the number of months passed since the last ranking action
- the ranking process may take a weighted sum of the old ranking (R 0 ) and the new one (R 1 ) to create the new ranking (R):
- the “ranking erosion” may be used on a basing of “ordered ranking weights” and not as a function of time. This can be implemented using equation (3) above without the time parameter m:
- Both equations (3) and (4) represent methods for weighted ranking reflecting the usage and interest of the users.
- the specific implementation of these or other methods depends on the needs of the user and can be configured to combine these equations and also configured to use other weighting methods.
- search results can be presented with checkbox associated with each reference, as shown by reference number 242 in FIG. 2 .
- checkboxes Part of these checkboxes, or all of them, can be checked to indicate that a specific action is desired in relation to the associated references.
- the action can be selected by a variety of means, such as a pull-down menu shown by reference number 244 in FIG. 2 .
- a particular action is a generation of a new results page containing only the items selected by checking the checkboxes.
- the selections made by the user are fed-back to the system.
- the program is configured to generate a new document containing only the selected items.
- update may be performed as a response to a predetermined partial group of changes or only by an explicit request from the user.
- Non-Boolean query systems such as Natural Language Queries, may be used in the present invention.
Abstract
Description
- The invention is related to the field of digital information management and, in particular, to search and retrieval of the same.
- The growth of the Internet introduced broad access to information not available before. Access to digital information sources, once an asset of a small group of professional, holding information technology skills, has become a daily tool for millions of the Internet users.
- Lower skill levels for search of such information is now an inseparable part of searches made for information by most of the users. Skill and knowledge aspects became limiting factors for successful search and retrieve of such information. Such limitations present themselves in the composition of Boolean queries, knowledge of relevant information sources such as the AltaVista index at www.altavista.digital.com (maximum coverage of Internet documents by a single index is less then 40%). Many of the documents are accessed only by a direct reference from a person with a specific knowledge. Many of the information provided by querying an index such as Yahoo are not relevant. The search process is long, queries are modified many times and many information pieces are missed.
- Natural language query is one suggested replacement for Boolean query method. However, a research from Search Insider (www.searchinsider.com) indicates clearly that users prefer the Boolean query methods and that search engines such as AltaVista and Yahoo (www.yahoo.com) provide require much improvement.
- The present status of information search and retrieval in the Internet is characterized by long and tedious search process, poor relevancy of retrieved documents and low level of success in retrieval of relevant documents.
- It is the purpose of the present invention to provide a method and tools for efficient search and retrieval of documents. The description in reference to the Internet is maid in a way of example only. It would be appreciated by those skilled in the art, that the proposed method is applicable to any digital information source.
- In a preferred embodiment of the present invention, the system comprises a Server, Clients having a Human Interface (H/I) and communication with the server, a Database, a connection to the Internet and Software of that system. A User of the Client is using the H/I to compose a query view various information pieces including retrieved documents or titles or summary of those documents. The Software traces the user's search activity, collecting data such as queries and relevant or irrelevant documents and information sources. The data is evaluated and stored in the Database.
- The data is also compared to other data, collected from all users, available from the Database. A data that is relevant to assist the current search process is presented to the user. This data include highly ranked queries that are similar to the query composed by the current user and highly ranked documents retrieved in the past by those queries.
- As the Database is the accumulation of many such search processes, made by a single user or by many users, in the same subject, the current user can benefit from the many hours invested by himself or by others to find information in this subject.
- This method is effective for a single user searching the internet or his own computer and it is particularly effective when used within an organization or work group, whereas the organization members search for information that is relevant to the activity of that organization. Thus the Database generated overtime is highly relevant to all members of such organization or work group.
- The invention will be better understood in reference to the following Figures:
-
FIG. 1 . - A general block diagram of a preferred embodiment of the system of the present invention.
-
FIG. 2 . - A description of a preferred embodiment of a Human Interface of the present invention.
-
FIG. 3A andFIG. 3B (referred to asFIG. 3 ). - A workflow chart, describing a preferred process of working with the system of the present invention.
- Reference is made now to
FIG. 1 , which is a general description of one preferred embodiment of the system, presented in the form of a block diagram. A preferred embodiment of the invention is presented.System 100 for search and retrieval of documents includes: -
- 1.
Server 102 which is any suitable computer such as IBM Netfinity 3000, available from IBM Corporation, North Carolina, U.S.A. with a suitable server software (Server S/W 106) such as Microsoft Windows NT, available from Microsoft Corporation, Washington, U.S.A. - 2. At least one
Client Station 104 which is any personal computer such as IBM PC 300XL with suitable software (Client S/W 112) such as Microsoft Windows NT (the drawing illustrates multiple Client Stations 104). - 3.
Server 102 includes alsoSystem Database 108. - 4. Each of
Client Stations 104 is connected to the Server by any means of communication 110 (such as LAN) and any standard communication protocol (such as TCP/IP). - 5. Each of the Client Stations contains also
Human Interface 114, such as described in details in reference toFIG. 2 .
- 1.
- 6.
System 100 is also connected to at least one source ofdigital information 116 by communication means 118. In the preferred embodiment presented here, such a source of digital information is the Internet. This connection may be done using any method, some of the methods are described in “Using the Internet”, 2nd edition by Mary Ann Pike, © 1995. - It would be appreciated that the above embodiment is provided as example and that, for example, all the functionality of
system 100 can be implemented in a single computer, on a web-server or using any other infrastructure or technology. - Initial search is characterized by no data in
System Database 108. At thisstage System 100 can not assist the user to find the information he is looking for. In thisstage System 100 traces the user's search session, collects data from the search session, processes the data and stores the results in the database. - In the present embodiment of the invention, the user composes a Boolean query using
Human Interface 114. The user then submits the query to a search engine such as AltaVista. A set of titles and summaries is presented to the user by the search engine. - The user may now select some of the titles for a detailed review and ignore the others.
- When the detailed document is presented to the user it is desired that the evaluation of the document, by the user, will be provided to the System. For that purpose a window is displayed with the document. The window contains a dual button interface indicating Y and N. To change from the document display back to the search session the user must click either the Y or the N. Y indicates that the document is relevant to the user and N indicates irrelevant document.
System 100 also traces activities such as printing a document or saving a document on disk. These actions are considered as parts of positive evaluations of a document. - The user, repetitively composes improved queries, submits them to the search engine and evaluates results (direct or indirect evaluation). During the search session the user may submit queries to different sources such as AltaVista, Yahoo and Lycos (www.lycos.com). Also meta-search engines such as MetaCrawler (www.metacrawler.com) may be used.
- When the user finishes the search session, the system has collected raw data ready for process. This data includes at least some details such as the following:
-
- 1. Queries submitted by the user.
- 2. URLs of documents (URL: Uniform Resource Locator)
- 3. One query to many URLs relations for the URLs retrieved by each one of the submitted queries.
- 4. A set of evaluation parameters for each URL:
- Y, N
- Review of detailed document
- Document printed
- Document saved on storage device
- Documents summaries—those that are available
- Document generation date, last update date
- 5. Date and time session ended.
- 6. Register indications of who maid any of the above actions.
- 7. Register indications of within which users group the user maid any of the above actions.
- 8. Date URL introduced to System Database.
- A process of the data is begun at this stage to produce a set of valuable information in the System Database, the information contains details such as:
-
- 1. Ranking each of the URLs as per the following example:
- A new URL (not exists in the System Database) acquires a
preliminary rank 1. - Add 10 points for ‘Y’.
- Add 3 points for review of the document.
- Add 1 point for printing the document,
- Add 1 point for storing the document on a storage device.
- Subtract 1 point for ‘N’.
- A new URL (not exists in the System Database) acquires a
- This ranking method enables increase of URL ranking either by direct or indirect evaluation by the user. Also, Rank reduction effectiveness is limited to avoid unintentional negative ranking of a URL.
- 2. A ranking method for a query is provided hereinbelow as an example:
- Generate ranking parameters for each submitted query:
- Number of URLs related to this query that are ranked over 0 (n1).
- The sum of ranks of these URLs (v1).
- Number of URLs related to this query that are ranked 0 (n2).
- Number of URLs related to this query that are ranked lower then 0 (n3).
- The sum of ranks of these URLs (v3).
- Number of terms in the query (T1).
- ‘Term’ is used here in the broad sense. For example, a ‘term’ may be a single word, expression containing more then one word and a sequence of characters with indication to refer to all words and expressions containing that sequence of characters.
- A query may then be ranked using a formula such as:
- Generate ranking parameters for each submitted query:
- 1. Ranking each of the URLs as per the following example:
-
Rank=K 1×(v 1 /n 1)+K 2×(v 3 /n 3)+K 3 ×T 1 (1) -
-
- This formula may use a relatively high value for K1 to make valuable URLs more effective in ranking the query as a useful query. K2 may be a relatively low value to limit the effect of irrelevant URLs retrieved by this query. This satisfies the need to reduce the rank of a query if many irrelevant URLs are retrieved by the query but, at the same time, make sure that the query maintains a good rank if it also retrieves valuable URLs.
- T1 is an indication for the sophistication of the query that adds to the value of such query to the user.
- It would be appreciated that ranking formula (1) is an example and many other formulas may produce valuable solution.
- Additional ranking methods are described hereinblow.
- 3. Generating a set of related terms: each query is analyzed for terms related by Boolean operators such as OR, AND and NOT. This generates a many to many relations among terms of the query.
- Consider the following query example:
- (car or automobile or vehicle not bus) and (road or sand or mud).
- The following relation table may be generated:
-
-
car automobile vehicle bus road sand mud car — OR OR NOT AND AND AND automobile OR — OR NOT AND AND AND vehicle OR OR — NOT AND AND AND bus NOT NOT NOT — NOT NOT NOT road AND AND AND NOT — OR OR sand AND AND AND NOT OR — OR mud AND AND AND NOT OR OR — -
-
- This vocabulary, with the Boolean relations, is useful in identifying terms that are relevant to other terms, in the sense of composing a Boolean query. For example, when the word ‘vehicle’ is introduced in a query, the System may use the System Database to present the user with other terms that may be useful, under the relevant category:
- OR: car, automobile
- AND: road, sand, mud
- NOT: bus
- The user may then use these related terms to enhance his query.
- Terms without Boolean relations may be treated per default rules such as:
- a) Assign the relation the Boolean expression “OR”
- or
- b) Assign a relation such as “spece” and allow search engines assign their own default interpretation to “space” between terms submitted in a query.
- This vocabulary, with the Boolean relations, is useful in identifying terms that are relevant to other terms, in the sense of composing a Boolean query. For example, when the word ‘vehicle’ is introduced in a query, the System may use the System Database to present the user with other terms that may be useful, under the relevant category:
- 4. Ranking each of the terms. The terms may be ranked according to the number of times they appear, in relation to a given term, in all queries. The ranking may be separate for each type of Boolean relation, such as OR, AND and NOT.
- This ranking may also be modified, by weighting each appearance by the rank of the query, that generates said relation.
- This will enable to present the terms, such as ‘road’, ‘sand’ and ‘mud’ in appropriate order: most useful term at the top.
- It would be appreciated that a regular thesaurus will not provide such relations nor contain many professional terms (such as densitometer and “SELFOC lens”). The method of this invention generates a database containing such terms, introduced by the users during search sessions.
-
- The data collected during the search session is then stored in the System Database together with the set of parameters and calculated ranks. This also includes submitted queries, URLs, summaries, terms and their relations and ranking.
- The amount of such data accumulates more rapidly when the System is used by a group of users. This is the case in organizations, where many members of the organization search for information regarding similar subjects.
- Reference is made now to
FIG. 2 , which demonstrates a preferred embodiment ofHuman Interface 114 ofFIG. 1 . - In order to enable a comprehensive explanation, it is assumed that an amount of data has already been collected in
System Database 108 by the process described hereinabove and this data is available for assistance of searches made by individuals. - In a preferred embodiment of the invention,
Query Composition section 200 containsQuery window 202 where the current query is composed andRelated Queries window 204 for display of relevant queries stored inSystem Database 108. It will be appreciated that although this preferred embodiment is explained in reference to complex Boolean queries, other embodiments of the present invention may be implemented without or partial Boolean relations. Example: Ther query “Term1 OR Term2 AND Term3” maybe used in a relaxed form “Term1 Term2 Term3” and allow the search engine default Boolean interpretation to take place. - Basic query composition is done in
Query window 202, by typing words, expressions, Boolean operators and conventional singes. Following are some examples: - Words: car, road, table, . . .
- Expressions: “racing car”, “road map”, “Tolman's coffee tables”, . . .
- Boolean operators: OR, AND, NOT, ADJ, . . .
- Indefinite termination: info* stands for: (information OR inform OR Infocenter OR . . . )
- Related queries are displayed in
Related Queries window 204. In a simple implementation of the present invention, terms fromQuery window 202 are used to search System Database for stored queries that contains such terms. The queries are displayed in Related Query window according to their rank, highest rank first. - In a more sophisticated implementation of the present invention, the queries containing terms of
Query window 202 are specially ranked for display inRelated Queries window 204. This ranking may first rank the queries in accordance to the number of terms fromQuery window 202 that are contained in these queries and then, a sub-level sorting is performed, where all queries of the same ranking are sub-sorted by their own rank (as stored in System Database 108). Other ranking schemes are possible. - In default, the top query of
Related Query window 204 is highlighted. Any other query ofwindow 204 can be highlighted by clicking on it. More then one query may be highlighted simultaneously. Double clicking a query ofQuery window 204 will copy the query to Querywindow 202, instead of what was previously in that window.Related Query window 204 will refresh then, according to the new query inQuery window 202. - More queries may be observed in
Related Queries window 204 by usingRoll Slider 236. -
- The method of clicking, double clicking, highlighting, window rolling with a roll slider and other such elements are in accordance to the conventions of Windows'XP from Microsoft Corporation, Seattle, Wash., U.S.A. It will be assumed that the reader is familiar with these conventions and they will not be described here in more details.
-
Related Terms section 206 withinQuery Composition section 200 supports the process of query composition by listing terms that are related to the terms of the query inQuery window 202.Related Terms section 206 contains four windows: -
- 1.
Key Terms window 208 is used for controlling key terms. Such terms, indicated as KeyTerm1, KeyTerm2 . . . (KT1, KT2 . . . ) are automatically selected fromQuery window 202, excluding Boolean operators and Boolean syntax. The user may add, remove or select any terms ofwindow 208. In a simplified implementation of the present invention, the terms ofwindow 208 are presented in the same order of appearance in the query ofQuery window 202.- In another implementation of the invention, the terms are presented in accordance to their ranking-high ranking first.
- Other sorting methods for display order are possible.
- In default, the first term of
Related Terms window 208 is highlighted. The user may highlight any other term. Terms may be added, edited and removed fromwindow 208.
- 2. ‘Or’
window 210 contains terms that we are related to the terms ofKey Terms window 208. The relation is established by the Boolean operator ‘OR’ in queries composed and stored inSystem Database 108 in previous search sessions. For example ‘Term1’ inwindow 210 appears in at least one query stored inSystem Database 108,- either in the form
- . . . KeyTerm1 OR Term1 . . .
- or in the form
- . . . KeyTerm2 OR Term1 . . .
- The order of the terms presented in
window 210 may be according to the following sorting: - First: terms that are related to the highlighted term of
window 208. - Then: terms are sorted according to their ranking (described hereinabove).
- Then: terms that are related to non highlighted terms of
window 208, arranged in groups of the same order as the ranking of the non highlighted terms ofwindow 208. - Then: each of the group of terms relating to a non highlighted term of
window 208 is sub-sorted according to their own ranking.
- either in the form
- 3. ‘And’
window 212 contains terms that we are related to the terms ofKey Terms window 208. The relation is established by the Boolean operator ‘AND’ in queries composed and stored inSystem Database 108 in previous search sessions. For example ‘Term4’ inwindow 212 appears in at least one query stored inSystem Database 108,- either in the form
- . . . KeyTerm1 AND Term4 . . .
- or in the form
- . . . KeyTerm2 AND Term4 . . .
- Order of display is according to the method of
window 210.
- either in the form
- 4. ‘Not’
window 214 contains terms that we are related to the terms ofKey Terms window 208. The relation is established by the Boolean operator ‘NOT’ in queries composed and stored inSystem Database 108 in previous search sessions. For example ‘Term7’ inwindow 214 appears in at least one query stored inSystem Database 108,- either in the form
- . . . KeyTerm1 NOT Term7 . . .
- or in the form
- . . . KeyTerm2 NOT Term7 . . .
- Order of display is according to the method of
window 210.
- either in the form
- 1.
- Nested Boolean relations are supported. For example, query of the type
-
- (A OR B) AND (C OR D) NOT (E OR F)
will generate the following relations:
- (A OR B) AND (C OR D) NOT (E OR F)
-
Key Term Or And Not A B C, D E, F B A C, D E, F C D A, B E, F D C A, B E, F E F A, B, C, D F E A, B, C, D - Button ‘Go’, 216, is used to indicate that the composition of the query is complete and the system is to retrieve information in accordance to that query.
- It would be appreciated that the above example of preferred embodiment can be used in a more simple form such as displaying to the user only a list of Related Terms, in a single window. For example, the Related Terms section may display the list of “Term1, Term2, . . . , Term9” in a single window without any additional information.
-
Document section 218 is used to display titles and summaries of documents in accordance to the highlighted Query inRelated Queries section 204. - The titles of the documents are displayed in
Title window 220 are titles that are highly relater to the highlighted query ofwindow 204, Query2 in the example ofFIG. 2 . - The titles are available from
System Database 108 and are displayed in order according to their ranking. High rank displayed first. - If the number of such titles is lower then No. of Titles 228 (20 in the example of
FIG. 2 ), the next group of titles is extracted fromSystem Database 108. These titles are related to the non-highlighted title with the highest rank inwindow 208. If this does not provide the required number of titles, the next group of titles is extracted fromSystem Database 108. These titles are related to the non-highlighted title with the second highest rank inwindow 208. This procedure is repeated until the required number of titles is provided. - Each such group of titles is sub-sorted according to the rank of the titles.
- Titles are also filtered for display by Which Title?
window 232. In the example ofFIG. 2 , only New titles are presented. These are titles that have not been reviewed yet by the present user. The filtering action of the preferences is explained in more details hereinbelow, in the Preference section part. - A single click on a title of
window 220 will effect the display of summaries inSummary window 222 as explained hereinbelow. - A double click on a title of
window 220 will display the document of that title. -
Window 224 is an indicative window that displays the URL of the highlighted title ofWindow 220. - The summaries of the documents that are displayed in
Summary window 222 are related to the list of titles inwindow 220. The summary of the highlighted title, Title3 ofwindow 220 in the example ofFIG. 2 , is displayed in bold underlined characters, at the top ofwindow 222, indicated as Summary3. Unused area, below Summary3, is used for summaries of subsequent tiles, as provided by the size ofwindow 222. These summaries are presented in the same order as the titles ofwindow 220. The roll slider of this window allows both up-rolling for summaries preceding Sammary3 and down-rolling for summaries succeeding Sammary3. - Double clicking a summary will display the document of that summary.
-
Preferences section 226 is used for input, by the user, of preferences for the search session. A maximum number of titles to be presented is indicated inwindow 228, adjustable by the user.Date Range windows 230 indicate the earliest and latest dates of that rang. Only documents that were updated inSystem Database 108 within this range will be presented. The dates are adjustable by the user. WhichTitle window 232 contains multi-choice options. Three such options may be: -
- 1. ‘New’: documents that the current user did not see before the present search session—documents that are new to the current user.
- 2. ‘Reviewed’: only documents that have been reviewed by the current user in a previous session. This is useful when the user is interested in a document he reviewed in the past but does not know the location of that document.
- 3. ‘Any’: displays both ‘New’ and ‘Reviewed’ documents.
-
Database windows 234 indicates the database to be used by the system. -
Local window 238 is used to select the preferred local database to perform asSystem Database 108. This may be one of few local databases or a portion of a database. The different options may be indicated by names such as: -
- Electronics: the portion of the database related to the electronic engineers.
- Marketing: the portion of the database related to the marketing people.
- All: All database.
- This arrangement is described in more details in Israeli patent application number 119183 dated Sep. 2, 1996 (Haim Zvi Melman et al.).
- The selected database is used during the user's interaction with the human interface of
FIG. 2 including when a query is submitted for search (old or new query). -
Internet window 240 is used to select the preferred Internet database sources. This is useful for submission of queries for search of new documents (or titles) that are not in the local database. Pre-configured selections of sources are available at this window. - The aided search session will be described hereinbelow in reference to
FIG. 2 andFIG. 3 . - For simplicity, all elements of
FIG. 2 are indicated with thedigit 2 for the hundreds digit, such as 202, 206 and 214. - All elements of
FIG. 3 are indicated with thedigit 3 for the hundreds digit such as 302, 306 and 314. - It will be appreciated that the system can handle multiple simultaneous search sessions, conducted by different users, independently. Each user may use his own preferences configuration in
Preferences window 226. The data collected from each user is added toSystem Database 108 to serve all users. Parts ofSystem Database 108 may be limited for use by only few users, not accessible to others. - In this example, the preferences of
window 226 will be as indicated inFIG. 2 : -
No. of Titles: 20 Which Title: New Date Range Earliest: 14 Feb. 1997 Latest: 01 Jan. 1998 Source: Local: Mechanics Internet: Set 5 -
- 1. The user types KeyTerm1 (KT1) and space in window 202 (step 304 of
FIG. 3 ). - 2. The space is interpreted by
System 100 as a term separator. - 3. KT1 is the only term at this stage and it is the only term (Key Term1) displayed in Key Terms window 208 (step 306 of
FIG. 3 ). - 4.
System 100 is searchingSystem Database 108 for stored terms that are related to KT1 (step 308 ofFIG. 3 ). - 5. The terms that are related to KT1 are displayed in
windows FIG. 3 ) - 6.
System 100 is searchingSystem Database 108 for stored queries that contain KT1 (step 312 ofFIG. 3 ). - 7. The selected queries are displayed in
window 204 according to the display rules of that window (step 314 ofFIG. 3 ). First query is highlighted by default. Another query can be highlighted by the user by a single click on the query. - 8. In
step 316System Database 108 is searched for titles that are related to the queries ofwindow 204. - 9. The related titles are displayed in
window 220 according to the display rules of that window (step 318 ofFIG. 3 )). First title is highlighted by default. Another title can be highlighted by the user by a single click on the title. - 10.
System 100 is searchingSystem Database 108 for stored summaries associated with the titles of window 220 (step 320 ofFIG. 3 ). - 11. The selected summaries are displayed in
window 222 according to the display rules of that window (step 322 ofFIG. 3 ). - 12. The user may now select to add a Key Term in
window 202 either by typing in the term or by selecting a Term from any ofwindows window 202 together with its' Boolean operator: OR, AND or NOT, according to the window from which the term was selected. This term will be added as Key Term2 (KT2) towindow 202.- The user may introduce editorial changes to the content of
window 202 such as changing the Key Terms or the Boolean operators.
- The user may introduce editorial changes to the content of
- 13.
System 100 repeatssteps 306 through 322 ofFIG. 3 , applying all the display rules of the relevant windows. - 14. The above process is repeated until the user is satisfied with the query he composed or by one of the queries displayed in
window 204. - 15. At this stage the user has made his choice of a query (326 of
FIG. 3B ). If his decision is for a query fromwindow 204, the user will double click that query (step 328). The selected query is copied towindow 202, replacing the text that was previously there (step 330).Steps 306 through 322 are repeated by System 100 (step 332).- It will be appreciated that the user may edit the query in
window 202 even if it was copied there fromwindow 204 or double click another query ofwindow 204.
- It will be appreciated that the user may edit the query in
- 16. If the user is satisfied with the query of
window 202 and has not found yet the information he is looking for in System Database 108 (as specified by the reference window 226),window 216 is clicked once (step 334). - 17.
System 100 performs then a search for documents in accordance with the query ofwindow 202 and preferences ofwindow 226. The search is limited to sources specified inwindows Date Range 230 and documents that have been seen in the past by the current user, as required by window 232 (step 336). - 18. In
step 338 the search results are displayed in windows 220 (titles) and 222 (summaries). Summaries of documents that are new to the database may be extracts from the document by a variety of methods such as reading the content of the relevant Meta Tag in an html file type or just reading the first few lines of the document. - 19. The user may select a summary and double click it (step 340).
- 20. The selected document is displayed in a dedicated window, such as a Netscape browser window (step 342).
- 1. The user types KeyTerm1 (KT1) and space in window 202 (step 304 of
- The user may view documents, step back to the search process modifying his search activity in a variety of ways such as composing new queries, editing queries and changing preferences of
window 226. - Following predetermined conditions (such as every 10 minutes or end of search session or every logout)
System 100 is processing the new search information and generates new data forSystem Database 108. This data is added to the previously stored data for future aided search sessions, as described hereinabove (section of Initial search process). - Aided Search with Key Terms and Queries External to Accumulated Database
- It is appreciated that when a user uses the system for the first time or searches a new subject, the database might not contain Related Terms or Related Queries to support the user with the query composition process.
- In the following preferred embodiment of the invention, a method is presented to support the query composition in such a case.
- In this embodiment, the query composed by the user is submitted to the internet sources, such as Alta Vista (www.altavista.com). When
server 102 finds no Related Terms or Related Queries; the server analyses the results page received from the internet source in search for relevant terms and or expressions. - In the following example the query “sharon” was placed to www.altavista.com. A section of the results page received is displayed here (the term “sharon” is underlined with double-line for easy reference):
-
“>More pages from en.wikipedia.org</A> <BR><BR><BR class=lb><A class=res href=“http://av.rds.yahoo.com/_ylt=A0geulwYBzhlGxABCitrCqMX;_ylu=X3 oDMTBvdmM3bGlxBHBndANhdl93ZWJfcmVzdWx0BHNlYwNzcg-- /SIG=12lb2st5a/EXP=1211717784/**http://www.jewishvirtuallibrary.org/jsource /biography/sharon.html”>Jewish Virtual Library: Ariel <B>Sharon</B></A><BR><SPAN class=s>Brief profile of Ariel <B>Sharon</B>, the former Prime Minister of Israel.<BR></SPAN><SPAN class=ngrn>www.jewishvirtuallibrary.org/jsource/biography/sharon.html </SPAN><SPAN class=rgy></SPAN><BR><A class=rgy href=http://av.rds.yahoo.com/_ylt=A0geulwYBzhlGxABCytrCqMX;_ylu=X3 oDMTBoMXBjOWUxBHBndANhdl93ZWJfcmVzdWx0/SIG=13ik8r56t/EXP =1211717784/**http://www.altavista.com/web/results?sc=off&q=sharon +domain%3Ajewishvirtuallibrary.org >More pages from jewishvirtuallibrary.org</A> <BR><BR><BR class=lb><A class=res href=“http://av.rds.yahoo.com/_ylt=A0geulwYBzhlGxABDCtrCqMX;_ylu=X 3oDMTBvdmM3bGlxBHBndANhdl93ZWJfcmVzdWx0BHNlYwNzcg-- /SIG=11n7bfa4b/EXP=1211717784/**http://en.wikipedia.org/wiki/Sharon”> <B>Sharon</B> - Wikipedia, the free encyclopedia</A><BR><SPAN class=s><B>Sharon</B> Mann, American voice actress working in Paris, France. <B>Sharon</B> Osbourne, music promoter and TV <B>...</B> <B>Sharon</B> Stone, American actress, model and producer <B>...</B><BR></SPAN><SPAN class=ngrn>en.wikipedia.org/wiki/Sharon </SPAN><SPAN class=rgy></SPAN><BR><A class=rgy href=“http://av.rds.yahoo.com/_ylt=A0geulwYBzhlGxABDStrCqMX;_ylu=X 3oDMTBoMXBjOWUxBHBndANhdl93ZWJfcmVzdWx0/SIG=13al9kbnr/EXP =1211717784/**http://www.altavista.com/web/results?sc=off&q=sharon +domain%3Aen.wikipedia.org”>More - Related terms search algorithm may consist of a simple method such as: fins first word adjacent to the term “sharon”. Select only single words that are separated from “sharon” by expressions <B> or </B>, ignore connection words and punctuation marks.
- This simple algorithm will provide the following Related Terms from the above section of Alta Vista results page (underlined with a single-line for easy reference):
-
- a) Ariel
- b) Mann
- c) Osbourne
- d) Stone.
- These terms may be offered to the user as Related Terms to help him improve his query.
- It would be appreciated that, using other terms extraction algorithms, additional Related terms and even Related queries may be extracted from the results pages of the internet resources.
- For example, the complete term “Sharon Mann, American voice actress working in Paris, France” can be extracted from the result page and offered as a Related Query.
- In yet another preferred embodiment of the invention, the commonly html search results of the internet source can be saved as a text file using the save function of the operation system such as Microsoft Windows XP.
- A section of the results page after saving as a text file is displayed here (the term “sharon” is underlined with double-line for easy reference):
-
- Jewish Virtual Library: Ariel Sharon
- Brief profile of Ariel Sharon, the former Prime Minister of Israel.
- www.jewishvirtuallibrary.org/jsource/biography/sharon.html
- More pages from jewishvirtuallibrary.org
- Sharon—Wikipedia, the free encyclopedia
- Sharon Mann, American voice actress working in Paris, France. Sharon Osbourne,
- music promoter and TV . . . Sharon Stone, American actress, model and producer . . .
- en.wikipedia.org/wiki/Sharon
- More pages from en.wikipedia.org
- Sharon Osbourne
- Official site with news, bio, gallery, and links.
- www.sharonosbourne.com
- More pages from sharonosbourne.com
- Welcome to the Town of Sharon, Conn.
- Official web site of the Town of Sharon, Conn. . . . Sharon Beach.
- Available
- Forms, Licenses for download. Download the Luke-Fitting Report . . .
- www.sharonct.org
- More pages from sharonct.org
- Also here, a simple algorithm will extract relevant Related Terms. For example:
- Select one word before or after the term “Sharon” with one space or new-line separation, ignore connection words and punctuation marks.
- This will extract the terms underlined above with a single line:
-
- a) Ariel
- b) Brief
- c) Former
- d) Wikipedia
- e) Encyclopedia
- f) Mann
- g) France
- h) Osbourne
- i) Stone
- j) Town
- k) Connecticut
- l) Beach
- These terms can be ranked using on-page criteria such as number of appearance in the page to provide a higher relevancy presentation order.
- It is understood by those skilled in the art that expressions to serve as queries may also be extracted form this page by using more then first neighbor to the term “Sharon”.
- In yet additional preferred embodiment of the present invention, the Related Queries presented to the user as response to his query may contain a composition of Related Queries extracted from the internet source result page and
system database 108. Same way, Related Terms presented to the user as response to his query may contain a composition of Related Terms extracted from the internet source result page andsystem database 108. - As it might be desired by the user to distinguish Related Terms (or Queries) from internet sources and Related Terms (or Queries) from
system database 108, the terms from the different sources may be displayed using different colors (example: blue for terms extracted from Internet resources search results and black for terms extracted from system database 108). Other distinguishing methods can be used such as underlining one group or presenting each group in a separate window. - This will enable the user to see which support is based on general algorithm and which support is based on his (or his group) pervious work.
- In another embodiment of the invention, the user may select display options that provide any of the combinations such as:
-
- 1. Display terms from
system database 108 - 2. Display terms from internet sources search results
- 3. Display terms from both
system database 108 and from internet sources search results - 4. Display terms from internet sources search results only if not terms are available from
system database 108
- 1. Display terms from
- Simple queries such as of one or two Key Terms are the most intuitive and are frequently the first ones composed in a search session. In another embodiment of the invention, the user may submit such a simple query that in a present art search system will fail to produce useful results and provide many falls results. In the present invention, submission of such a query will actually result in submission of a number of more sophisticated queries, these are Related Queries available from
System Database 108. These queries may be those of a rank above a predetermined threshold. The results will be those that are associated with the highly ranked Related Queries. This methods enables valuable results from a simple and intuitive query—not effective by itself. - A method is presented hereinbelow, to associate such simple queries that, in most cases, do not provide the desired results, with more sophisticated queries that are usually not intuitive and are composed only after few interaction with search results and query modifications accordingly.
- A search session is defined to be the process of searching information related to a specific subject. A search session includes the composing of queries, submission of queries to a search engine, evaluation of results, modification of queries as a response to such search results, submission of such modified queries—and so on.
- Two sessions are different if the subject is different.
- In the present embodiment of the invention, semi-automatic session tracing is performed by the system. Queries are identified to belong to the same search session in the following way:
- New search session starts by a query (normally after the application is activated). Each new or modified query is compared to all the previous queries. If at least one keyword of this query is used in one of the previous queries of that session—the new query is belongs of the same session.
- If the user go through strategy change in his queries there may be no keyword relation anymore to previous queries even if this is the same search session. For example, a user may search for information on 35 mm film dimensions. He may start with a query “film and 35 mm” and change strategy to search for standard organizations with the query “iso”. To overcome this problem in the present embodiment, when this occurs, the system responds to the user with a question: “Have you started a new search session? Y/N”. If the user answers “N” the queries “film and 35 mm” and “iso” are associated with the same search session.
- Next time that the query “film and 35 mm” will be composed by a user, a reference will also be made to the query “iso” as a relevant query. Useful titles retrieved by the query “iso” will be available then also for the query “film and 35 mm”.
- If the user replies “Y”, the previous set of queries are associated with one search session while the new query is the first one of the new search session.
- In yet another embodiment of the invention, the data that is collected and processed trough the search sessions is used to generate and support direct information exchange and communication among the members of an organization.
- As described hereinabove, during the search session Related Queries and Titles from
System Database 108 are associated with the search activity of the user. Since such queries and titles are related also to other users who used them in the past, the names of such users can be presented to the current user for user to user communication. - In the present example, after the user has worked through at least a part of his search session, such a relation to Related Queries and Titles of
System Database 108 has been established. The user interface ofFIG. 2 may contain “Names” indicator. By clicking this indicator,System 100, opens a new window. This window contains names, email addresses and phone numbers of the users who used the Related Queries and Titles in the past. - The order of names in the window may by according to the order of Related Queries of
window 236 ofFIG. 2 . Where two or more names are related to a query the order of presentation of these names would be according to the number of Related Queries with which the names are associated, names associated with more queries to appear first. - The names are adjacent to checkboxes. The user may now, for example, use the checkboxes to select a subgroup of the names and then select an Email option. An email form addressed to the checked names will be opened. The user may then write an email to this group of user, asking for more information about their activity in the subject of his search session.
- Of course, the user may also select to use the phone numbers to call these people.
- An example that highlights the usefulness of this method is provided hereinbelow:
- A user may look for an international standard in a specific matter. By looking at the ISO Internet site (www.iso.ch) He may find a reference to the standard he needs but the standard itself is not available there. The standard has to be ordered separately, be paid for and delivered by mail.
- In this example the user may place a relevant query in
query window 202 in order to get names of people, in the organization, who are involved in that subject. Then he can email them an inquiry to find whether they have in possession the requested document. By doing so he may shorten the time and cost to get the required document. - In yet another preferred embodiment of the invention, the information accumulated in the
system database 108 can be used to provide the user with Search Targeted Promotions. - In this embodiment, a Promotions Database containing items such as advertisements, coupons and special discount or other types of information is stored in the system database or another database in the system computer or any other storage accessible by the system.
- These items are associated with the providers of the promotions. The association may be made in a variety of ways. In the present example the association is made by the URL of the provider. As demonstrated in the following table:
-
Promotion URL Ad1 www.a.com Coupon1 www.a.com Ad2 www.b.com Coupon2 www.c.com - Ad2 for example is associated with URL www.b.com.
- An example step-by-step usage of the accumulated information in
system database 108 is described hereinbelow: -
- 1. The user submits a query through query window 202 (
FIG. 2 ). - 2. The server searches
system database 108 for related queries and subsequent related titles. - 3. The system extracts the URLs of the related titles
- 4. The system searches for related URLs in the Promotion Database (see, on the next paragraph, how such a related URL can be searched)
- 5. In case such a URL is found in the Promotion Database, the system presents the associated promotion to the user.
- 1. The user submits a query through query window 202 (
- It would be appreciated that searching for a related URL in the database is not limited to the complete and exact URL only. A more sophisticated algorithm may search for a useful fraction of the complete URL. For example, when given a title-related URL such as “http://www.coveo.com/en/News/Default.aspx”, the system can extract only “.coveo.com” and search for this string in the Promotion Database. In such a case a related URL such as “http://www.coveo.com/en/Contact/ContactUs.aspx” may be the result of this process. The string used to search a related URL can be extracted from the complete URL using simple algorithms such as:
-
- 1. Search for first point following “http://”
- 2. Extract all that is between this dot and the next dot, including the dots.
- 3. Compare a set of pre-stored strings to the string starting after the second dot, first character to first character, second to second etc. Such a pre-stored set may include strings such as: “com”, “co.”, “net”, “org”, “info”, “biz”, “mobi”, “me” etc.
- 4. Alternatively the step of extracting the string following the second dot might use “end of string” indicating characters such as “.” (dot) or “/” (slash),
- 5. Add the matching string to the string extracted in
step 2 above.
- The promotion may be presented in a variety of ways including, but not limited to, on a specific area in the results page, a separate pop-up page or a banner.
- The order of displaying such promotions may be according to the order of the titles in the search results page. This will fit an already implemented relevancy algorithm generated by the user activity and thus, be of the same relevancy value to the user. If more then one promotion is in the list for the same URL, the system can be designed to display them in a pre-determined order such as alphabetic order, present only one promotion for each URL, selected arbitrarily from the promotions available for this URL or any other method.
- In the following section a specific example is provided for Search Targeted Promotions.
- In this example the user query database includes the following list of queries with related titles, associated URLs and ranking.
- The list should be interpreted per the following key:
-
- 1. Query [Ranking]
- a. Title—URL [Ranking]
- 1. Query [Ranking]
- The list in this example:
-
- 1. Vancouver restaurants [5]
- b. C Restaurant—www.crestaurant.com [1]
- 2. Beethoven symphony 5 [12]
- c.
Beethoven Symphony # 5—www.wwnorton.com/classical/covers/47651.htm [29] - d. The Beethoven Symphonies page—www.all-about-beethoven.com/symphony.html [17]
- c.
- 3. Vancouver Indian restaurants [3]
- e. Indian Oven Restaurant Ltd—www.theindianoven.com [−3]
- f. India Gate Restaurant Ltd—www.indiagatefood.com [7]
- g. Chutney Villa South Indian Cuisine Inc—maps.google.com [2]
- h. Nirvana Restaurant—www.nirvanarestaurant.ca [4]
- 4. Vancouver restaurants Chinese [8]
- i. Pink Pearl Chinese Seafood Restaurant—www.pinkpearl.com [9]
- j. Shanghai Chinese Bistro—www.shanghaichinesebistro.com [2]
- 5.
Racing car 5 liter [6]
- 1. Vancouver restaurants [5]
- In this example the promotion database includes the following items:
-
Promotion URL Ad1 www.crestaurant.com Coupon1 www.amazon.com Ad2 www.ebay.com Coupon2 www.pinkpearl.com - The step by step process is described herein as a specific and non limiting example:
-
- 1. The user submits a query comprised of one term: “Vancouver”
- 2.
System database 108 is searched for Related Queries. - 3.
Queries - a. Vancouver restaurants Chinese [8]
- b. Vancouver restaurants [5]
- c. Vancouver Indian restaurants [3]
- 4. Associated titles are presented in ranked order
- a. Pink Pearl Chinese Seafood Restaurant—www.pinkpearl.com [9]
- b. Shanghai Chinese Bistro—www.shanghaichinesebistro.com [2]
- c. C Restaurant—www.crestaurant.com [1]
- d. Indian Oven Restaurant Ltd—www.theindianoven.com [−3]
- e. India Gate Restaurant Ltd—www.indiagatefood.com [7]
- f. Chutney Villa South Indian Cuisine Inc—maps.google.com [2]
- g. Nirvana Restaurant—www.nirvanarestaurant.ca [4]
- Note: in this example the order is driven first by the query ranking and then by the title ranking
- 5. The URLs of the associated titles in the search results are compared with the URLs in Promotion Database.
- a. Two URLs match:
-
Promotion URL Ad1 www.crestaurant.com Coupon2 www.pinkpearl.com -
- 6. Ad1 and Coupon2 are presented to the user, having the benefit that these promotions are associated with providers ranked highly by this specific user.
- It would be appreciated that in a case of a database created and used by multiple users, the user may be presented with promotions that are selected with the above process except that the queries, titles and URLs used in the process are an aggregate of at least a part of the queries, titles and URLs from all users or from a users sub-group selected by the user.
- In yet another embodiment of the present invention, the accumulated database can be used to target advertising or promotions to the user without the use of promotions database. In this embodiment the accumulated database is used to provide the advertising source with more information that is normally available, to support this source with better selection of more suitable advertisement. This method will be explained by the following example.
- In this example the user query database includes the following queries with related titles, associated URLs and ranking [R]:
-
- 6. Vancouver restaurants [5]
- k. C Restaurant—www.crestaurant.com [1]
- 7. Beethoven symphony 5 [12]
- l.
Beethoven Symphony # 5—www.wwnorton.com/classical/covers/47651.htm [29] - m. The Beethoven Symphonies page—www.all-about-beethoven.com/symphony.html [17]
- l.
- 8. Vancouver Indian restaurants [3]
- n. Indian Oven Restaurant Ltd—www.theindianoven.com [−3]
- o. India Gate Restaurant Ltd—www.indiagatefood.com [7]
- p. Chutney Villa South Indian Cuisine Inc—maps.google.com [2]
- q. Nirvana Restaurant—www.nirvanarestaurant.ca [4]
- 9. Vancouver restaurants Chinese [8]
- r. Pink Pearl Chinese Seafood Restaurant—www.pinkpearl.com [9]
- s. Shanghai Chinese Bistro—www.shanghaichinesebistro.com [2]
- 10.
Racing car 5 liter [6]
- 6. Vancouver restaurants [5]
- In addition, in this example the following terms database and terms ranking is available from the query database:
-
Key Term Related Key Terms [and ranking] Vancouver Restaurants[14], Indian[2], Chinese[6] Restaurants Vancouver[7], Indian[3], Chinese[15] Indian Vancouver[5], Restaurants[7] Chinese Vancouver[8], Restaurants[3] Beethoven Symphony[7], 5[1] Symphony 5[2], Beethoven[21] 5 Beethoven[3], Symphony[4] Racing Car[6], 5[2], Liter[8] Car Racing[7], 5[1], Liter[3] 5 Racing[2], Car[1], Liter[4] Liter Racing[7], Car[19], 5[2] - The Related Key Terms are related to the Key Terms because the user once included them in a single query, meaning that he considers this relation valid for himself.
- We also assume here an Internet source that includes functionality to receive a query and deliver advertisement in response to the query. Such an example is Goggle (www.google.com) Sponsored Links enabled by AdSense and AdWords programs. The term “Sponsored Ads” will be used here to refer to these advertisements.
- The usage of this database for delivering of better-targeted promotions or advertising is explained here step-by-step.
-
- 1. The user places a query containing one term: “Vancouver”
- 2. The Internet source will provide typical search results for such a query The Sponsored Ads (advertising sponsored by advertisers), based on this query will include the following (as exercised with www.google.com on 26 May, 2008, 21:50 GMT):
- 30 Hotels in Vancouver—Canada
- Great rates, guest-reviews. No reservation fee, you pay at the hotel.
- Booking.com/Hotels-Vancouver-Canada
- Book Hostels in Vancouver
- Cheapest Beds—No Booking Fees. 2,000 Destinations. Book Online Now.
- www.HostelBookers.com/Vancouver
- Vancouver Bc Hotel
- Compare hotel prices from over 120 top websites and save up to 70%.
- Hotels.SideStep.com
- Cheap Hotel in Vancouver
- Find cheap deals on 100+ hotel sites with 1 search! No booking fees.
- www.Kayak.com/Hotels
- Lord Stanley Suites: Vancouver
- Premier boutique hotel overlooking Coal Harbour and Stanley Park.
- www.lordstanley.com
- Vancouver B.c—Vancouver, BC
- Need a virtual office? Fully furnished? We have what you need.
- www.awardbusinesscentres.com
- Vancouver Hotels
- Save on Vancouver Hotels. Sort by price, location and star rating . . .
- book.hotelreservations.com
- BC Hotel Vancouver Hotel
- Need a Hotel in Vancouver? BC Hotel Vancouver Hotel Bargains.
- www.Calibex.com/Hotels
- None of the above advertisements targets the clear main interest of this specific user in Vancouver, which is Indian and Chinese restaurants.
- 3. In this preferred embodiment however, in addition to the query “Vancouver” used for search results, another query may be submitted using the terms database. In this example one word from the 3 words associated with “Vancouver” is selected, the word with the highest ranking: “restaurant”. The second query submitted to the internet source is then “Vancouver restaurants”, reflecting the user personal interest. This query is submitted as a background activity, unseen by the user.
- 4. This query generates a new results page and a new set of Sponsored Ads, the sponsored ads being highly relevant to the user personal interest in restaurants:
- Vancouver Restaurants
- Hundreds of Tasty Listings Photos, Menus, Reviews and More.
- www.clubZone.com
- T Online: Vancouver, B.C.
- Read about Vancouver's nightlife, hotels, restaurants and more.
- www.nytimes.com
- 5. Both result pages: (1) The result page for the user query “Vancouver” and (2) The result page for the system automatic background query “Vancouver restaurants” are received by the system of the current invention.
- 6. The search results from the first page are combined with the Sponsored Ads of the second page to create a third page containing the search results for “Vancouver” and the Sponsored Ads for “Vancouver restaurants”
- 7. The combined page is now displayed to the user offering the search results he asked for with advertising that suites better his interest.
- It would also be appreciated that the above process can be executed by the Internet source. In this example www.Google.com may receive both queries and generate the combined result page and send it to the user already containing the search results for “Vancouver” and the Sponsored Ads for “Vancouver restaurants”.
- If the user database is available to the Internet source, the whole process can take place at the Internet source, such as www.google.com.
- It would be appreciated that submitting a single term as the preliminary query is suggested hereinabove only as an example and that any query can be used at this stage.
- The invention is not limited to the above usage of related terms. Also complete queries used in the past by the user can be used for this process. For example, when submitting the query “Vancouver” the system can search for a related query and find “Vancouver Indian restaurants” as a highly ranked query in the user database. This query can be used to search for relevant Sponsored Ads.
- Also more then one related term might be added to a query, and more then one subsequent queries can be submitted to extract relevant Sponsored Ads.
- The above methods described using the user's related terms or query database to enhance the relevancy of Sponsored Ads to the specific user.
- In addition to the user's related terms or query database, the system can use also documents that are registered to the user. Such documents can be registered to the user via the URLs in his database, as described in this invention or via “Favorites” as provided by Internet Explorer of Microsoft Corporation. Related terms can be extracted from such documents using the method of “Aided search with Key Terms and Queries external to accumulated database” described hereinabove. These terms can be used to compose the secondary query aimed for the extraction of Sponsored Ads that are better targeted to the specific user.
- It would be appreciated, throughout the above examples, that at least a part of databases of different users may be integrated to serve a given user so that he can benefit from search activity of these users. So are documents and other similar sources that might resident on separate and unrelated databases. A typical such integration might be based on importing such data to a single database.
- In another embodiment of the present invention, ranking can be a weighted balance between older ranking and newer ranking. This approach serves to fit better possible changes in user activity.
- One such weighting method can be time driven. The ranking of an item (query, URL or any other item) is eroded as a function of time that passed since it was last used.
- In this example, existing ranking of an item (R) might be multiplied each month by a factor (F). By doing so, the ranking of such item is reduced over time when not used.
- For example, selecting F=0.99, the ranking of the item relative to the ranking it was last used (or ranked) will be as shown in the table below, using the following formula:
-
R(now)=R(last)*F m. (2) - R(now) is the current rank
R(last) is the rank of the item following the last ranking action
F is the monthly rank reduction factor
m is the number of months passed since the last ranking action -
Year Relative ranking 1 0.89 2 0.79 3 0.70 4 0.62 5 0.55 6 0.48 7 0.43 8 0.38 9 0.34 10 0.30 - If the user is ranking now and already ranked item, the ranking process may take a weighted sum of the old ranking (R0) and the new one (R1) to create the new ranking (R):
-
R=R 0 *F m +R 1 (3) - The above specific example provides few time-depended features for ranking management:
- 1. Each ranking of a given item uses the highest weight to the last ranking and lowest weight to old ranking.
- 2. This means that items are considered more relevant if they were used lately and less relevant if they have not been used lately.
- 3. If items are not used for long time (and not ranked), it means that these items are not relevant anymore to the users. The reduced rank will then serve to avoid presentation of such items as relevant to the user.
- 4. Wherever the system is used by a single user of a collaborating group, the system “follows” the trend of interest of the users. “Low Interest” items will decline in their ranking while “High Interest” items will have an increasing ranking. A person skilled in the art would appreciate that there is also a level of inters that will keep the ranking unchanged.
- 5. Ranking of an item that is reduced overtime does not make it inaccessible with the methods described in this invention:
- a. If they belong to a subject that is active (being searched now), it means that they will be displayed to the user at a “low location” in search results lists (whichever URLs or related queries).
- b. If they constitute the subject that is active (that is, there are no other items in the active subject) they will be presented high in the results lists.
- In another embodiment of the current invention the “ranking erosion” may be used on a basing of “ordered ranking weights” and not as a function of time. This can be implemented using equation (3) above without the time parameter m:
-
R=R 0 *F+R 1 (4) - In such a case a ranking of an item does not change due to passing time without ranking. The contribution of each ranking event to the accumulated ranking is lowest for the first ranking and highest for the last ranking.
- Both equations (3) and (4) represent methods for weighted ranking reflecting the usage and interest of the users. The specific implementation of these or other methods depends on the needs of the user and can be configured to combine these equations and also configured to use other weighting methods.
- In another embodiment of the present invention the search results can be presented with checkbox associated with each reference, as shown by
reference number 242 inFIG. 2 . - Part of these checkboxes, or all of them, can be checked to indicate that a specific action is desired in relation to the associated references. The action can be selected by a variety of means, such as a pull-down menu shown by
reference number 244 inFIG. 2 . - A particular action is a generation of a new results page containing only the items selected by checking the checkboxes. The selections made by the user are fed-back to the system. The program is configured to generate a new document containing only the selected items.
- This new document containing only the selected results can be used to serve a variety of needs:
-
- 1. Be presented to the user for additional interaction.
- 2. Be saved in a storage device as a single document that is relevant to the subject of this search.
- This page can be retrieved then by any indexing search engine or by the system of the current invention, with association to the query or search session that was active while this document was created.
- 3. Be sent by email to another user.
- It would be appreciated by those skilled in the art that efficiency of
System 100 depends on the computers in use, communication networks and other device parameters. - The flow of process, as described hereinabove may be modified to suit less efficient devices by avoiding updating the windows of
FIG. 2 following any change in any window. Instead, update may be performed as a response to a predetermined partial group of changes or only by an explicit request from the user. - It is also appreciated that non-Boolean query systems, such as Natural Language Queries, may be used in the present invention.
- The hereinabove embodiments are described in a way of example only and do not restrict the scope of the invention.
- The scope of the invention is defined solely by the claims provided hereinbelow:
Claims (20)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US12/909,703 US20110099164A1 (en) | 2009-10-23 | 2010-10-21 | Apparatus and method for search and retrieval of documents and advertising targeting |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US25431309P | 2009-10-23 | 2009-10-23 | |
US12/909,703 US20110099164A1 (en) | 2009-10-23 | 2010-10-21 | Apparatus and method for search and retrieval of documents and advertising targeting |
Publications (1)
Publication Number | Publication Date |
---|---|
US20110099164A1 true US20110099164A1 (en) | 2011-04-28 |
Family
ID=43899254
Family Applications (8)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US12/909,703 Abandoned US20110099164A1 (en) | 2009-10-23 | 2010-10-21 | Apparatus and method for search and retrieval of documents and advertising targeting |
US13/503,352 Active - Reinstated 2031-12-10 US9443004B2 (en) | 2009-10-23 | 2010-10-22 | Social graph data analytics |
US15/224,063 Abandoned US20160337217A1 (en) | 2009-10-23 | 2016-07-29 | Social graph data analytics |
US15/953,011 Active US10187277B2 (en) | 2009-10-23 | 2018-04-13 | Scoring using distributed database with encrypted communications for credit-granting and identification verification |
US16/195,946 Active US10348586B2 (en) | 2009-10-23 | 2018-11-20 | Parallel computatonal framework and application server for determining path connectivity |
US16/410,272 Active US10812354B2 (en) | 2009-10-23 | 2019-05-13 | Parallel computational framework and application server for determining path connectivity |
US16/995,293 Active 2031-01-13 US11665072B2 (en) | 2009-10-23 | 2020-08-17 | Parallel computational framework and application server for determining path connectivity |
US18/310,590 Pending US20230275817A1 (en) | 2009-10-23 | 2023-05-02 | Parallel computational framework and application server for determining path connectivity |
Family Applications After (7)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US13/503,352 Active - Reinstated 2031-12-10 US9443004B2 (en) | 2009-10-23 | 2010-10-22 | Social graph data analytics |
US15/224,063 Abandoned US20160337217A1 (en) | 2009-10-23 | 2016-07-29 | Social graph data analytics |
US15/953,011 Active US10187277B2 (en) | 2009-10-23 | 2018-04-13 | Scoring using distributed database with encrypted communications for credit-granting and identification verification |
US16/195,946 Active US10348586B2 (en) | 2009-10-23 | 2018-11-20 | Parallel computatonal framework and application server for determining path connectivity |
US16/410,272 Active US10812354B2 (en) | 2009-10-23 | 2019-05-13 | Parallel computational framework and application server for determining path connectivity |
US16/995,293 Active 2031-01-13 US11665072B2 (en) | 2009-10-23 | 2020-08-17 | Parallel computational framework and application server for determining path connectivity |
US18/310,590 Pending US20230275817A1 (en) | 2009-10-23 | 2023-05-02 | Parallel computational framework and application server for determining path connectivity |
Country Status (2)
Country | Link |
---|---|
US (8) | US20110099164A1 (en) |
WO (1) | WO2011047474A1 (en) |
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20130066902A1 (en) * | 2011-09-08 | 2013-03-14 | Takayuki Iida | Information processing apparatus, information processing method, and computer-readable storage medium |
US20150347390A1 (en) * | 2014-05-30 | 2015-12-03 | Vavni, Inc. | Compliance Standards Metadata Generation |
US9959321B2 (en) * | 2010-09-24 | 2018-05-01 | Facebook, Inc. | Ranking search results by social relevancy |
US10104417B2 (en) | 2016-07-26 | 2018-10-16 | At&T Mobility Ii Llc | Method and apparatus for sponsored messaging |
US10382819B2 (en) * | 2010-08-16 | 2019-08-13 | S.I.Sv.El. Societa Italiana Per Lo Sviluppo Dell'elettronica S.P.A. | Method and apparatus for selecting at least one media item |
US10545999B2 (en) | 2013-12-14 | 2020-01-28 | Microsoft Technology Licensing, Llc | Building features and indexing for knowledge-based matching |
US10719896B2 (en) * | 2013-09-13 | 2020-07-21 | Keith FISHBERG | Amenity, special service and food/beverage search and purchase booking system |
Families Citing this family (42)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102668457B (en) | 2009-09-30 | 2016-07-06 | 柯蔼文 | For determining the internuncial system and method in community |
US20110099164A1 (en) | 2009-10-23 | 2011-04-28 | Haim Zvi Melman | Apparatus and method for search and retrieval of documents and advertising targeting |
WO2011106897A1 (en) | 2010-03-05 | 2011-09-09 | Chrapko Evan V | Systems and methods for conducting more reliable assessments with connectivity statistics |
WO2011134086A1 (en) | 2010-04-30 | 2011-11-03 | Evan V Chrapko | Systems and methods for conducting reliable assessments with connectivity information |
US9324112B2 (en) | 2010-11-09 | 2016-04-26 | Microsoft Technology Licensing, Llc | Ranking authors in social media systems |
US9286619B2 (en) | 2010-12-27 | 2016-03-15 | Microsoft Technology Licensing, Llc | System and method for generating social summaries |
GB201113123D0 (en) * | 2011-07-29 | 2011-09-14 | Oleynik Mark | Network system and method |
JP5772381B2 (en) * | 2011-08-15 | 2015-09-02 | 富士通株式会社 | Yield calculation program, information processing method and apparatus |
US10803513B1 (en) * | 2011-09-16 | 2020-10-13 | Credit Sesame, Inc. | Financial responsibility indicator system and method |
US8700683B2 (en) | 2011-10-24 | 2014-04-15 | Nokia Corporation | Method and apparatus for providing a key-value based storage interface |
US20130129075A1 (en) * | 2011-11-22 | 2013-05-23 | Incontact, Inc. | Systems and methods of using social media in contact handling systems |
WO2013097026A1 (en) | 2011-12-28 | 2013-07-04 | Chrapko Evan V | Systems and methods for visualizing social graphs |
WO2013181541A1 (en) * | 2012-06-01 | 2013-12-05 | Treiser Adam | Systems and methods for displaying relationships between data items, individuals, and dynamically calculated metric scores |
US9881091B2 (en) | 2013-03-08 | 2018-01-30 | Google Inc. | Content item audience selection |
US9858317B1 (en) | 2012-12-03 | 2018-01-02 | Google Inc. | Ranking communities based on members |
US9497234B2 (en) * | 2012-12-27 | 2016-11-15 | Facebook, Inc. | Implicit social graph connections |
US9294576B2 (en) | 2013-01-02 | 2016-03-22 | Microsoft Technology Licensing, Llc | Social media impact assessment |
US20140189000A1 (en) * | 2013-01-02 | 2014-07-03 | Microsoft Corporation | Social media impact assessment |
US10044820B2 (en) | 2013-09-23 | 2018-08-07 | Infosys Limited | Method and system for automated transaction analysis |
GB2524073A (en) * | 2014-03-14 | 2015-09-16 | Ibm | Communication method and system for accessing media data |
WO2015168835A1 (en) | 2014-05-05 | 2015-11-12 | Empire Technology Development Llc | Composite task processor |
US10572488B2 (en) | 2014-06-13 | 2020-02-25 | Koverse, Inc. | System and method for data organization, optimization and analytics |
US9578043B2 (en) | 2015-03-20 | 2017-02-21 | Ashif Mawji | Calculating a trust score |
GB2536932A (en) * | 2015-03-31 | 2016-10-05 | Fujitsu Ltd | System, method, and program for storing and analysing a data graph |
US10853378B1 (en) * | 2015-08-25 | 2020-12-01 | Palantir Technologies Inc. | Electronic note management via a connected entity graph |
WO2017068062A1 (en) * | 2015-10-22 | 2017-04-27 | Koninklijke Kpn N.V. | Method for enabling establishment of a direct connection |
US20170235792A1 (en) | 2016-02-17 | 2017-08-17 | Www.Trustscience.Com Inc. | Searching for entities based on trust score and geography |
US9438619B1 (en) | 2016-02-29 | 2016-09-06 | Leo M. Chan | Crowdsourcing of trustworthiness indicators |
US9679254B1 (en) | 2016-02-29 | 2017-06-13 | Www.Trustscience.Com Inc. | Extrapolating trends in trust scores |
US9721296B1 (en) | 2016-03-24 | 2017-08-01 | Www.Trustscience.Com Inc. | Learning an entity's trust model and risk tolerance to calculate a risk score |
US10356075B2 (en) * | 2017-03-15 | 2019-07-16 | International Business Machines Corporation | Automated verification of chains of credentials |
US10180969B2 (en) | 2017-03-22 | 2019-01-15 | Www.Trustscience.Com Inc. | Entity resolution and identity management in big, noisy, and/or unstructured data |
US10606866B1 (en) * | 2017-03-30 | 2020-03-31 | Palantir Technologies Inc. | Framework for exposing network activities |
US10965668B2 (en) * | 2017-04-27 | 2021-03-30 | Acuant, Inc. | Systems and methods to authenticate users and/or control access made by users based on enhanced digital identity verification |
US11276022B2 (en) | 2017-10-20 | 2022-03-15 | Acuant, Inc. | Enhanced system and method for identity evaluation using a global score value |
CN107729569B (en) * | 2017-11-17 | 2020-01-17 | 杭州师范大学 | Social relationship prediction method fusing network structure and text information |
US10977268B2 (en) | 2019-05-31 | 2021-04-13 | Snowflake Inc. | Data exchange |
BR112021024817A2 (en) * | 2019-06-18 | 2022-01-25 | Qualcomm Inc | Optimization machine learning model performance |
US11205214B2 (en) | 2019-07-29 | 2021-12-21 | Luke MARIETTA | Method and system for automatically replenishing consumable items |
CN110727805A (en) * | 2019-10-11 | 2020-01-24 | 北京明略软件系统有限公司 | Community knowledge graph construction method and system |
CN113014564B (en) * | 2021-02-19 | 2022-10-21 | 提亚有限公司 | User matching method and device, computer equipment and storage medium |
US11895074B2 (en) * | 2022-05-31 | 2024-02-06 | Microsoft Technology Licensing, Llc | Systems and methods for determining scores for messages based on actions of message recipients and a network graph |
Citations (51)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4774655A (en) * | 1984-10-24 | 1988-09-27 | Telebase Systems, Inc. | System for retrieving information from a plurality of remote databases having at least two different languages |
US4799254A (en) * | 1986-06-30 | 1989-01-17 | Wang Laboratories, Inc. | Portable communication terminal for remote database query |
US5278980A (en) * | 1991-08-16 | 1994-01-11 | Xerox Corporation | Iterative technique for phrase query formation and an information retrieval system employing same |
US5321833A (en) * | 1990-08-29 | 1994-06-14 | Gte Laboratories Incorporated | Adaptive ranking system for information retrieval |
US5410693A (en) * | 1994-01-26 | 1995-04-25 | Wall Data Incorporated | Method and apparatus for accessing a database |
US5428778A (en) * | 1992-02-13 | 1995-06-27 | Office Express Pty. Ltd. | Selective dissemination of information |
US5504887A (en) * | 1993-09-10 | 1996-04-02 | International Business Machines Corporation | Storage clustering and packing of objects on the basis of query workload ranking |
US5544049A (en) * | 1992-09-29 | 1996-08-06 | Xerox Corporation | Method for performing a search of a plurality of documents for similarity to a plurality of query words |
US5576954A (en) * | 1993-11-05 | 1996-11-19 | University Of Central Florida | Process for determination of text relevancy |
US5577239A (en) * | 1994-08-10 | 1996-11-19 | Moore; Jeffrey | Chemical structure storage, searching and retrieval system |
US5642502A (en) * | 1994-12-06 | 1997-06-24 | University Of Central Florida | Method and system for searching for relevant documents from a text database collection, using statistical ranking, relevancy feedback and small pieces of text |
US5659732A (en) * | 1995-05-17 | 1997-08-19 | Infoseek Corporation | Document retrieval over networks wherein ranking and relevance scores are computed at the client for multiple database documents |
US5671404A (en) * | 1994-03-31 | 1997-09-23 | Martin Lizee | System for querying databases automatically |
US5694593A (en) * | 1994-10-05 | 1997-12-02 | Northeastern University | Distributed computer database system and method |
US5721902A (en) * | 1995-09-15 | 1998-02-24 | Infonautics Corporation | Restricted expansion of query terms using part of speech tagging |
US5742816A (en) * | 1995-09-15 | 1998-04-21 | Infonautics Corporation | Method and apparatus for identifying textual documents and multi-mediafiles corresponding to a search topic |
US5754938A (en) * | 1994-11-29 | 1998-05-19 | Herz; Frederick S. M. | Pseudonymous server for system for customized electronic identification of desirable objects |
US5794237A (en) * | 1995-11-13 | 1998-08-11 | International Business Machines Corporation | System and method for improving problem source identification in computer systems employing relevance feedback and statistical source ranking |
US5855020A (en) * | 1996-02-21 | 1998-12-29 | Infoseek Corporation | Web scan process |
US5864845A (en) * | 1996-06-28 | 1999-01-26 | Siemens Corporate Research, Inc. | Facilitating world wide web searches utilizing a multiple search engine query clustering fusion strategy |
US5864863A (en) * | 1996-08-09 | 1999-01-26 | Digital Equipment Corporation | Method for parsing, indexing and searching world-wide-web pages |
US5864846A (en) * | 1996-06-28 | 1999-01-26 | Siemens Corporate Research, Inc. | Method for facilitating world wide web searches utilizing a document distribution fusion strategy |
US5913215A (en) * | 1996-04-09 | 1999-06-15 | Seymour I. Rubinstein | Browse by prompted keyword phrases with an improved method for obtaining an initial document set |
US5940821A (en) * | 1997-05-21 | 1999-08-17 | Oracle Corporation | Information presentation in a knowledge base search and retrieval system |
US5956711A (en) * | 1997-01-16 | 1999-09-21 | Walter J. Sullivan, III | Database system with restricted keyword list and bi-directional keyword translation |
US5987457A (en) * | 1997-11-25 | 1999-11-16 | Acceleration Software International Corporation | Query refinement method for searching documents |
US6006225A (en) * | 1998-06-15 | 1999-12-21 | Amazon.Com | Refining search queries by the suggestion of correlated terms from prior searches |
US6014665A (en) * | 1997-08-01 | 2000-01-11 | Culliss; Gary | Method for organizing information |
US6018344A (en) * | 1995-11-30 | 2000-01-25 | Matsushita Electric Industrial Co., Ltd. | History display apparatus |
US6029165A (en) * | 1997-11-12 | 2000-02-22 | Arthur Andersen Llp | Search and retrieval information system and method |
US6032145A (en) * | 1998-04-10 | 2000-02-29 | Requisite Technology, Inc. | Method and system for database manipulation |
US6115718A (en) * | 1998-04-01 | 2000-09-05 | Xerox Corporation | Method and apparatus for predicting document access in a collection of linked documents featuring link proprabilities and spreading activation |
US6144958A (en) * | 1998-07-15 | 2000-11-07 | Amazon.Com, Inc. | System and method for correcting spelling errors in search queries |
US6185558B1 (en) * | 1998-03-03 | 2001-02-06 | Amazon.Com, Inc. | Identifying the items most relevant to a current query based on items selected in connection with similar queries |
US6226630B1 (en) * | 1998-07-22 | 2001-05-01 | Compaq Computer Corporation | Method and apparatus for filtering incoming information using a search engine and stored queries defining user folders |
US6243091B1 (en) * | 1997-11-21 | 2001-06-05 | International Business Machines Corporation | Global history view |
US20010034763A1 (en) * | 1999-12-08 | 2001-10-25 | Jacobs Paul E. | System for distributing advertisements to client devices |
US6405190B1 (en) * | 1999-03-16 | 2002-06-11 | Oracle Corporation | Free format query processing in an information search and retrieval system |
US6415282B1 (en) * | 1998-04-22 | 2002-07-02 | Nec Usa, Inc. | Method and apparatus for query refinement |
US6421675B1 (en) * | 1998-03-16 | 2002-07-16 | S. L. I. Systems, Inc. | Search engine |
US6460060B1 (en) * | 1999-01-26 | 2002-10-01 | International Business Machines Corporation | Method and system for searching web browser history |
US6484162B1 (en) * | 1999-06-29 | 2002-11-19 | International Business Machines Corporation | Labeling and describing search queries for reuse |
US6564213B1 (en) * | 2000-04-18 | 2003-05-13 | Amazon.Com, Inc. | Search query autocompletion |
US6647383B1 (en) * | 2000-09-01 | 2003-11-11 | Lucent Technologies Inc. | System and method for providing interactive dialogue and iterative search functions to find information |
US6745178B1 (en) * | 2000-04-28 | 2004-06-01 | International Business Machines Corporation | Internet based method for facilitating networking among persons with similar interests and for facilitating collaborative searching for information |
US20040172445A1 (en) * | 1999-07-01 | 2004-09-02 | Kaviraj Singh | Workflow as data-transition driven, scriptable state machines |
US20050071325A1 (en) * | 2003-09-30 | 2005-03-31 | Jeremy Bem | Increasing a number of relevant advertisements using a relaxed match |
US20050114325A1 (en) * | 2000-10-30 | 2005-05-26 | Microsoft Corporation | Semi-automatic annotation of multimedia objects |
US20050283468A1 (en) * | 2004-06-22 | 2005-12-22 | Kamvar Sepandar D | Anticipated query generation and processing in a search engine |
US20060041843A1 (en) * | 2004-08-20 | 2006-02-23 | Fuji Xerox Co., Ltd. | Recommendation aggregation for digest generation |
US20080250026A1 (en) * | 2001-10-24 | 2008-10-09 | Linden Gregory D | Recommendations based on cross-site browsing activities of users |
Family Cites Families (245)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CA2089875C (en) * | 1991-06-19 | 1999-02-09 | Takao Ogura | Packet directional path identifier transfer system |
US6108308A (en) | 1996-09-17 | 2000-08-22 | International Business Machines Corporation | System and method for dynamic video routing |
US5860605A (en) | 1996-10-11 | 1999-01-19 | Johannes Petrus Andreas Josephus Van Der Zanden | Method and device for synchronously making material collide |
JP3436871B2 (en) | 1997-10-23 | 2003-08-18 | 株式会社東芝 | Communication resource management method and node device |
SG77163A1 (en) | 1998-03-06 | 2000-12-19 | John Francis Chong | A method of implementing an acyclic directed graph structure using a relational database |
US6509898B2 (en) | 1998-04-17 | 2003-01-21 | Xerox Corporation | Usage based methods of traversing and displaying generalized graph structures |
US6751729B1 (en) | 1998-07-24 | 2004-06-15 | Spatial Adventures, Inc. | Automated operation and security system for virtual private networks |
US6356902B1 (en) | 1998-07-28 | 2002-03-12 | Matsushita Electric Industrial Co., Ltd. | Method and system for storage and retrieval of multimedia objects |
US6286007B1 (en) | 1998-10-13 | 2001-09-04 | International Business Machines Corporation | Method and system for efficiently storing and viewing data in a database |
US6823299B1 (en) | 1999-07-09 | 2004-11-23 | Autodesk, Inc. | Modeling objects, systems, and simulations by establishing relationships in an event-driven graph in a computer implemented graphics system |
US6446048B1 (en) | 1999-09-03 | 2002-09-03 | Intuit, Inc. | Web-based entry of financial transaction information and subsequent download of such information |
US7086085B1 (en) | 2000-04-11 | 2006-08-01 | Bruce E Brown | Variable trust levels for authentication |
JP2001298453A (en) | 2000-04-14 | 2001-10-26 | Fuji Xerox Co Ltd | Network display device |
US7123620B1 (en) * | 2000-04-25 | 2006-10-17 | Cisco Technology, Inc. | Apparatus and method for scalable and dynamic traffic engineering in a data communication network |
JP2002123649A (en) | 2000-10-13 | 2002-04-26 | Nippon Telegr & Teleph Corp <Ntt> | Device and method for credit investigation and recording medium recording credit investigation program in the credit investigation device |
WO2002036831A2 (en) | 2000-10-30 | 2002-05-10 | Monsanto Technology Llc | Canola event pv-bngt04(rt73) and compositions and methods for detection thereof |
US6738777B2 (en) | 2000-12-20 | 2004-05-18 | Microsoft Corporation | Chaining actions for a directed graph |
US6708308B2 (en) | 2001-01-10 | 2004-03-16 | International Business Machines Corporation | Soft output viterbi algorithm (SOVA) with error filters |
US7130908B1 (en) | 2001-03-13 | 2006-10-31 | Intelsat Ltd. | Forward cache management between edge nodes in a satellite based content delivery system |
US7002927B2 (en) * | 2001-08-01 | 2006-02-21 | International Business Machines Corporation | Self-scaling network |
US6912549B2 (en) | 2001-09-05 | 2005-06-28 | Siemens Medical Solutions Health Services Corporation | System for processing and consolidating records |
US7130262B1 (en) | 2002-01-16 | 2006-10-31 | At & T Corp. | Method and apparatus for providing alternative link weights for failed network paths |
JP3792166B2 (en) | 2002-02-27 | 2006-07-05 | 株式会社リコー | Internet facsimile machine |
US20030172291A1 (en) | 2002-03-08 | 2003-09-11 | Paul Judge | Systems and methods for automated whitelisting in monitored communications |
US7069483B2 (en) | 2002-05-13 | 2006-06-27 | Kiyon, Inc. | System and method for identifying nodes in a wireless mesh network |
US20080015916A1 (en) | 2002-05-22 | 2008-01-17 | International Business Machines Corporation | Using configurable programmatic rules for automatically changing a trust status of candidates contained in a private business registry |
US7633867B2 (en) | 2002-06-10 | 2009-12-15 | Alcatel-Lucent Usa Inc. | Capacity allocation for networks having path length routing constraints |
US7069259B2 (en) | 2002-06-28 | 2006-06-27 | Microsoft Corporation | Multi-attribute specification of preferences about people, priorities and privacy for guiding messaging and communications |
US8237714B1 (en) | 2002-07-02 | 2012-08-07 | James Burke | Layered and vectored graphical user interface to a knowledge and relationship rich data source |
US7512612B1 (en) * | 2002-08-08 | 2009-03-31 | Spoke Software | Selecting an optimal path through a relationship graph |
US7139837B1 (en) | 2002-10-04 | 2006-11-21 | Ipolicy Networks, Inc. | Rule engine |
US7225118B2 (en) | 2002-10-31 | 2007-05-29 | Hewlett-Packard Development Company, L.P. | Global data placement |
US20040122803A1 (en) * | 2002-12-19 | 2004-06-24 | Dom Byron E. | Detect and qualify relationships between people and find the best path through the resulting social network |
JP4068473B2 (en) | 2003-02-19 | 2008-03-26 | 株式会社東芝 | Storage device, assignment range determination method and program |
US7603291B2 (en) | 2003-03-14 | 2009-10-13 | Sap Aktiengesellschaft | Multi-modal sales applications |
US20040181518A1 (en) | 2003-03-14 | 2004-09-16 | Mayo Bryan Edward | System and method for an OLAP engine having dynamic disaggregation |
AU2003233574B9 (en) | 2003-05-17 | 2010-03-25 | Microsoft Corporation | Mechanism for evaluating security risks |
US20040239674A1 (en) | 2003-06-02 | 2004-12-02 | Microsoft Corporation | Modeling graphs as XML information sets and describing graphs with XML schema |
US7822631B1 (en) | 2003-08-22 | 2010-10-26 | Amazon Technologies, Inc. | Assessing content based on assessed trust in users |
EP1511232B1 (en) | 2003-08-28 | 2008-05-28 | Nokia Siemens Networks Gmbh & Co. Kg | A method for transmission of data packets through a network |
US7668665B2 (en) | 2003-09-22 | 2010-02-23 | Advanced Structure Monitoring, Inc. | Methods of networking interrogation devices for structural conditions |
JP2005135071A (en) * | 2003-10-29 | 2005-05-26 | Hewlett-Packard Development Co Lp | Method and device for calculating trust values on purchase |
JP2005149202A (en) | 2003-11-17 | 2005-06-09 | Nippon Telegr & Teleph Corp <Ntt> | Community formation system, community formation method, program and storage medium |
US20050243736A1 (en) | 2004-04-19 | 2005-11-03 | International Business Machines Corporation | System, method, and service for finding an optimal collection of paths among a plurality of paths between two nodes in a complex network |
US7856449B1 (en) | 2004-05-12 | 2010-12-21 | Cisco Technology, Inc. | Methods and apparatus for determining social relevance in near constant time |
US7426557B2 (en) | 2004-05-14 | 2008-09-16 | International Business Machines Corporation | System, method, and service for inducing a pattern of communication among various parties |
US8010458B2 (en) | 2004-05-26 | 2011-08-30 | Facebook, Inc. | System and method for managing information flow between members of an online social network |
JP2005339281A (en) | 2004-05-27 | 2005-12-08 | Ntt Communications Kk | Trustworthiness calculating apparatus, trustworthiness calculation method, and program therefor |
US7805407B1 (en) | 2004-06-16 | 2010-09-28 | Oracle America, Inc. | System and method for dynamic configuration of replicated database servers |
US8621215B1 (en) | 2004-06-30 | 2013-12-31 | Google Inc. | Methods and systems for creating monetary accounts for members in a social network |
US8302164B2 (en) | 2004-07-22 | 2012-10-30 | Facebook, Inc. | Authorization and authentication based on an individual's social network |
US8010460B2 (en) | 2004-09-02 | 2011-08-30 | Linkedin Corporation | Method and system for reputation evaluation of online users in a social networking scheme |
US8392590B2 (en) | 2004-09-10 | 2013-03-05 | Cavium, Inc. | Deterministic finite automata (DFA) processing |
US20130097184A1 (en) | 2004-09-15 | 2013-04-18 | Yahoo! Inc. | Automatic updating of trust networks in recommender systems |
JP4543871B2 (en) | 2004-10-15 | 2010-09-15 | 富士ゼロックス株式会社 | Information processing system, information processing method, and computer program |
WO2006047879A1 (en) | 2004-11-04 | 2006-05-11 | Topeer Corporation | System and method for creating a secure trusted social network |
US7733804B2 (en) | 2004-11-29 | 2010-06-08 | Signacert, Inc. | Method and apparatus to establish routes based on the trust scores of routers within an IP routing domain |
US8266676B2 (en) | 2004-11-29 | 2012-09-11 | Harris Corporation | Method to verify the integrity of components on a trusted platform using integrity database services |
US7272719B2 (en) | 2004-11-29 | 2007-09-18 | Signacert, Inc. | Method to control access between network endpoints based on trust scores calculated from information system component analysis |
EP1856639A2 (en) | 2005-03-02 | 2007-11-21 | Markmonitor, Inc. | Distribution of trust data |
KR100690021B1 (en) | 2005-03-15 | 2007-03-08 | 엔에이치엔(주) | Online human network management system and method for stimulating users to build various faces of relation |
JP2006260099A (en) | 2005-03-16 | 2006-09-28 | Fuji Xerox Co Ltd | Inter-user relation calculating device and method |
US7743254B2 (en) | 2005-03-23 | 2010-06-22 | Microsoft Corporation | Visualization of trust in an address bar |
US20060248573A1 (en) | 2005-04-28 | 2006-11-02 | Content Guard Holdings, Inc. | System and method for developing and using trusted policy based on a social model |
US7958120B2 (en) | 2005-05-10 | 2011-06-07 | Netseer, Inc. | Method and apparatus for distributed community finding |
JP2007004411A (en) | 2005-06-23 | 2007-01-11 | Hewlett-Packard Development Co Lp | Integrated device/method for two or more confidence network graph |
US20060290697A1 (en) | 2005-06-24 | 2006-12-28 | Tom Sawyer Software | System for arranging a plurality of relational nodes into graphical layout form |
US8086605B2 (en) | 2005-06-28 | 2011-12-27 | Yahoo! Inc. | Search engine with augmented relevance ranking by community participation |
US9167053B2 (en) | 2005-09-29 | 2015-10-20 | Ipass Inc. | Advanced network characterization |
EP1974322A2 (en) | 2005-10-07 | 2008-10-01 | Sap Ag | Enterprise integrity content generation and utilization |
US20070087819A1 (en) | 2005-10-14 | 2007-04-19 | Leviathan Entertainment, Llc | Financial institutions and instruments in a virtual environment |
US20070136086A1 (en) | 2005-10-17 | 2007-06-14 | Luerssen Brian T | System and method for providing location-based information to a mobile device |
JP2007140843A (en) | 2005-11-17 | 2007-06-07 | Fuji Xerox Co Ltd | Link relationship display, control method for link relationship display, and program |
WO2007062885A1 (en) | 2005-11-29 | 2007-06-07 | International Business Machines Corporation | Method and system for extracting and visualizing graph-structured relations from unstructured text |
EP1969555A4 (en) | 2005-12-16 | 2013-03-13 | John Stannard Davis | Trust-based rating system |
US20070162761A1 (en) | 2005-12-23 | 2007-07-12 | Davis Bruce L | Methods and Systems to Help Detect Identity Fraud |
US7877353B2 (en) | 2006-03-13 | 2011-01-25 | Ebay Inc. | Peer-to-peer trading platform with relative reputation-based item search and buddy rating |
JP5087850B2 (en) | 2006-03-14 | 2012-12-05 | 富士通株式会社 | Service mediation method, service mediation device, and service mediation system |
US7865551B2 (en) | 2006-05-05 | 2011-01-04 | Sony Online Entertainment Llc | Determining influential/popular participants in a communication network |
US8018471B2 (en) * | 2006-05-15 | 2011-09-13 | Microsoft Corporation | Visual component/clause merging |
US7961189B2 (en) | 2006-05-16 | 2011-06-14 | Sony Corporation | Displaying artists related to an artist of interest |
WO2007142566A1 (en) | 2006-06-09 | 2007-12-13 | Telefonaktiebolaget Lm Ericsson (Publ) | Access to services in a telecommunications network |
US7458049B1 (en) | 2006-06-12 | 2008-11-25 | Magma Design Automation, Inc. | Aggregate sensitivity for statistical static timing analysis |
US20080005096A1 (en) | 2006-06-29 | 2008-01-03 | Yahoo! Inc. | Monetization of characteristic values predicted using network-based social ties |
US7685192B1 (en) * | 2006-06-30 | 2010-03-23 | Amazon Technologies, Inc. | Method and system for displaying interest space user communities |
US7596597B2 (en) | 2006-08-31 | 2009-09-29 | Microsoft Corporation | Recommending contacts in a social network |
US20080133391A1 (en) | 2006-09-05 | 2008-06-05 | Kerry Ivan Kurian | User interface for sociofinancial systems and methods |
US8190610B2 (en) | 2006-10-05 | 2012-05-29 | Yahoo! Inc. | MapReduce for distributed database processing |
US7706265B2 (en) | 2006-10-30 | 2010-04-27 | Telefonaktiebolaget L M Ericsson (Publ) | Decentralized node, access edge node, and access node for aggregating data traffic over an access domain, and method thereof |
US20080104225A1 (en) | 2006-11-01 | 2008-05-01 | Microsoft Corporation | Visualization application for mining of social networks |
JP5020610B2 (en) | 2006-11-24 | 2012-09-05 | 株式会社日立ソリューションズ | Social network analysis processor |
US7886334B1 (en) | 2006-12-11 | 2011-02-08 | Qurio Holdings, Inc. | System and method for social network trust assessment |
US20080183378A1 (en) | 2007-01-17 | 2008-07-31 | Weidner David P | Multi-level path mapping for street grid and non-street grid entities |
US10007895B2 (en) | 2007-01-30 | 2018-06-26 | Jonathan Brian Vanasco | System and method for indexing, correlating, managing, referencing and syndicating identities and relationships across systems |
WO2008120267A1 (en) | 2007-03-28 | 2008-10-09 | Fujitsu Limited | Edge node redundant system |
US8838478B2 (en) | 2007-05-11 | 2014-09-16 | Sony Corporation | Targeted advertising in mobile devices |
GB2443582C (en) | 2007-05-18 | 2009-09-03 | Cvon Innovations Ltd | Characteristic identifying system and method. |
US7685141B2 (en) | 2007-06-06 | 2010-03-23 | Yahoo! Inc. | Connection sub-graphs in entity relationship graphs |
CA2691166A1 (en) | 2007-06-27 | 2008-12-31 | Liu Dongxu | Polypeptides and polynucleotides for artemin and related ligands, and methods of use thereof |
JP2009025871A (en) | 2007-07-17 | 2009-02-05 | Hewlett-Packard Development Co Lp | Access restriction device and its method |
US8874572B1 (en) | 2007-07-31 | 2014-10-28 | Megree, Inc. | Method and computer program product for operating a social networking site |
US20110135648A1 (en) | 2007-08-08 | 2011-06-09 | Biogen Idec Ma Inc. | Anti-neublastin antibodies and uses thereof |
DE602007002633D1 (en) | 2007-08-08 | 2009-11-12 | Sap Ag | Method and system for reconciling untraceable secrets |
US8725673B2 (en) | 2007-08-22 | 2014-05-13 | Linkedin Corporation | Evaluating an item based on user reputation information |
KR101391599B1 (en) | 2007-09-05 | 2014-05-09 | 삼성전자주식회사 | Method for generating an information of relation between characters in content and appratus therefor |
US8255975B2 (en) | 2007-09-05 | 2012-08-28 | Intel Corporation | Method and apparatus for a community-based trust |
US7917574B2 (en) | 2007-10-01 | 2011-03-29 | Accenture Global Services Limited | Infrastructure for parallel programming of clusters of machines |
US9536256B2 (en) | 2007-10-08 | 2017-01-03 | First Data Corporation | Systems and methods for stored-value exchange within social networking environments |
US8214883B2 (en) * | 2007-10-22 | 2012-07-03 | Microsoft Corporation | Using social networks while respecting access control lists |
JP2009146253A (en) | 2007-12-17 | 2009-07-02 | Sony Corp | Information processor, information processing method and program |
US20090198562A1 (en) | 2008-01-31 | 2009-08-06 | Guenter Wiesinger | Generating social graph using market data |
US20120095955A1 (en) * | 2008-03-06 | 2012-04-19 | Arun Darlie Koshy | Facilitating relationships and information transactions |
US8606721B1 (en) | 2008-03-11 | 2013-12-10 | Amazon Technologies, Inc. | Implicit social graph edge strengths |
US20090276233A1 (en) | 2008-05-05 | 2009-11-05 | Brimhall Jeffrey L | Computerized credibility scoring |
US20090327054A1 (en) | 2008-06-27 | 2009-12-31 | Microsoft Corporation | Personal reputation system based on social networking |
US8108536B1 (en) | 2008-06-30 | 2012-01-31 | Symantec Corporation | Systems and methods for determining the trustworthiness of a server in a streaming environment |
US7930255B2 (en) | 2008-07-02 | 2011-04-19 | International Business Machines Corporation | Social profile assessment |
US8364605B2 (en) * | 2008-07-13 | 2013-01-29 | Tros Interactive Ltd. | Calculating connectivity, social proximity and trust level between web user |
US8943549B2 (en) | 2008-08-12 | 2015-01-27 | First Data Corporation | Methods and systems for online fraud protection |
US8010602B2 (en) | 2008-08-28 | 2011-08-30 | Microsoft Corporation | Leveraging communications to identify social network friends |
US20100076987A1 (en) | 2008-09-10 | 2010-03-25 | Benjamin Schreiner | Trust Profile Aggregation from Various Trust Record Sources |
WO2010048172A1 (en) | 2008-10-20 | 2010-04-29 | Cascaad Srl | Social graph based recommender |
US20100106557A1 (en) | 2008-10-24 | 2010-04-29 | Novell, Inc. | System and method for monitoring reputation changes |
CN101393566A (en) | 2008-11-17 | 2009-03-25 | 北京交通大学 | Information tracking and detecting method and system based on network structure user pattern of behavior |
JP5640015B2 (en) | 2008-12-01 | 2014-12-10 | トプシー ラブズ インコーポレイテッド | Ranking and selection entities based on calculated reputation or impact scores |
WO2010067229A1 (en) | 2008-12-12 | 2010-06-17 | Koninklijke Philips Electronics, N.V. | Automated assertion reuse for improved record linkage in distributed & autonomous healthcare environments with heterogeneous trust models |
US20100169137A1 (en) | 2008-12-31 | 2010-07-01 | Ebay Inc. | Methods and systems to analyze data using a graph |
US8065433B2 (en) * | 2009-01-09 | 2011-11-22 | Microsoft Corporation | Hybrid butterfly cube architecture for modular data centers |
US8170958B1 (en) | 2009-01-29 | 2012-05-01 | Intuit Inc. | Internet reputation manager |
US8539359B2 (en) | 2009-02-11 | 2013-09-17 | Jeffrey A. Rapaport | Social network driven indexing system for instantly clustering people with concurrent focus on same topic into on-topic chat rooms and/or for generating on-topic search results tailored to user preferences regarding topic |
US20100217525A1 (en) | 2009-02-25 | 2010-08-26 | King Simon P | System and Method for Delivering Sponsored Landmark and Location Labels |
US8689172B2 (en) | 2009-03-24 | 2014-04-01 | International Business Machines Corporation | Mining sequential patterns in weighted directed graphs |
US9817872B2 (en) | 2009-03-26 | 2017-11-14 | International Business Machines Corporation | Method and apparatus for social trust networks on messaging platforms |
US8234688B2 (en) | 2009-04-03 | 2012-07-31 | International Business Machines Corporation | Managing privacy settings for a social network |
US8306973B2 (en) | 2009-04-06 | 2012-11-06 | Google Inc. | Method for generating location targeted, keyword-triggered, ads and generating user recallable layer-based ads |
US20100262610A1 (en) | 2009-04-09 | 2010-10-14 | International Business Machines Corporation | Identifying Subject Matter Experts |
US10257016B2 (en) | 2009-06-08 | 2019-04-09 | Wsou Investments, Llc | Virtual leased line address resolution protocol cache for customer edge internet protocol addresses |
US8583571B2 (en) | 2009-07-30 | 2013-11-12 | Marchex, Inc. | Facility for reconciliation of business records using genetic algorithms |
CA2675701A1 (en) | 2009-08-27 | 2009-11-05 | Ibm Canada Limited - Ibm Canada Limitee | Trust assertion using hierarchical weights |
CN102668457B (en) | 2009-09-30 | 2016-07-06 | 柯蔼文 | For determining the internuncial system and method in community |
US20110099164A1 (en) | 2009-10-23 | 2011-04-28 | Haim Zvi Melman | Apparatus and method for search and retrieval of documents and advertising targeting |
US8239364B2 (en) | 2009-12-08 | 2012-08-07 | Facebook, Inc. | Search and retrieval of objects in a social networking system |
US8443366B1 (en) | 2009-12-11 | 2013-05-14 | Salesforce.Com, Inc. | Techniques for establishing a parallel processing framework for a multi-tenant on-demand database system |
US8484154B2 (en) | 2009-12-14 | 2013-07-09 | Intel Corporation | Methods and systems to traverse graph-based networks |
US20110173344A1 (en) | 2010-01-12 | 2011-07-14 | Mihaly Attila | System and method of reducing intranet traffic on bottleneck links in a telecommunications network |
US20130173457A1 (en) | 2010-01-14 | 2013-07-04 | Evan V. Chrapko | Systems and methods for conducting more reliable financial transactions, credit decisions, and security assessments |
US8195883B2 (en) | 2010-01-27 | 2012-06-05 | Oracle America, Inc. | Resource sharing to reduce implementation costs in a multicore processor |
EP2529298A4 (en) | 2010-01-29 | 2013-10-23 | Dun & Bradstreet Corp | System and method for aggregation and association of professional affiliation data with commercial data content |
BR112012019739A2 (en) | 2010-02-08 | 2020-09-08 | Facebook, Inc. | method to track information about the activities of users of a social networking system in another domain, system and computer-readable media. |
WO2011106897A1 (en) | 2010-03-05 | 2011-09-09 | Chrapko Evan V | Systems and methods for conducting more reliable assessments with connectivity statistics |
CN101902459B (en) | 2010-03-18 | 2013-01-30 | 中国科学院计算技术研究所 | Trust selection method and system for nodes in P2P network by applying P4P |
US9319390B2 (en) | 2010-03-26 | 2016-04-19 | Nokia Technologies Oy | Method and apparatus for providing a trust level to access a resource |
US8812585B2 (en) | 2010-03-29 | 2014-08-19 | Google Inc. | Trusted maps: updating map locations using trust-based social graphs |
EP2556470A4 (en) | 2010-04-06 | 2014-07-16 | Right 90 Inc | Trust rating metric for future event prediction of an outcome |
CN101841539A (en) | 2010-04-16 | 2010-09-22 | 工业和信息化部电信传输研究所 | Method, device and system for grid resource allocation based on trust |
US8572129B1 (en) | 2010-04-19 | 2013-10-29 | Facebook, Inc. | Automatically generating nodes and edges in an integrated social graph |
US8918418B2 (en) | 2010-04-19 | 2014-12-23 | Facebook, Inc. | Default structured search queries on online social networks |
US8244848B1 (en) | 2010-04-19 | 2012-08-14 | Facebook, Inc. | Integrated social network environment |
US8180804B1 (en) | 2010-04-19 | 2012-05-15 | Facebook, Inc. | Dynamically generating recommendations based on social graph information |
US9530166B2 (en) | 2010-04-21 | 2016-12-27 | Facebook, Inc. | Social graph that includes web pages outside of a social networking system |
WO2011134086A1 (en) | 2010-04-30 | 2011-11-03 | Evan V Chrapko | Systems and methods for conducting reliable assessments with connectivity information |
US9990429B2 (en) | 2010-05-14 | 2018-06-05 | Microsoft Technology Licensing, Llc | Automated social networking graph mining and visualization |
CA2704866A1 (en) | 2010-05-19 | 2011-11-19 | Vendasta Technologies Inc. | Unifying social graphs across multiple social networks |
US20110295626A1 (en) | 2010-05-28 | 2011-12-01 | Microsoft Corporation | Influence assessment in social networks |
US20110314557A1 (en) | 2010-06-16 | 2011-12-22 | Adknowledge, Inc. | Click Fraud Control Method and System |
US8489641B1 (en) | 2010-07-08 | 2013-07-16 | Google Inc. | Displaying layers of search results on a map |
US8150844B2 (en) | 2010-08-18 | 2012-04-03 | Facebook, Inc. | Location ranking using social graph information |
US8832093B2 (en) | 2010-08-18 | 2014-09-09 | Facebook, Inc. | Dynamic place visibility in geo-social networking system |
US20140172708A1 (en) | 2010-09-16 | 2014-06-19 | Evan V Chrapko | Systems and methods for providing virtual currencies |
TWI447584B (en) | 2010-11-01 | 2014-08-01 | Inst Information Industry | System for multi-user network storage service sharing and method thereof |
JP2012146377A (en) | 2011-01-14 | 2012-08-02 | Elpida Memory Inc | Semiconductor device |
US20120197758A1 (en) | 2011-01-27 | 2012-08-02 | Ebay Inc. | Computation of user reputation based on transaction graph |
US9147273B1 (en) | 2011-02-16 | 2015-09-29 | Hrl Laboratories, Llc | System and method for modeling and analyzing data via hierarchical random graphs |
GB2488373A (en) | 2011-02-28 | 2012-08-29 | Hsbc Holdings Plc | Database ranks results based on reputational scores |
CN102685661A (en) | 2011-03-15 | 2012-09-19 | 芯讯通无线科技(上海)有限公司 | Service information search device, mobile terminal and service information search method |
US9202200B2 (en) | 2011-04-27 | 2015-12-01 | Credibility Corp. | Indices for credibility trending, monitoring, and lead generation |
US20120282884A1 (en) | 2011-05-05 | 2012-11-08 | Nicholas Sun | System and method for the emergency voice and image e-mail transmitter device |
US20120290427A1 (en) | 2011-05-09 | 2012-11-15 | Respect Network Corporation | Apparatus and Method for Managing a Trust Network |
US8667012B2 (en) | 2011-06-09 | 2014-03-04 | Salesforce.Com, Inc. | Methods and systems for using distributed memory and set operations to process social networks |
TW201250611A (en) | 2011-06-14 | 2012-12-16 | Pushme Co Ltd | Message delivery system with consumer attributes collecting mechanism and transaction history recording mechanism and communication system using same |
WO2012174565A2 (en) | 2011-06-16 | 2012-12-20 | Radiumone, Inc. | Building a social graph with sharing activity between users of the open web |
CN102855572B (en) | 2011-07-01 | 2016-03-09 | 北京亚投科技有限责任公司 | Mobile interactive mode is ordered positioning service system and method |
US8965848B2 (en) | 2011-08-24 | 2015-02-24 | International Business Machines Corporation | Entity resolution based on relationships to a common entity |
WO2013026095A1 (en) | 2011-08-25 | 2013-02-28 | Matsumoto Yashimasa | Social rating system |
US9171336B2 (en) | 2011-08-29 | 2015-10-27 | Bank Of America Corporation | Cumulative connectedness |
US10096033B2 (en) | 2011-09-15 | 2018-10-09 | Stephan HEATH | System and method for providing educational related social/geo/promo link promotional data sets for end user display of interactive ad links, promotions and sale of products, goods, and/or services integrated with 3D spatial geomapping, company and local information for selected worldwide locations and social networking |
US8601025B1 (en) | 2011-09-28 | 2013-12-03 | Emc Corporation | Techniques using a bidirectional graph for reporting to clients |
US11151617B2 (en) | 2012-03-09 | 2021-10-19 | Nara Logics, Inc. | Systems and methods for providing recommendations based on collaborative and/or content-based nodal interrelationships |
US8977611B2 (en) | 2011-10-18 | 2015-03-10 | Facebook, Inc. | Ranking objects by social relevance |
US20130110732A1 (en) | 2011-10-27 | 2013-05-02 | NetOrbis Social Media Private Limited | System and method for evaluating trustworthiness of users in a social network |
WO2013063474A1 (en) | 2011-10-28 | 2013-05-02 | Scargo, Inc. | Security policy deployment and enforcement system for the detection and control of polymorphic and targeted malware |
KR101986312B1 (en) | 2011-11-04 | 2019-06-05 | 주식회사 케이티 | Method for Creating Trust Relationship and Embedded UICC |
US8832790B1 (en) | 2011-12-19 | 2014-09-09 | Emc Corporation | Fraud detection in adaptive authentication systems |
WO2013097026A1 (en) | 2011-12-28 | 2013-07-04 | Chrapko Evan V | Systems and methods for visualizing social graphs |
US9390243B2 (en) | 2012-02-28 | 2016-07-12 | Disney Enterprises, Inc. | Dynamic trust score for evaluating ongoing online relationships |
US9971993B2 (en) | 2012-03-26 | 2018-05-15 | Microsoft Technology Licensing, Llc | Leveraging a social graph for use with electronic messaging |
US20130290226A1 (en) | 2012-04-05 | 2013-10-31 | Maynard Dokken | System and method for social graph and graph assets valuation and monetization |
US9961021B2 (en) | 2012-04-19 | 2018-05-01 | Cisco Technology, Inc. | Enabling applications in a multi-transport stack environment |
US20130291098A1 (en) | 2012-04-30 | 2013-10-31 | Seong Taek Chung | Determining trust between parties for conducting business transactions |
WO2013173799A1 (en) | 2012-05-17 | 2013-11-21 | Luvocracy Inc. | Reward structures |
CN103456233A (en) | 2012-05-28 | 2013-12-18 | 腾讯科技(深圳)有限公司 | Method and system for searching interest points based on electronic map |
CN103593764A (en) | 2012-08-14 | 2014-02-19 | 崔名宇 | A service and location record system based on android cell phones |
US20140081652A1 (en) | 2012-09-14 | 2014-03-20 | Risk Management Solutions Llc | Automated Healthcare Risk Management System Utilizing Real-time Predictive Models, Risk Adjusted Provider Cost Index, Edit Analytics, Strategy Management, Managed Learning Environment, Contact Management, Forensic GUI, Case Management And Reporting System For Preventing And Detecting Healthcare Fraud, Abuse, Waste And Errors |
US20140089189A1 (en) | 2012-09-27 | 2014-03-27 | S. Rao Vasireddy | System, method, and apparatus to evaluate transaction security risk |
US9208460B2 (en) | 2012-10-19 | 2015-12-08 | Lexisnexis, A Division Of Reed Elsevier Inc. | System and methods to facilitate analytics with a tagged corpus |
US9106681B2 (en) | 2012-12-17 | 2015-08-11 | Hewlett-Packard Development Company, L.P. | Reputation of network address |
CN103095728B (en) | 2013-02-07 | 2016-04-27 | 重庆大学 | A kind of network security points-scoring system of Behavior-based control data fusion and method |
US20140278730A1 (en) | 2013-03-14 | 2014-09-18 | Memorial Healthcare System | Vendor management system and method for vendor risk profile and risk relationship generation |
US11232447B2 (en) | 2013-03-15 | 2022-01-25 | Allowify Llc | System and method for enhanced transaction authorization |
US20140280071A1 (en) | 2013-03-15 | 2014-09-18 | Nevada Funding Group Inc. | Systems, methods and apparatus for providing access to online search results |
US10296625B2 (en) | 2013-03-16 | 2019-05-21 | Fadi Victor Micaelian | Computerized system and method for identifying relationships |
US20140279352A1 (en) | 2013-03-18 | 2014-09-18 | Stuart Schaefer | System and methods of providing a fungible consumer services marketplace |
US9613341B2 (en) | 2013-03-21 | 2017-04-04 | Infosys Limited | Calculating trust score on web based platform |
US9350805B2 (en) | 2013-04-09 | 2016-05-24 | Martin Hamilton | Allocation of crowdsourced resources |
US20140317003A1 (en) | 2013-04-18 | 2014-10-23 | Netspective Communications Llc | System and method for facilitating crowdsourced credentialing and accreditation |
US9319419B2 (en) | 2013-09-26 | 2016-04-19 | Wave Systems Corp. | Device identification scoring |
GB2519545A (en) * | 2013-10-24 | 2015-04-29 | Ibm | Determining a quality parameter for a verification environment |
US20150121456A1 (en) | 2013-10-25 | 2015-04-30 | International Business Machines Corporation | Exploiting trust level lifecycle events for master data to publish security events updating identity management |
US9154491B1 (en) | 2013-11-15 | 2015-10-06 | Google Inc. | Trust modeling |
US9143503B2 (en) | 2013-12-10 | 2015-09-22 | Dell Products, L.P. | Managing trust relationships |
US20150169142A1 (en) | 2013-12-16 | 2015-06-18 | Co Everywhere, Inc. | User interface for providing geographically delineated content |
US9367629B2 (en) | 2013-12-19 | 2016-06-14 | Facebook, Inc. | Grouping recommended search queries on online social networks |
CN104794656A (en) | 2014-01-16 | 2015-07-22 | 朱开一 | Recommendation method and recommendation system applied to social networks |
US10445699B2 (en) | 2014-01-30 | 2019-10-15 | Mentor Graphics Corporation | Social electronic design automation |
US20150242856A1 (en) | 2014-02-21 | 2015-08-27 | International Business Machines Corporation | System and Method for Identifying Procurement Fraud/Risk |
US9560076B2 (en) | 2014-03-19 | 2017-01-31 | Verizon Patent And Licensing Inc. | Secure trust-scored distributed multimedia collaboration session |
US9947060B2 (en) | 2014-06-03 | 2018-04-17 | Excalibur Ip, Llc | Information matching and match validation |
US20150359039A1 (en) | 2014-06-06 | 2015-12-10 | Umbrellium LTD. | System for facilitating searching in the internet of things |
US9846896B2 (en) | 2014-06-22 | 2017-12-19 | Netspective Communications Llc | Aggregation of rating indicators |
US9501791B2 (en) | 2014-07-18 | 2016-11-22 | Mark V. Dziuk | Online marketplace with seller financing |
US20160035046A1 (en) | 2014-07-31 | 2016-02-04 | Linkedln Corporation | Influencer score |
US9398467B2 (en) | 2014-09-05 | 2016-07-19 | Verizon Patent And Licensing Inc. | System and method for providing extension of network coverage |
US20160171113A1 (en) | 2014-12-11 | 2016-06-16 | Connectivity, Inc. | Systems and Methods for Controlling Crawling Operations to Aggregate Information Sets With Respect to Named Entities |
US9430498B2 (en) | 2014-12-13 | 2016-08-30 | Velvet Ropes, Inc. | Methods and systems for generating a digital celebrity map tour guide |
CN104504043A (en) | 2014-12-16 | 2015-04-08 | 新余兴邦信息产业有限公司 | Searching method and device for high-quality stores based on intelligent terminal |
US9578043B2 (en) | 2015-03-20 | 2017-02-21 | Ashif Mawji | Calculating a trust score |
US20170024749A1 (en) | 2015-07-23 | 2017-01-26 | Concert7 | System and method for determining targeted paths based on influence analytics |
US10268976B2 (en) | 2016-02-17 | 2019-04-23 | SecurityScorecard, Inc. | Non-intrusive techniques for discovering and using organizational relationships |
US9438619B1 (en) | 2016-02-29 | 2016-09-06 | Leo M. Chan | Crowdsourcing of trustworthiness indicators |
US9679254B1 (en) | 2016-02-29 | 2017-06-13 | Www.Trustscience.Com Inc. | Extrapolating trends in trust scores |
US9721296B1 (en) | 2016-03-24 | 2017-08-01 | Www.Trustscience.Com Inc. | Learning an entity's trust model and risk tolerance to calculate a risk score |
US10585893B2 (en) | 2016-03-30 | 2020-03-10 | International Business Machines Corporation | Data processing |
EP3507723A4 (en) | 2016-09-02 | 2020-04-01 | FutureVault Inc. | Systems and methods for sharing documents |
KR102019860B1 (en) | 2018-05-24 | 2019-09-09 | 주식회사 한컴위드 | Credit rating calculation apparatus based on user's network activity information and operating method thereof |
US10977626B2 (en) | 2018-06-14 | 2021-04-13 | Capital One Services, Llc | Semi-private blockchain virtual currency exchange systems |
-
2010
- 2010-10-21 US US12/909,703 patent/US20110099164A1/en not_active Abandoned
- 2010-10-22 US US13/503,352 patent/US9443004B2/en active Active - Reinstated
- 2010-10-22 WO PCT/CA2010/001658 patent/WO2011047474A1/en active Application Filing
-
2016
- 2016-07-29 US US15/224,063 patent/US20160337217A1/en not_active Abandoned
-
2018
- 2018-04-13 US US15/953,011 patent/US10187277B2/en active Active
- 2018-11-20 US US16/195,946 patent/US10348586B2/en active Active
-
2019
- 2019-05-13 US US16/410,272 patent/US10812354B2/en active Active
-
2020
- 2020-08-17 US US16/995,293 patent/US11665072B2/en active Active
-
2023
- 2023-05-02 US US18/310,590 patent/US20230275817A1/en active Pending
Patent Citations (52)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4774655A (en) * | 1984-10-24 | 1988-09-27 | Telebase Systems, Inc. | System for retrieving information from a plurality of remote databases having at least two different languages |
US4799254A (en) * | 1986-06-30 | 1989-01-17 | Wang Laboratories, Inc. | Portable communication terminal for remote database query |
US5321833A (en) * | 1990-08-29 | 1994-06-14 | Gte Laboratories Incorporated | Adaptive ranking system for information retrieval |
US5278980A (en) * | 1991-08-16 | 1994-01-11 | Xerox Corporation | Iterative technique for phrase query formation and an information retrieval system employing same |
US5428778A (en) * | 1992-02-13 | 1995-06-27 | Office Express Pty. Ltd. | Selective dissemination of information |
US5544049A (en) * | 1992-09-29 | 1996-08-06 | Xerox Corporation | Method for performing a search of a plurality of documents for similarity to a plurality of query words |
US5504887A (en) * | 1993-09-10 | 1996-04-02 | International Business Machines Corporation | Storage clustering and packing of objects on the basis of query workload ranking |
US5576954A (en) * | 1993-11-05 | 1996-11-19 | University Of Central Florida | Process for determination of text relevancy |
US5410693A (en) * | 1994-01-26 | 1995-04-25 | Wall Data Incorporated | Method and apparatus for accessing a database |
US5671404A (en) * | 1994-03-31 | 1997-09-23 | Martin Lizee | System for querying databases automatically |
US5577239A (en) * | 1994-08-10 | 1996-11-19 | Moore; Jeffrey | Chemical structure storage, searching and retrieval system |
US5694593A (en) * | 1994-10-05 | 1997-12-02 | Northeastern University | Distributed computer database system and method |
US5754938A (en) * | 1994-11-29 | 1998-05-19 | Herz; Frederick S. M. | Pseudonymous server for system for customized electronic identification of desirable objects |
US5642502A (en) * | 1994-12-06 | 1997-06-24 | University Of Central Florida | Method and system for searching for relevant documents from a text database collection, using statistical ranking, relevancy feedback and small pieces of text |
US5659732A (en) * | 1995-05-17 | 1997-08-19 | Infoseek Corporation | Document retrieval over networks wherein ranking and relevance scores are computed at the client for multiple database documents |
US5721902A (en) * | 1995-09-15 | 1998-02-24 | Infonautics Corporation | Restricted expansion of query terms using part of speech tagging |
US5742816A (en) * | 1995-09-15 | 1998-04-21 | Infonautics Corporation | Method and apparatus for identifying textual documents and multi-mediafiles corresponding to a search topic |
US5794237A (en) * | 1995-11-13 | 1998-08-11 | International Business Machines Corporation | System and method for improving problem source identification in computer systems employing relevance feedback and statistical source ranking |
US6018344A (en) * | 1995-11-30 | 2000-01-25 | Matsushita Electric Industrial Co., Ltd. | History display apparatus |
US5855020A (en) * | 1996-02-21 | 1998-12-29 | Infoseek Corporation | Web scan process |
US5913215A (en) * | 1996-04-09 | 1999-06-15 | Seymour I. Rubinstein | Browse by prompted keyword phrases with an improved method for obtaining an initial document set |
US5864845A (en) * | 1996-06-28 | 1999-01-26 | Siemens Corporate Research, Inc. | Facilitating world wide web searches utilizing a multiple search engine query clustering fusion strategy |
US5864846A (en) * | 1996-06-28 | 1999-01-26 | Siemens Corporate Research, Inc. | Method for facilitating world wide web searches utilizing a document distribution fusion strategy |
US5864863A (en) * | 1996-08-09 | 1999-01-26 | Digital Equipment Corporation | Method for parsing, indexing and searching world-wide-web pages |
US5956711A (en) * | 1997-01-16 | 1999-09-21 | Walter J. Sullivan, III | Database system with restricted keyword list and bi-directional keyword translation |
US5940821A (en) * | 1997-05-21 | 1999-08-17 | Oracle Corporation | Information presentation in a knowledge base search and retrieval system |
US6014665A (en) * | 1997-08-01 | 2000-01-11 | Culliss; Gary | Method for organizing information |
US6029165A (en) * | 1997-11-12 | 2000-02-22 | Arthur Andersen Llp | Search and retrieval information system and method |
US6243091B1 (en) * | 1997-11-21 | 2001-06-05 | International Business Machines Corporation | Global history view |
US5987457A (en) * | 1997-11-25 | 1999-11-16 | Acceleration Software International Corporation | Query refinement method for searching documents |
US6185558B1 (en) * | 1998-03-03 | 2001-02-06 | Amazon.Com, Inc. | Identifying the items most relevant to a current query based on items selected in connection with similar queries |
US6421675B1 (en) * | 1998-03-16 | 2002-07-16 | S. L. I. Systems, Inc. | Search engine |
US6115718A (en) * | 1998-04-01 | 2000-09-05 | Xerox Corporation | Method and apparatus for predicting document access in a collection of linked documents featuring link proprabilities and spreading activation |
US6032145A (en) * | 1998-04-10 | 2000-02-29 | Requisite Technology, Inc. | Method and system for database manipulation |
US6415282B1 (en) * | 1998-04-22 | 2002-07-02 | Nec Usa, Inc. | Method and apparatus for query refinement |
US6169986B1 (en) * | 1998-06-15 | 2001-01-02 | Amazon.Com, Inc. | System and method for refining search queries |
US6006225A (en) * | 1998-06-15 | 1999-12-21 | Amazon.Com | Refining search queries by the suggestion of correlated terms from prior searches |
US6144958A (en) * | 1998-07-15 | 2000-11-07 | Amazon.Com, Inc. | System and method for correcting spelling errors in search queries |
US6226630B1 (en) * | 1998-07-22 | 2001-05-01 | Compaq Computer Corporation | Method and apparatus for filtering incoming information using a search engine and stored queries defining user folders |
US6460060B1 (en) * | 1999-01-26 | 2002-10-01 | International Business Machines Corporation | Method and system for searching web browser history |
US6405190B1 (en) * | 1999-03-16 | 2002-06-11 | Oracle Corporation | Free format query processing in an information search and retrieval system |
US6484162B1 (en) * | 1999-06-29 | 2002-11-19 | International Business Machines Corporation | Labeling and describing search queries for reuse |
US20040172445A1 (en) * | 1999-07-01 | 2004-09-02 | Kaviraj Singh | Workflow as data-transition driven, scriptable state machines |
US20010034763A1 (en) * | 1999-12-08 | 2001-10-25 | Jacobs Paul E. | System for distributing advertisements to client devices |
US6564213B1 (en) * | 2000-04-18 | 2003-05-13 | Amazon.Com, Inc. | Search query autocompletion |
US6745178B1 (en) * | 2000-04-28 | 2004-06-01 | International Business Machines Corporation | Internet based method for facilitating networking among persons with similar interests and for facilitating collaborative searching for information |
US6647383B1 (en) * | 2000-09-01 | 2003-11-11 | Lucent Technologies Inc. | System and method for providing interactive dialogue and iterative search functions to find information |
US20050114325A1 (en) * | 2000-10-30 | 2005-05-26 | Microsoft Corporation | Semi-automatic annotation of multimedia objects |
US20080250026A1 (en) * | 2001-10-24 | 2008-10-09 | Linden Gregory D | Recommendations based on cross-site browsing activities of users |
US20050071325A1 (en) * | 2003-09-30 | 2005-03-31 | Jeremy Bem | Increasing a number of relevant advertisements using a relaxed match |
US20050283468A1 (en) * | 2004-06-22 | 2005-12-22 | Kamvar Sepandar D | Anticipated query generation and processing in a search engine |
US20060041843A1 (en) * | 2004-08-20 | 2006-02-23 | Fuji Xerox Co., Ltd. | Recommendation aggregation for digest generation |
Cited By (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10382819B2 (en) * | 2010-08-16 | 2019-08-13 | S.I.Sv.El. Societa Italiana Per Lo Sviluppo Dell'elettronica S.P.A. | Method and apparatus for selecting at least one media item |
US9959321B2 (en) * | 2010-09-24 | 2018-05-01 | Facebook, Inc. | Ranking search results by social relevancy |
US20180210885A1 (en) * | 2010-09-24 | 2018-07-26 | Facebook, Inc. | Ranking Search Results By Social Relevancy |
US20130066902A1 (en) * | 2011-09-08 | 2013-03-14 | Takayuki Iida | Information processing apparatus, information processing method, and computer-readable storage medium |
US10719896B2 (en) * | 2013-09-13 | 2020-07-21 | Keith FISHBERG | Amenity, special service and food/beverage search and purchase booking system |
US10545999B2 (en) | 2013-12-14 | 2020-01-28 | Microsoft Technology Licensing, Llc | Building features and indexing for knowledge-based matching |
US20150347390A1 (en) * | 2014-05-30 | 2015-12-03 | Vavni, Inc. | Compliance Standards Metadata Generation |
US10104417B2 (en) | 2016-07-26 | 2018-10-16 | At&T Mobility Ii Llc | Method and apparatus for sponsored messaging |
US10484731B2 (en) | 2016-07-26 | 2019-11-19 | At&T Mobility Ii Llc | Method and apparatus for sponsored messaging |
Also Published As
Publication number | Publication date |
---|---|
US20180316583A1 (en) | 2018-11-01 |
US20190089610A1 (en) | 2019-03-21 |
WO2011047474A1 (en) | 2011-04-28 |
US20230275817A1 (en) | 2023-08-31 |
US20200382391A1 (en) | 2020-12-03 |
US10348586B2 (en) | 2019-07-09 |
US11665072B2 (en) | 2023-05-30 |
US20120317200A1 (en) | 2012-12-13 |
US10187277B2 (en) | 2019-01-22 |
US9443004B2 (en) | 2016-09-13 |
US20190268248A1 (en) | 2019-08-29 |
US10812354B2 (en) | 2020-10-20 |
US20160337217A1 (en) | 2016-11-17 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20110099164A1 (en) | Apparatus and method for search and retrieval of documents and advertising targeting | |
US20180232453A1 (en) | Apparatus and method for retrieval of documents | |
US6078866A (en) | Internet site searching and listing service based on monetary ranking of site listings | |
US8346770B2 (en) | Systems and methods for clustering search results | |
KR101667344B1 (en) | Method and system for providing search results | |
US20010049674A1 (en) | Methods and systems for enabling efficient employment recruiting | |
US20110047275A1 (en) | Method and system for sharing and accessing resources | |
US20080288588A1 (en) | Method and system for searching using image based tagging | |
US20050125397A1 (en) | Transparent search engine | |
US20060064411A1 (en) | Search engine using user intent | |
US20120066233A1 (en) | System and methods for mapping user reviewed and rated websites to specific user activities | |
Won et al. | Contextual web history: using visual and contextual cues to improve web browser history | |
US20090265321A1 (en) | Internet book marking and search results delivery | |
US20050091204A1 (en) | Apparatus and method for retrieval of documents | |
US20110093456A1 (en) | Method and system for displaying information | |
JP4962980B2 (en) | Search result classification apparatus and method using click log | |
Hawking et al. | An enterprise search paradigm based on extended query auto-completion: do we still need search and navigation? | |
White et al. | Leveraging popular destinations to enhance web search interaction | |
JP2020086996A (en) | Publication information retrieval system | |
JP3933617B2 (en) | Shared information search method, shared information search program, and information sharing system | |
US20130275234A1 (en) | Method for a job seeker landing page | |
JP2006079365A (en) | Information retrieval system, information providing system, information retrieval method, program and recording medium | |
Griffiths et al. | An enterprise search paradigm based on extended query auto-completion: do we still need search and navigation? | |
WO2011018453A1 (en) | Method and apparatus for searching documents | |
JP2002082952A (en) | Method and apparatus for retrieving information |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |
|
AS | Assignment |
Owner name: INFOBIT LTD., ISRAEL Free format text: NUNC PRO TUNC ASSIGNMENT;ASSIGNOR:MELMAN, HAIM ZVI;REEL/FRAME:034246/0032 Effective date: 20141113 Owner name: SCAILEX CORPORATION LTD., ISRAEL Free format text: NUNC PRO TUNC ASSIGNMENT;ASSIGNOR:INFOBIT LTD.;REEL/FRAME:034246/0066 Effective date: 20141113 Owner name: MELMAN, HAIM, ISRAEL Free format text: AGREEMENT;ASSIGNOR:SCAILEX CORPORATION LTD.;REEL/FRAME:034241/0635 Effective date: 20080127 |
|
AS | Assignment |
Owner name: PALOMINO, SERIES 60 OF ALLIED SECURITY TRUST I, CA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MELMAN, HAIM ZVI;REEL/FRAME:039348/0923 Effective date: 20160714 |
|
AS | Assignment |
Owner name: UBER TECHNOLOGIES, INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:PALOMINO, SERIES 60 OF ALLIED SECURITY TRUST 1;REEL/FRAME:043455/0692 Effective date: 20170616 |