Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Concepts and effectiveness of the cover-coefficient-based clustering methodology for text databases
Can F. (ed), Ozkarahan E. ACM Transactions on Database Systems15 (3):483-517,1990.Type:Article
Date Reviewed: Dec 1 1992

I have two points in response to the authors. First, they were correct in their statement about disjoint databases. R. Needham misunderstood their paper and offers his apologies. My second point concerns clustering for recall or precision. In general, document clustering has been either intended or found to be most effective as a precision device. There is no solid evidence of its being a valuable recall device. Thus, while the authors suggest that clustering could serve recall, they do not demonstrate its utility for this, so my comments on retrieval performance stand.

Reviewer:  K. Sparck Jones Review #: CR115116
2) Can, F. Incremental clustering for dynamic information processing. ACM Trans. Inf. Syst., to appear.
Bookmark and Share
 
Clustering (H.3.3 ... )
 
 
Indexing Methods (H.3.1 ... )
 
 
Large Text Archives (H.3.6 ... )
 
 
General (I.7.0 )
 
Would you recommend this review?
yes
no
Other reviews under "Clustering": Date
A parallel algorithm for record clustering
Omiecinski E., Scheuermann P. ACM Transactions on Database Systems 15(3): 599-624, 1990. Type: Article
Nov 1 1992
Organization of clustered files for consecutive retrieval
Deogun J., Raghavan V., Tsou T. ACM Transactions on Database Systems 9(4): 646-671, 1984. Type: Article
Jun 1 1985
Clustering analysis for graphs with multiweighted edges: a unified approach to the threshold problem
Roy J. Journal of the American Society for Information Science 38(3): 156-161, 1987. Type: Article
Apr 1 1988
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy