2020 Eighth International Symposium on Computing and Networking (CANDAR) 2020
DOI: 10.1109/candar51075.2020.00015
|View full text |Cite
|
Sign up to set email alerts
|

Combinatorial Clustering Based on an Externally-Defined One-Hot Constraint

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 16 publications
0
6
0
Order By: Relevance
“…For example, when the number of clusters K is 4, and the number of data points N is 3, d ≤ 62. On the actual quantum annealer, 1 8 d < 8 from Eq. (12).…”
Section: Problems Of the Annealing-based Clustering Algorithmmentioning
confidence: 99%
See 4 more Smart Citations
“…For example, when the number of clusters K is 4, and the number of data points N is 3, d ≤ 62. On the actual quantum annealer, 1 8 d < 8 from Eq. (12).…”
Section: Problems Of the Annealing-based Clustering Algorithmmentioning
confidence: 99%
“…Variable q 1 1 = 1 means data point i = 1 belongs to cluster a = 1. If a variable q 1 1 = 1 is flipped, all variables q 1 1 , q 1 2 , and q 1 3 become zero, which violates a constraint. Data point i = 1 does not belong to any cluster.…”
Section: Combinatorial Clustering Using Simulated Annealing With An External Constraintmentioning
confidence: 99%
See 3 more Smart Citations