scholarly journals Algorithmic Issues in some Disjoint Clustering Problems in Combinatorial Circuits

2018 ◽  
Author(s):  
Zola Nailah Donovan
2018 ◽  
Author(s):  
Jordan Stevens ◽  
Douglas Steinley ◽  
Cassandra L. Boness ◽  
Timothy J Trull ◽  
...  

Using complete enumeration (e.g., generating all possible subsets of item combinations) to evaluate clustering problems has the benefit of locating globally optimal solutions automatically without the concern of sampling variability. The proposed method is meant to combine clustering variables in such a way as to create groups that are maximally different on a theoretically sound derivation variable(s). After the population of all unique sets is permuted, optimization on some predefined, user-specific function can occur. We apply this technique to optimizing the diagnosis of Alcohol Use Disorder. This is a unique application, from a clustering point of view, in that the decision rule for clustering observations into the diagnosis group relies on both the set of items being considered and a predefined threshold on the number of items required to be endorsed for the diagnosis to occur. In optimizing diagnostic rules, criteria set sizes can be reduced without a loss of significant information when compared to current and proposed, alternative, diagnostic schemes.


2010 ◽  
Vol 52 (4) ◽  
Author(s):  
Dominik Lorenz ◽  
Georg Georgakos ◽  
Ulf Schlichtmann

2010 ◽  
Vol 57 (2) ◽  
pp. 1-32 ◽  
Author(s):  
Amit Kumar ◽  
Yogish Sabharwal ◽  
Sandeep Sen

1996 ◽  
Vol 9 (3) ◽  
pp. 229-239 ◽  
Author(s):  
Santosh Kabadi ◽  
Katta G. Murty ◽  
Cosimo Spera

2009 ◽  
Vol 20 (02) ◽  
pp. 361-377
Author(s):  
DANNY Z. CHEN ◽  
MARK A. HEALY ◽  
CHAO WANG ◽  
BIN XU

In this paper, we present efficient geometric algorithms for the discrete constrained 1-D K-means clustering problem and extend our solutions to the continuous version of the problem. One key clustering constraint we consider is that the maximum difference in each cluster cannot be larger than a given threshold. These constrained 1-D K-means clustering problems appear in various applications, especially in intensity-modulated radiation therapy (IMRT). Our algorithms improve the efficiency and accuracy of the heuristic approaches used in clinical IMRT treatment planning.


2021 ◽  
Author(s):  
Xian Wu ◽  
Tianfang Zhou ◽  
Kaixiang Yi ◽  
Minrui Fei ◽  
Yayu Chen ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document