Two-neighborhood method for computing similarity between two groups of objects

作者: Robert W. Schwanke

DOI:

关键词:

摘要: A method for computing the similarity between two groups of objects wherein any pair can be computed by a function, being use in software clustering, when it is known that only are "near neighbors" to given object considered similarity, is, some positive integer "Y", Y-nearest neighbors considered, smaller "X" an same group as at least X its Y nearest neighbors, none other matter, and input comprises set containing objects, specific groups, B, values Y, comprising: (a) each object, identifying (hereafter called X-neighbors); (b) hereinafter Y-neighbors; (c) which neither Y-neighbor other, redefining them zero; (d) whose X-neighbors all itself, (e). outputing whereby maximum B.

参考文章(33)
R.W. Selby, V.R. Basili, Error localization during software maintenance: generating hierarchical system descriptions from the source code alone international conference on software maintenance. pp. 192- 197 ,(1988) , 10.1109/ICSM.1988.10161
O Patent Division Tsuneo, O Patent Division Kenichi, Nitta C, Maeda C, Pattern recognition apparatus and method for making same ,(1983)
Hiroaki Sakoe, System for recognizing a word sequence by dynamic programming and by the use of a state transition diagram Journal of the Acoustical Society of America. ,vol. 80, pp. 1283- 1283 ,(1980) , 10.1121/1.394419
G. Tesauro, T.J. Sejnowski, A parallel network that learns to play backgammon Artificial Intelligence. ,vol. 39, pp. 357- 390 ,(1989) , 10.1016/0004-3702(89)90017-9