International Business Machines Corporation

Eitan Shapiro

Leonid Bolshinsky

Inbal Ronen

Arnon Yogev

Joshua Fox

Michael Pelts

Batya Kenig

Constantin Radchenko

Andrew Lewis Schirmer

Vladimir Gamaley

Gili Nachum

Shai Erera

Sharon Krisher

Laurent David Hasson

A document-oriented search can be executed to generate a set of document results, at least one of the documents associated with at least one potential expert. The document results can be analyzed to produce a list of potential experts. An expertise score for at least one of the potential experts can be calculated based on a content score and a metadata score for the at least one of the potential experts. A confidence score for the potential expert can be calculated based on a diversity-constrained content score and a diversity-constrained metadata score for the at least one of the potential experts, the diversity-constrained content score and the diversity-constrained metadata score calculated using an evidence diversity score for the at least one of the potential experts. A list of experts with associated confidence scores that are above a confidence score threshold can be sent to a client device.

Calculating expertise confidence based on content and social proximity

Techniques for topic recommendation are described herein. The techniques include a method that topic recommendation includes identifying topics associated with events within a social network environment. A rank may be determined indicating interest for an identified topic within the social network environment. The method may include recommending a topic to a user for posting in the social network environment based on the rank.

Topic recommendation in a social network environment

Embodiments of the present invention provide systems and methods for applying social collaboration programs. Within a social network setting, a user can be connected to other users within the social network setting. Counters are collected on events associated with the other users within the social network setting and a visual representation is outputted to the user. The visual representation includes keywords; a count bar (with sub-sections) indicative of a number of occurring events associated with the other users within the social network setting; a total number of events among the other users within the social network setting; and the image of the other users associated with the count bar. Events are analyzed by utilizing mapping logic, inverted structures, indexed structures, and aggregating collected counters.

Compact visualization into aggregated events in social collaboration programs

A search engine system with privacy protection, including a data indexer configured to create an index of data, a search engine configured to search the index of the data in response to a query, and create a search result set including excerpts from the data, and a privacy protector configured to identify at least one data entity within at least one excerpt of the search result set that meets at least one predefined entity extraction criterion, redact the search result set by removing the data entity from the excerpt, and present the redacted search result set on a computer output device.

Search engine with privacy protection

An example system includes a processor to receive personal data including passwords and personal information associated with a user. The processor is to also compute patterns for the passwords based on the personal data. The processor is to further receive a plurality of characters for a proposed password. The processor is to also detect that the proposed password is unsecure based on the personal data and the computed patterns. The processor is to generate a secure password in real-time based on the personal data and the proposed password.

Generation of secure passwords in real-time using personal data

A method includes executing, via a processor, a document-oriented search based on a query in an index of documents to generate a set of document results, each document associated with at least one potential expert. The method includes analyzing the document results to produce a list of potential experts. The method includes calculating an expertise score for each potential expert based on a calculated content score and metadata score for each potential expert. The method includes calculating an evidence diversity score for each potential expert. The method includes calculating a confidence score for each potential expert based on a diversity-constrained content score and a diversity-constrained metadata score for each potential expert. The method includes displaying a list of potential experts with associated confidence scores.

In an approach to automating multilingual indexing, a computer receives text of a conversation between at least two users. The computer detects at least one language associated with the text. The computer determines whether the language associated with the text is detected with a confidence level that exceeds a threshold. The computer retrieves text from one or more previous conversations between the two users. The computer detects at least one language associated with the text. The computer determines whether the at least one language associated with the text is detected with a confidence level that exceeds a pre-defined threshold. The computer analyzes the text using at least one of the detected languages to create one or more terms. The computer indexes the one or more terms and stores a boost value associated with each of the one or more indexed terms corresponding to confidence level of the detected language.

Automating multilingual indexing

A method for incremental crawling of content stored on a plurality of content providers using aggregation is provided. The method comprises receiving a request to crawl content on one or more associated content providers; retrieving one or more first references to content on a first content provider; retrieving one or more second references to content on one or more second content providers during the same request; aggregating the first and second references; and returning the aggregated first and second references. This is done while taking into consideration opaque timestamp object which is managed in a distributed manner. The opaque timestamp is filled in by the content providers but stored in the crawler side between crawling sessions.

Incremental crawling of multiple content providers using aggregation

Techniques are provided for data-discriminate search engine updates, where, in accordance with a first crawling session frequency associated with a first update type, a search engine index is updated by recording an update to a first set of data, where the update to the first set of data is of the first update type, and, in accordance with a second crawling session frequency associated with a second update type, the search engine index is updated by recording an update to a second set of data, where the update to the second set of data is of the second update type, where the first crawling session frequency is of a different frequency than the second crawling session frequency.

Growing community of inventors

Haifa, Israel

Eitan Shapiro