Weighted Agglomerative Clustering to Solve Normalized Cuts Problems

Giulio Genovese

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

Weighted Agglomerative Clustering to Solve Normalized Cuts Problems

In Proceedings of the 8th International Workshop on Pattern Recognition in Information Systems - Volume 0ICEIS, 67-76, 2008 , Barcelona, Spain

Author: Giulio Genovese

Affiliation: Dartmouth College, United States

Abstract: A new agglomerative algorithm is introduced that can be used as a replacement for any partitioning algorithm that tries to optimize an objective function related to graph cuts. In particular, spectral clustering algorithms fall in this category. A new measure of similarity is introduced to show that the approach, although radically different from the one adopted in partitioning approaches, tries to optimize the same objective. Experiments are performed for the problem of image segmentation but the idea can be applied to a broader range of applications.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 18.216.230.107

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Genovese, G. (2008). Weighted Agglomerative Clustering to Solve Normalized Cuts Problems. In Proceedings of the 8th International Workshop on Pattern Recognition in Information Systems (ICEIS 2008) - PRIS; ISBN 978-989-8111-42-5, SciTePress, pages 67-76. DOI: 10.5220/0001740100670076

@conference{pris08,
author={Giulio Genovese.},
title={Weighted Agglomerative Clustering to Solve Normalized Cuts Problems},
booktitle={Proceedings of the 8th International Workshop on Pattern Recognition in Information Systems (ICEIS 2008) - PRIS},
year={2008},
pages={67-76},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001740100670076},
isbn={978-989-8111-42-5},
}

TY - CONF

JO - Proceedings of the 8th International Workshop on Pattern Recognition in Information Systems (ICEIS 2008) - PRIS
TI - Weighted Agglomerative Clustering to Solve Normalized Cuts Problems
SN - 978-989-8111-42-5
AU - Genovese, G.
PY - 2008
SP - 67
EP - 76
DO - 10.5220/0001740100670076
PB - SciTePress