Abstract: There are disclosed systems, method and tools for facilitating group collaborations. In an embodiment, collaborative ideas are represented in a modified tree data structure in which ideas are stored in nodes of the tree (an “idea tree”). Each node may be associated with data storage means, such as a table of records, in which different kinds of data can be stored. Data stored in the idea tree, or a part thereof, may be created, modified, deleted or organized by using various types of collaboration tools. A participant's interaction with the idea tree, or a part thereof, using a particular collaboration tool may be mapped as a transformation of the idea tree from one state to another. Other participants may simultaneously or successively interact with the idea tree, or a part thereof, using the same or a different collaboration tool. A coherent representation of collaborative ideas can be developed and organized without excessive manual effort.

Abstract: There are disclosed systems, method and tools for facilitating group collaborations. In an embodiment, collaborative ideas are represented in a modified tree data structure in which ideas are stored in nodes of the tree (an “idea tree”). Each node may be associated with data storage means, such as a table of records, in which different kinds of data can be stored. Data stored in the idea tree, or a part thereof, may be created, modified, deleted or organized by using various types of collaboration tools. A participant's interaction with the idea tree, or a part thereof, using a particular collaboration tool may be mapped as a transformation of the idea tree from one state to another. Other participants may simultaneously or successively interact with the idea tree, or a part thereof, using the same or a different collaboration tool. A coherent representation of collaborative ideas can be developed and organized without excessive manual effort.

Abstract: A computing system receives input data having both graph and unstructured data and computes a current log likelihood of the input data. The computing system compares the current log likelihood with a previous log likelihood of the input data. If the current log likelihood is larger than the previous log likelihood, the computing system update topic modeling parameters, community modeling parameters, and the link generation parameter until the computing system obtains a maximal value of the log likelihood of the input data. Then, the computing system creates a graph indicating topic similarity between the input data based on the topic modeling parameters, creates another graph indicating community similarity between entities associated with the input data based on the community modeling parameters, and predicts a link existence between input data or entities based on the link generation parameter, the topic modeling parameter and the community modeling parameter.

Abstract: A computing system receives input data having both graph and unstructured data and computes a current log likelihood of the input data. The computing system compares the current log likelihood with a previous log likelihood of the input data. If the current log likelihood is larger than the previous log likelihood, the computing system update topic modeling parameters, community modeling parameters, and the link generation parameter until the computing system obtains a maximal value of the log likelihood of the input data. Then, the computing system creates a graph indicating topic similarity between the input data based on the topic modeling parameters, creates another graph indicating community similarity between entities associated with the input data based on the community modeling parameters, and predicts a link existence between input data or entities based on the link generation parameter, the topic modeling parameter and the community modeling parameter.

Abstract: A method for automatically determining an Internet home page corresponding to a named entity identified by a specified descriptor including building a trained machine-learning model, generating candidate matches from the specified descriptor, wherein each candidate match includes an Internet address, extracting content-based features from websites associated with the Internet addresses of the candidate matches, determining a model score for each candidate match based on the content-based features using the trained machine-learning model, and determining a match from among the candidate matches according to the scores, wherein the match is returned as the Internet home page corresponding to the named entity.

Abstract: A computing system receives input data having both graph and unstructured data and computes a current log likelihood of the input data. The computing system compares the current log likelihood with a previous log likelihood of the input data. If the current log likelihood is larger than the previous log likelihood, the computing system update topic modeling parameters, community modeling parameters, and the link generation parameter until the computing system obtains a maximal value of the log likelihood of the input data. Then, the computing system creates a graph indicating topic similarity between the input data based on the topic modeling parameters, creates another graph indicating community similarity between entities associated with the input data based on the community modeling parameters, and predicts a link existence between input data or entities based on the link generation parameter, the topic modeling parameter and the community modeling parameter.

Abstract: A computing system receives input data having both graph and unstructured data and computes a current log likelihood of the input data. The computing system compares the current log likelihood with a previous log likelihood of the input data. If the current log likelihood is larger than the previous log likelihood, the computing system update topic modeling parameters, community modeling parameters, and the link generation parameter until the computing system obtains a maximal value of the log likelihood of the input data. Then, the computing system creates a graph indicating topic similarity between the input data based on the topic modeling parameters, creates another graph indicating community similarity between entities associated with the input data based on the community modeling parameters, and predicts a link existence between input data or entities based on the link generation parameter, the topic modeling parameter and the community modeling parameter.

Abstract: A method for automatically determining an Internet home page corresponding to a named entity identified by a specified descriptor including building a trained machine-learning model, generating candidate matches from the specified descriptor, wherein each candidate match includes an Internet address, extracting content-based features from websites associated with the Internet addresses of the candidate matches, determining a model score for each candidate match based on the content-based features using the trained machine-learning model, and determining a match from among the candidate matches according to the scores, wherein the match is returned as the Internet home page corresponding to the named entity.