Showing papers by "Li Zhang published in 2008"
Patent•
31 Oct 2008TL;DR: In this article, the authors describe various embodiments which enable organizations to track and use knowledge and expertise of their associated individuals from documents available from internal or external web sites, such as web crawler crawls a computer network to identify documents that name an individual and a profile is built of the individual using the summaries.
Abstract: Described are various embodiments which enable organizations to track and use knowledge and expertise of their associated individuals An organization can use exemplary embodiments to automatically summarize the expertise of each individual from documents available from internal or external web sites For example, a web crawler crawls a computer network to identify documents that name an individual Summaries of the documents are generated based on articles in an encyclopedia, and a profile is built of the individual using the summaries These summaries are used for automatically searching and automatically discovering individuals having particular knowledge or expertise on certain topics and subjects
10 citations
Patent•
31 Oct 2008TL;DR: In this paper, the weights of the first plurality of nodes were assigned to each of the nodes in the data tree structure, and a first generation of combinations of possible weights assignable as the weights were obtained by performing the genetic algorithms in the first generation.
Abstract: A device for classifying a document comprises a module to generate a data tree structure and configured to assign terms to a first plurality of nodes of the data tree structure, where each of the first plurality of nodes is assigned a weight. In assigning the weights of the first plurality of nodes, a first generation of combinations of possible weights assignable as the weights of the first plurality of nodes is obtained, and a second generation of combinations of possible weights assignable as the weights of the first plurality of nodes is obtained by performing the genetic algorithms in the first generation of combinations of possible weights. The device determines whether the document is in a document class based at least the weights of the first plurality of nodes.
10 citations
01 Jan 2008
TL;DR: This lecture introduces the notion of well-separated pair decomposition (WSPD) that clusters the set of all pairwise distances in a given point set and discusses a few applications of WSPD.
Abstract: In the previous lecture, we covered an approximation algorithm that answers a (1+ e)-approximate nearest neighbor query in logarithmic time, using only linear space. This algorithm makes use of the compressed quadtree data structure, which clusters the set of distances between query point and the points in the given set, {‖q− pi‖ |1 ≤ i ≤ n}, into O(log n + 1 ed ) clusters. In this lecture, we introduce the notion of well-separated pair decomposition (WSPD) that clusters the set of all pairwise distances in a given point set and discuss a few applications of WSPD.