A combinatorial multi-armed bandit approach to correlation clustering

DOI10.1007/S10618-023-00937-5MaRDI QIDQ6170402zbMATH OpenOpenAlexWikidataFDO

Authors Francesco Gullo, D. Mandaglio, Andrea Tagarelli

Publication date 10 August 2023

Published in Data Mining and Knowledge Discovery (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10618-023-00937-5

zbMATH Keywords

approximation oraclecombinatorial lower confidence boundcombinatorial multi-armed banditcorrelation clusteringexpected cumulative lossexploration and exploitationmaximization of agreementsminimization of disagreementsprobability constraintregret analysis

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial games (91A46)

Recommendations

• Combinatorial multi-armed bandit and its extension to probabilistically triggered arms
• Correlation clustering with constrained cluster sizes and extended weights bounds
• Correlation clustering with partial information
• Correlation clustering
• Correlation clustering in general weighted graphs

Cites work

• Aggregating inconsistent information: ranking and clustering
• Cluster graph modification problems
• Clustering with qualitative information
• Combinatorial bandits
• Correlation clustering
• Correlation Clustering
• Correlation clustering in general weighted graphs
• Correlation clustering with constrained cluster sizes and extended weights bounds
• Correlation clustering, maximizing agreements via semidefinite programming
• Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
• Finite-time analysis of the multiarmed bandit problem
• scientific article; zbMATH DE number 4078557 (Why is no real title available?)
• Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
• New formulations for the conflict resolution problem in the scheduling of television commercials
• Probability Inequalities for Sums of Bounded Random Variables
• Scheduling Commercials on Broadcast Television
• Shelf space dimensioning and product allocation in retail stores
• Stochastic Online Shortest Path Routing: The Value of Feedback

Cited in

(1)

• Learning-augmented maximum independent set

This page was built for publication: A combinatorial multi-armed bandit approach to correlation clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6170402)