2018
DOI: 10.1007/978-3-319-92537-0_37
|View full text |Cite
|
Sign up to set email alerts
|

Developments on Solutions of the Normalized-Cut-Clustering Problem Without Eigenvectors

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…Thus, a graph of nodes (representing data points) and an adjacency matrix (representing similarity between nodes) is constructed. Accordingly, the clustering procedure is carried out by partitioning the graph into disjoint subgraphs following a graph-based similarity criteria [50]. Normalized Cut Clustering (NCC) is a graph-based partitioning approach that uses distinct clustering criteria, initially proposed for image segmentation proposes [51].…”
Section: Proposed Semi Supervised Extensionmentioning
confidence: 99%
“…Thus, a graph of nodes (representing data points) and an adjacency matrix (representing similarity between nodes) is constructed. Accordingly, the clustering procedure is carried out by partitioning the graph into disjoint subgraphs following a graph-based similarity criteria [50]. Normalized Cut Clustering (NCC) is a graph-based partitioning approach that uses distinct clustering criteria, initially proposed for image segmentation proposes [51].…”
Section: Proposed Semi Supervised Extensionmentioning
confidence: 99%