A combinatorial multi-armed bandit approach to correlation clustering
DOI10.1007/s10618-023-00937-5zbMath1528.68340OpenAlexW4382727232WikidataQ125806122 ScholiaQ125806122MaRDI QIDQ6170402
D. Mandaglio, Francesco Gullo, Andrea Tagarelli
Publication date: 10 August 2023
Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10618-023-00937-5
exploration and exploitationcorrelation clusteringprobability constraintregret analysiscombinatorial multi-armed banditapproximation oraclecombinatorial lower confidence boundexpected cumulative lossmaximization of agreementsminimization of disagreements
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial games (91A46) Signed and weighted graphs (05C22)
Cites Work
- Unnamed Item
- Unnamed Item
- Combinatorial bandits
- Correlation clustering
- Cluster graph modification problems
- Shelf space dimensioning and product allocation in retail stores
- Correlation clustering in general weighted graphs
- Clustering with qualitative information
- New Formulations for the Conflict Resolution Problem in the Scheduling of Television Commercials
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
- Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds
- Scheduling Commercials on Broadcast Television
- Stochastic Online Shortest Path Routing: The Value of Feedback
- Correlation Clustering
- Probability Inequalities for Sums of Bounded Random Variables
- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
- Aggregating inconsistent information
- Finite-time analysis of the multiarmed bandit problem
This page was built for publication: A combinatorial multi-armed bandit approach to correlation clustering
