Abstract: In an example embodiment, one or more sample ideal candidate member profiles in a social networking service are obtained, as well as one or more sample search result member profiles in the social networking service. Then, for each unique pair of sample ideal candidate member profile and sample search result member profile, a label is generated using a score generated from log information of the social networking service, the log information including records of communications between a searcher and members of the social networking service, the score being higher if the searcher communicated with both the member corresponding sample ideal candidate member profile and the member corresponding to the sample search result member profile in a same search session. The generated labels are fed into a machine learning algorithm to train a combined ranking model used to output ranking scores for search result member profiles.

Abstract: According to an aspect, automatically adding new concepts to a concept graph includes receiving a string of text, searching a corpus of data to locate additional text related to the string of text, and extracting concepts from the additional text. The extracted concepts include a subset of concepts in the concept graph. The adding new concepts also includes determining whether the string of text should be linked to an existing concept in the concept graph, performing the linking based on determining that the string of text should be linked to the existing concept in the concept graph and, based on determining that the string of text should not be linked to an existing concept in the concept graph, adding a new concept to the concept graph. The new concept is associated with the string of text.

Abstract: The subject innovation provides for systems and methods to facilitate weighted suffix tree clustering. Conventional suffix tree cluster models can be augmented by incorporating quality measures to facilitate improved performance. Further the quality measure can be employed in determining cluster labels that show improvements in accuracy over conventional means. Additionally “stopnodes” can be defined to facilitate traversing suffix tree models efficiently. Quality measurements can be determined based in part on weighting factors applied to terms in a vector model, said terms being mapped from a suffix tree model.

Abstract: A searching system and a searching method are provided and perform packaged searching for information regarding a plurality of objects displayed on a map. As a result, searching may be performed on searching target objects selected by a user, and keywords may be mapped to the selected search target objects to enable packaged searching.

Abstract: According to an embodiment of the present invention, methods, systems, and computer readable media are provided for collecting statistics for use in optimizing a database query. Collected statistics for the database are compared to corresponding predetermined states of conditions for optimizing the database query. One or more collected statistics in compliance with the corresponding predetermined states of conditions are identified based on the comparison. Collection of the one or more identified statistics for the query optimization is disabled.

Abstract: A method for execution by a dispersed storage and task (DST) processing unit that includes a processor includes receiving a storage request from a user device via a network, where the storage request indicates a data object for storage in a distributed storage network (DSN) and a licensing identifier associated with the data object. Encoded data slices are generated by utilizing a dispersed storage error encoding scheme. Storage requirement data is generated based on the licensing identifier, indicating unique instance numbers corresponding to each of the encoded data slices. A plurality of write requests are generated, each corresponding to one of the encoded data slices and each for transmission to one of the storage units via the network. Each write request indicates a number of unique writes of a corresponding encoded data slice to a storage unit based on the corresponding unique instance number indicated by the storage requirement data.

Abstract: One or more techniques and/or computing devices are provided for data object retention. For example, a data retention policy may specify that files of a volume are to be locked down for a lockdown retention period (e.g., locked into a read only state for 4 months) when such files are not changed within an auto commit time period (e.g., files not changed within 13 hours). Waiting for a data scanner to evaluate files for lockdown may result in files violating the data retention policy until the data scanner evaluates such files. Accordingly, a file may be considered to be in the locked down state (e.g., instantaneous lockdown), such that commands to modify or delete the file are blocked, based upon a difference between a current time of an internal compliance clock and a current value of a data object change field exceeding the auto commit time period.

Abstract: According to an aspect, searching, recommending, and exploring documents through conceptual associations includes a method for receiving a plurality of documents and extracting concepts from each of the documents. A degree of relation between each of the documents and concepts in a knowledge base is calculated. The method also includes, in response to receiving a query, determining one or more concepts from the query. For each of the concepts, a list of documents having a highest degree of relation to the concept is retrieved. The method also includes outputting a list that is responsive to the one or more retrieved lists.

Abstract: According to an aspect, searching, recommending, and exploring documents through conceptual associations includes receiving a plurality of documents and extracting concepts from each of the documents. A degree of relation between each of the documents and concepts in a knowledge base is calculated. An aspect also includes, in response to receiving a query, determining one or more concepts from the query. For each of the concepts, a list of documents having a highest degree of relation to the concept is retrieved. An aspect also includes outputting a list that is responsive to the one or more retrieved lists.

Abstract: Techniques for counting event changes with archived relations are provided. In some examples, a query that identifies at least a data object may be identified. Additionally, the query may be evaluated against historical data associated with the data object. Additionally, in some instances, a listening service may be registered with the data object. Further, the query may be evaluated based at least in part on the data object and the historical data.

Abstract: The invention relates to a method of obtaining and storing data relating to a count of journeys made between origin and destination pairs in respect of different predetermined time periods. Positional data is received from vehicles, and filtered to obtain positional data relating to travel between each of a plurality of origin-destination pairs. The filtered positional data is analysed to obtain multiple sets of profiles. Each set of profiles represents a count of journeys made between the origin and destination in a plurality of predetermined time periods for each origin-destination pair. The different sets of profiles relate to different days of the week, and journeys having arrival or departure times in the predetermined time periods. The sets of profiles are used in a clustering operation to provide a reduced set of standard profiles.

Abstract: In one embodiment, a network file management system 120 may use a persistent metadata store 410 and an access control list 420 to facilitate a batch rollout. The network file management system 120 may maintain a content database 312. A network file management system 120 may store a metadata set for the content database 312 in a separate persistent metadata store 410.

Abstract: According to an embodiment of the present invention, methods, systems, and computer readable media are provided for collecting statistics for use in optimizing a database query. Collected statistics for the database are compared to corresponding predetermined states of conditions for optimizing the database query. One or more collected statistics in compliance with the corresponding predetermined states of conditions are identified based on the comparison. Collection of the one or more identified statistics for the query optimization is disabled.

Abstract: A computer implemented method and apparatus for classifying and comparing similar documents using base templates. The method comprises accessing a document; extracting metadata from the document; matching the metadata to at least one base template of a plurality of base templates; and storing the document with one or more similar documents, wherein the one or more similar documents are documents that match the at least one base template.

Abstract: According to an aspect, automatically adding new concepts to a concept graph includes receiving a string of text, searching a corpus of data to locate additional text related to the string of text, and extracting concepts from the additional text. The extracted concepts include a subset of concepts in the concept graph. The adding new concepts also includes determining whether the string of text should be linked to an existing concept in the concept graph, performing the linking based on determining that the string of text should be linked to the existing concept in the concept graph and, based on determining that the string of text should not be linked to an existing concept in the concept graph, adding a new concept to the concept graph. The new concept is associated with the string of text.

Abstract: According to an aspect, automatically adding new concepts to a concept graph includes receiving a string of text, searching a corpus of data to locate additional text related to the string of text, and extracting concepts from the additional text. The extracted concepts include a subset of concepts in the concept graph. The adding new concepts also includes determining whether the string of text should be linked to an existing concept in the concept graph, performing the linking based on determining that the string of text should be linked to the existing concept in the concept graph and, based on determining that the string of text should not be linked to an existing concept in the concept graph, adding a new concept to the concept graph. The new concept is associated with the string of text.

Abstract: Approaches for preserving customizations made to a data management system. Metadata that identifies a mapping between data fields of one or more data source schemas to columns of one or more data tier schemas is maintained. Each of the one or more data tier schemas stores data retrieved from the one or more data source schemas. Values from the metadata are read to dynamically generate software processes. The software processes may update one or more existing ETL processes to reflect an updated state of the one or more data tier schemas and may generate any new ETL processes required to retrieve data stored in the one or more data source schemas and load the retrieved data into the one or more data tier schemas. Customizations made to portions the data management system are preserved in an automated fashion when new versions of system components are deployed.

Abstract: An optimized fact checking system analyzes and determines the factual accuracy of information and/or characterizes the information by comparing the information with source information. The optimized fact checking system automatically monitors information, processes the information, fact checks the information in an optimized manner and/or provides a status of the information. In some embodiments, the optimized fact checking system generates, aggregates, and/or summarizes content.

Abstract: A system is configured to obtain data for a user. The data may describe actions that the user has performed in an application and identify points in time associated with the actions. A point in time may include a point in time at which one of the actions was performed. The system is configured to analyze the data to determine, for each action, a score for each point in time. The score, for a particular point in time, may be determined based on one or more points in time at which the action was performed, and may be determined from a number of times that the action was performed at the particular point in time. The system is configured to provide the user with a functionality to perform a particular action based on the scores determined for the particular action for the set of points in time.

Abstract: The present invention discloses a method and system for recommending cloud websites based on terminal access statistics, wherein, the method mainly comprises: storing websites accessed by a terminal, and sorting the websites according to the accessed frequency by the terminal; capturing corresponding website descriptive information according to a website sorting result; storing the websites and corresponding descriptive information to a cloud storage medium; and when receiving a query request, querying the stored websites and corresponding website descriptive information according to the query keywords in the query request, returning a query result, and returning one or more websites whose frequency ranks on the top in the query result as recommended items. The present invention calculates the popularity of websites and sorts the websites based on the statistics about access behaviors, thereby significantly improving the quality and relevance of the recommended result.