排序方式: 共有4条查询结果,搜索用时 88 毫秒
1
1.
Bertrand Pierre Broniatowski Michel Marcotorchino Jean-François 《Advances in Data Analysis and Classification》2022,16(4):1069-1093
Advances in Data Analysis and Classification - This paper aims at comparing two coupling approaches as basic layers for building clustering criteria, suited for modularizing and clustering very... 相似文献
2.
F. Marcotorchino 《商业与工业应用随机模型》1987,3(2):73-91
In their article, entitled ‘Group technology in production management, the short horizon planning level’, H. Garcia and J. M. Proth have stated the following problem: starting from a (0, 1) binary matrix of size (N x M), how to divide into independent subsets the rows of this matrix simultaneously with a one-to-one corresponding partition of the columns, maximizing the presence of 1s in the intersecting blocks with a joint minimization of the presence of 0s outside of these blocks. The authors have proposed an efficient and very fast heuristic algorithm in comparison with the existing methods of a fast-growing literature on the subject. The only drawback of this algorithm is its dependence on the initial partition. In this paper, we try to improve this algorithm slightly, first in rewriting the objective function in a linear form and secondly in giving computational improvements related to this linear formulation. 相似文献
3.
4.
1