國立虎尾科技大學 |

Correlation Clustering

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Correlation Clustering/ by Bonchi Francesco, García-Soriano David, Gullo Francesco.
作者:	Francesco, Bonchi.
其他作者:	Francesco, Gullo.
面頁冊數:	XV, 133 p.online resource. :
Contained By:	Springer Nature eBook
標題:	Statistics. -
電子資源:	https://doi.org/10.1007/978-3-031-79210-6
ISBN:	9783031792106

Correlation Clustering
Francesco, Bonchi.

Correlation Clustering[electronic resource] /by Bonchi Francesco, García-Soriano David, Gullo Francesco. - 1st ed. 2022. - XV, 133 p.online resource. - Synthesis Lectures on Data Mining and Knowledge Discovery,2151-0075. - Synthesis Lectures on Data Mining and Knowledge Discovery,.

Preface -- Acknowledgments -- Foundations -- Constraints -- Relaxed Formulations -- Other Types of Graphs -- Other Computational Settings -- Conclusions and Open Problems -- Bibliography -- Authors' Biographies.

Given a set of objects and a pairwise similarity measure between them, the goal of correlation clustering is to partition the objects in a set of clusters to maximize the similarity of the objects within the same cluster and minimize the similarity of the objects in different clusters. In most of the variants of correlation clustering, the number of clusters is not a given parameter; instead, the optimal number of clusters is automatically determined. Correlation clustering is perhaps the most natural formulation of clustering: as it just needs a definition of similarity, its broad generality makes it applicable to a wide range of problems in different contexts, and, particularly, makes it naturally suitable to clustering structured objects for which feature vectors can be difficult to obtain. Despite its simplicity, generality, and wide applicability, correlation clustering has so far received much more attention from an algorithmic-theory perspective than from the data-mining community. The goal of this lecture is to show how correlation clustering can be a powerful addition to the toolkit of a data-mining researcher and practitioner, and to encourage further research in the area.

ISBN: 9783031792106

Standard No.: 10.1007/978-3-031-79210-6doiSubjects--Topical Terms:

556824
Statistics.

LC Class. No.: QA76.9.D343

Dewey Class. No.: 006.312

Correlation Clustering
LDR:02815nam a22004095i 4500 001 1086999
003 DE-He213
005 20220601133621.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783031792106 $9 978-3-031-79210-6
024 7 $a 10.1007/978-3-031-79210-6 $2 doi
035 $a 978-3-031-79210-6
050 4 $a QA76.9.D343
072 7 $a UNF $2 bicssc
072 7 $a UYQE $2 bicssc
072 7 $a COM021030 $2 bisacsh
072 7 $a UNF $2 thema
072 7 $a UYQE $2 thema
082 0 4 $a 006.312 $2 23
100 1 $a Francesco, Bonchi. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1393918
245 1 0 $a Correlation Clustering $h [electronic resource] / $c by Bonchi Francesco, García-Soriano David, Gullo Francesco.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a XV, 133 p. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Synthesis Lectures on Data Mining and Knowledge Discovery, $x 2151-0075
505 0 $a Preface -- Acknowledgments -- Foundations -- Constraints -- Relaxed Formulations -- Other Types of Graphs -- Other Computational Settings -- Conclusions and Open Problems -- Bibliography -- Authors' Biographies.
520 $a Given a set of objects and a pairwise similarity measure between them, the goal of correlation clustering is to partition the objects in a set of clusters to maximize the similarity of the objects within the same cluster and minimize the similarity of the objects in different clusters. In most of the variants of correlation clustering, the number of clusters is not a given parameter; instead, the optimal number of clusters is automatically determined. Correlation clustering is perhaps the most natural formulation of clustering: as it just needs a definition of similarity, its broad generality makes it applicable to a wide range of problems in different contexts, and, particularly, makes it naturally suitable to clustering structured objects for which feature vectors can be difficult to obtain. Despite its simplicity, generality, and wide applicability, correlation clustering has so far received much more attention from an algorithmic-theory perspective than from the data-mining community. The goal of this lecture is to show how correlation clustering can be a powerful addition to the toolkit of a data-mining researcher and practitioner, and to encourage further research in the area.
650 2 4 $a Statistics. $3 556824
650 1 4 $a Data Mining and Knowledge Discovery. $3 677765
650 0 $a Statistics . $3 1253516
650 0 $a Data mining. $3 528622
700 1 $a Francesco, Gullo. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1393920
700 1 $a David, García-Soriano. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1393919
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783031792229
776 0 8 $i Printed edition: $z 9783031791987
776 0 8 $i Printed edition: $z 9783031792342
830 0 $a Synthesis Lectures on Data Mining and Knowledge Discovery, $x 2151-0075 $3 1389784
856 4 0 $u https://doi.org/10.1007/978-3-031-79210-6
912 $a ZDB-2-SXSC
950 $a Synthesis Collection of Technology (R0) (SpringerNature-85007)