International Business Machines Corporation

Google Inc.

Kevin Snow McCurley

Andrew Stephen Tomkins

Daniel Gruhl

Sridhar Rajagopalan

Dandapani Sivakumar

Matthew Denesuk

John Anthony Tomlin

Jeffrey Bruce Lotspiech

Kedar Dhamdhere

Alexander Fabrikant

Daniel Adam Gundrum

Nadav Eiron

Nitish John Korula

Gagan Aggarwal

Shrikant Ravindra Shanbhag

Lujun Fang

Rohit Ananthakrishna

Juyun June Song

Mukund Sundararajan

Rifat Ralfi Nahmias

Nikunj Agrawal

Kristen Lefevre

Yaron Singer

Neelakantan Sundaresan

Nimrod Megiddo

Ullas Gargi

Vikas Krishna

Jeffrey Thomas Kreulen

Hovey Raymond Strong

Martin Henk Van Den Berg

Byron Edward Dom

Sanketh Shetty

Clifford V Harris

David Andrew Gibson

Jason Yeong Zien

Ronald Fagin

Soumen Chakrabarti

Jasmine Novak

Joerg Meyer

Charles DuHadway

Nisarg Dilipkumar Kothari

David Paul Williamson

Sami Nicole Rollins

Shanmugasundram Ravikumar

Null Garima

Garima

Tomás Izo

Systems and methods are disclosed herein for processing a natural language query on data tables. According to some embodiments, a natural language query may be originated by a user via a user interface. The natural language query may be parsed to obtain a query term, and a grid range may be identified in a data table as relevant to the query term. A table summary may be prepared including a plurality of characteristics based on the grid range. A logic operation may then be determined to apply on the plurality of characteristics to derive the query term. The logic operation may then be translated into a formula executable on the data table, and the formula is applied on the data table to generate a result in response to the natural language query.

Systems and methods for processing a natural language query in data tables

Systems and methods are disclosed herein for processing a natural language query on data tables. According to some embodiments, a natural language query may be originated by a user via a user interface. The natural language query may be parsed to obtain a query term, and a grid range may be identified in a data table as relevant to the query term. A table summary may be prepared including a plurality of data entities based on the grid range. A logic operation may then be determined to apply on the plurality of data entities to derive the query term. The logic operation may then be translated into a formula executable on the data table, and the formula is applied on the data table to generate a result in response to the natural language query.

Implementations disclose crowdsourcing descriptor selection. A method includes receiving, by a processor, a reference to an internet resource from a device, wherein the reference to the internet resource is a uniform resource locator (URL) provided in a post interface, wherein the post interface presents posts to a social network, determining, by the processor, a plurality of descriptors indicative of content within the internet resource, sending, by the processor, the plurality of descriptors to the device for presentation in the post interface according to a priority order, receiving, via the post interface a selection of one of the plurality of descriptors, and generating, by the processor, a post to the social network, the generated post comprising the selected one of the plurality of descriptors.

Crowdsourcing descriptor selection

In one aspect, a method is provided, including the following method operations: receiving a request to share a content page in a post to a social network site; analyzing the content page to identify a plurality of descriptive content; presenting a draft post, the draft post providing options for associating particular ones of the descriptive content for integration with the post; receiving a selection of at least one of the particular ones of the descriptive content; generating the post to the social network site based on the selection; wherein the method is executed by at least one processor.

A method of setting privacy level values for a user. The method includes receiving a designation of a relative privacy level for the user and receiving a selection of a group of other users for the user. Plural sets of privacy level values are associated with the group of other users. The method also includes setting privacy level values for the user based on the designation of the relative privacy level and the plural sets of privacy level values associated with the selected group of other users.

Privacy selection based on social groups

A method for assessing sharing of items within a social network is provided. The method includes identifying a first sharing of a social item by a first user of a social network, determining one or more second sharings of the social item by one or more second users, the one or more second sharings being based on the first sharing. The method also includes determining a sharing score associated with the first user based on a number of the one or more second sharings, and updating a data structure based on the determined sharing score associated with the first user. The data structure stores respective sharing scores associated with the plurality of users of the social network. Systems and machine-readable media are also provided.

Assessing sharing of items within a social network

In a data mining system, data is gathered into a data store using, e.g., a Web crawler. The data is classified into entities. Data miners use rules to process the entities and append respective keys to the entities representing characteristics of the entities as derived from rules embodied in the miners. With these keys, characteristics of entities as defined by disparate expert authors of the data miners are identified for use in responding to complex data requests from customers.

Knowledge-based data mining system

A logical directory ranking system ranks documents or web pages utilizing logical directories. The present system groups together compound documents as a single information node with one or more leaves, constructing a logical directory graph. URLs can be grouped at a level of granularity below an individual directory. For example, the URLs may be grouped together on the basis of hostname, domain, or any level of the hierarchy of the URLs. Edges in the logical directory graph are formed by links between the logical directories. Edges have weights corresponding to the number of links between logical directories. Nodes have weights corresponding to the number of web pages or leaves represented by a node. A ranking level is determined for each node as a function of the node weight and the edge weight. The ranking level is then applied to each URL that the node represents.

System and method and computer program product for ranking logical directories

A Web server stores a table of Web page inlinks. When a Web page is accessed and a user wants to access other pages related to the accessed page, the user requests the table of inlinks, and from it generates a list of sibling links to the accessed page, the sibling links being outlinks of one or more of the inlinks in the table.

Method and system for distributed autonomous maintenance of bidirectional hyperlink metadata on the web and similar hypermedia repository

A modular scoring system using rank aggregation merges search results into an ordered list of results using many different features of documents. The ranking functions of the present system can easily be customized to the needs of a particular corpus or collection of users such as an intranet. Rank aggregation is independent of the underlying score distributions between the different factors, and can be applied to merge any set of ranking functions. Rank aggregation holds the advantage of combining the influence of many different heuristic factors in a robust way to produce high-quality results for queries. The modular scoring system combines factors such as indegree, page ranking, URL length, proximity to the root server of an intranet, etc, to form a single ordering on web pages that closely obeys the individual orderings, but also mediates between the collective wisdom of individual heuristics.

System, method and service for ranking search results using a modular scoring system

A dangling web page processing system ranks dangling web pages on the web. The system ranks dangling web pages of high quality that cannot be crawled by a crawler. In addition, the system adjusts ranks to penalize dangling web pages that return errors when links on the dangling web pages are crawled. By providing a rank for dangling web pages, the present system allows the concentration of crawling resources on those dangling web pages that have the highest rank in the uncrawled region. The system operates locally to the dangling web pages, providing efficient determination of ranks for the dangling web pages. The system explicitly discriminates against web pages on the basis of whether they point to penalty pages, i.e., pages that return an error when a link is followed. By incorporating more fine-grained information such as this into ranking, the system can improve the quality of individual search results and better manage resources for crawling.

System and method for ranking nodes in a network

According to a preferred embodiment of the present invention, a bridging system () and method provides a way of linking two independent data systems by receiving a dataset from a source data system. The bridging system () translates the dataset from a source schema to a target schema according to a set of mapping rules, and queues the translated data in persistent storage, and then sends the translated dataset to a destination data system. The system () includes an XML bridge (), multiple application specific gateways (), and a web admin interface (), all in communication via a wide area network.

Method for allowing simple interoperation between backend database systems

In a data mining system, data is gathered into a data store using, e.g., a Web crawler. The data is classified into entities. Data miners use rules to process the entities and append respective keys to the entities representing characteristics of the entities as derived from expert rules embodied in the miners. With these keys, characteristics of entities as defined by disparate expert authors of the data miners are identified for use in responding to complex data requests from customers.

In a data mining system, data is gathered into a data store using, e.g., a Web crawler. The data is classified into entities and stored into underlying vertical and horizontal tables respectively representing miner outputs and entities that can be the subjects of indexing. Data miners use rules to process the entities and append respective keys to the entities representing characteristics of the entities as derived from rules embodied in the miners, with the keys being associated with the entities in the tables. With these keys, characteristics of entities as defined by disparate expert authors of the data miners are identified for use in responding to complex data requests from customers.

Data store for knowledge-based data mining system

Growing community of inventors

San Jose, CA, United States of America

Kevin Snow McCurley