Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Clustering analysis for graphs with multiweighted edges: a unified approach to the threshold problem
Roy J. Journal of the American Society for Information Science38 (3):156-161,1987.Type:Article
Date Reviewed: Apr 1 1988

The description of a set of objects can be done by various attribute sets. The selected attribute set implies relationships between object pairs. The resolution (comprehensiveness) of the relationships is affected by the selected attribute set. For a given resolution level (in terms of fuzzy application, resolution level is “level of fuzziness”) and a threshold value for the relationships, a partition can be defined for the objects. This problem is described and analyzed using graph theory notation. A reliability measure is suggested to judge various partitions. The results of the paper apply to fuzzy multivalent relations.

The presentation is nice. However, it assumes mathematical maturity on the part of the reader. The car-buyer example given in the introduction is a good motivation for the reader. However, it is hard to put the work into perspective since the author does not provide adequate references or a review of the previous work on the same subject.

Because of the purely theoretical approach, the paper will not be useful for people who are looking for a recipe for their clustering problem. It is valuable for researchers and graduate students. Another paper that is co-authored by Goetschel might also be helpful to the interested reader [1].

Reviewer:  F. Can Review #: CR111990
1) Goetschel, R., and Voxman, W.Optimal clustering in graphs with weighted edges: a unified approach to the threshold problem, J. Am. Soc. Inf. Sci. 38,1(Jan. 1987), 13–20.
Bookmark and Share
 
Clustering (H.3.3 ... )
 
 
Fuzzy Set (I.5.1 ... )
 
 
Graph Algorithms (G.2.2 ... )
 
 
Systems And Information Theory (H.1.1 )
 
Would you recommend this review?
yes
no
Other reviews under "Clustering": Date
Concepts and effectiveness of the cover-coefficient-based clustering methodology for text databases
Can F. (ed), Ozkarahan E. ACM Transactions on Database Systems 15(3): 483-517, 1990. Type: Article
Dec 1 1992
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
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