DocumentCode :
1118960
Title :
A Discussion on Two Algorithms for Determining Maximum Compatibles
Author :
Handoko, F.
Author_Institution :
IBM SDD Laboratory
Issue :
8
fYear :
1975
Firstpage :
838
Lastpage :
840
Abstract :
The algorithm for determining the set of maximum compatibles of Sinha Roy and Sheng is compared with the more recent algorithm of Stoffers. A refinement of the former algorithm is given and a minor mistake in the latter is pointed out.
Keywords :
Compatibility, decomposition, lexicographic order, maximum compatibles (MC´s).; Clustering algorithms; Cybernetics; Data analysis; Fuzzy sets; Mathematical model; Mathematics; Matrix decomposition; Partitioning algorithms; Pattern classification; Taxonomy; Compatibility, decomposition, lexicographic order, maximum compatibles (MC´s).;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/T-C.1975.224318
Filename :
1672911
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=1118960
بازگشت