Electrical computers and digital processing systems: multicomput – Computer conferencing – Demand based messaging
Reexamination Certificate
2006-02-28
2006-02-28
Meky, Moustafa M. (Department: 2157)
Electrical computers and digital processing systems: multicomput
Computer conferencing
Demand based messaging
C715S252000
Reexamination Certificate
active
07007069
ABSTRACT:
A method for partitioning a tree-structured discussion or other tree structured collections of texts into clusters dealing with identifiable subtopics, if such subtopics exist, or into manageable partitions if not. Each document is represented by a vector and is initially placed in a cluster containing only that document. Then a sequence of cluster combinations is performed, at each step combining the most similar two clusters, where the most similar two clusters are the clusters related by the most similar pair of document vectors, into a new cluster. The process can be halted before all clusters are combined based on application-specific criteria.
REFERENCES:
patent: 6421668 (2002-07-01), Yakhini et al.
patent: 6446061 (2002-09-01), Doerre et al.
patent: 6510436 (2003-01-01), Hart
patent: 6564197 (2003-05-01), Sahami et al.
patent: 6816175 (2004-11-01), Opalka et al.
patent: 6871201 (2005-03-01), Yu et al.
K. Tajima et al. “Cut as a Querying Unit for WWW, Netnews, and E-mail”, Proc. 9th Annual International ACM COnf. on Hypertext, pp. 235-244, 1998.
T. Hofmann. “Probabilistic latent semantic indexing”, In 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Berkeley, CA, USA, 1999.
T. Brants et al. “Topic-Based Document Segmentation with Probabilistic Latent Semantic Analysis”, Proc. 11th International Conference on Information and Knowledge Management, McLean, VA, USA, Nov. 2002.
H. Ozaku et al., “Topic Search for Intelligent Network News Reader HISHO” Proc. Of the 2000 ACM Symposium on Applied Computing, Como, Italy, 2000, pp. 28-33.
M. White et al., “Selecting Sentences for Multidocument Summaries Using Randomized Local Search”, Proc. of the ACL 2002 Summarization Workshop, Philadelphia, PA, USA, 2002.
M. Sifer et al., “Zooming in one Dimension can be better than two: an Interface for Placing Search Results in Context with a Restricted Sitemap”, in Proceedings of the IEEE Symposium on Visual Languages (VL '99), Tokyo, Japan, Sep. 1999.
B. Boguraev et al., “Discourse segmentation in aid of document summarization”. In Proceedings of Hawaii International Conference on System Sciences (HICSS-33) , Minitrack on Digital Documents Understanding, Maui, Hawaii, 2000.
D. Radev et al., Centroid-based summarization of multiple documents: sentence extraction, utility-based evaluation and user studies. In ANLP/NAACL 2000 Workshop, pp. 21-29, Apr. 2000.
B.W. Kernighan et al., “An Efficient Heuristic Procedure for Partitioning Graphs”, Bell System Technical Journal, vol. 49, No. 2, pp. 291-307, 1970.
M. Sifer et al., “Structured Graphs: A Visual Formalism for Scalable Graph Based Case Tools”, Australian Computer Journal, vol 28, No. 1 Feb. 1996, pp. 13-26.
Chen Francine R.
Newman Paula S.
McBain Nola Mae
Meky Moustafa M.
Palo Alto Research Center Inc.
LandOfFree
Method and apparatus for clustering hierarchically related... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for clustering hierarchically related..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for clustering hierarchically related... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3677276