Answers are grounded in this paper and cite their sources.
For industrial logistics tasks, an algorithm for clustering a given set of machine parts on the basis of engineering drawings is proposed. To speed up clustering, the values of each parameter are fuzzified and local maximums of the N-dimensional histogram are sought. The search uses the selection of adjacent vectors based on the recalculation of coordinates from the N-dimensional space to a one-dimensional space and vice versa and on the comparison with coordinates of neighboring vectors. Thereby the algorithm finds the cluster vertices in a single pass, and it does not require the creation of numerous local lists or vector adjacency graphs, which improves the efficiency of the clustering algorithm. Experimental results on automatic grouping of machine parts on the basis of drawings are discussed.
No takes yet. Share an insight, caveat, or question.
Kuchuganov et al. (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: