AI帮你理解科学

AI 生成解读视频

AI抽取解析论文重点内容自动生成视频


pub
生成解读视频

AI 溯源

AI解析本论文相关学术脉络


Master Reading Tree
生成 溯源树

AI 精读

AI抽取本论文的概要总结


微博一下
The pairwise similarity information is given as a weighted graph G with edges labeled as either “positive/similar” or as “negative/dissimilar” by a noisy binary classifier

Local Correlation Clustering with Asymmetric Classification Errors

ICML, pp.4677-4686, (2021)

被引用0|浏览3
EI
下载 PDF 全文
引用
微博一下

摘要

In the Correlation Clustering problem, we are given a complete weighted graph $G$ with its edges labeled as "similar" and "dissimilar" by a noisy binary classifier. For a clustering $\mathcal{C}$ of graph $G$, a similar edge is in disagreement with $\mathcal{C}$, if its endpoints belong to distinct clusters; and a dissimilar edge is in ...更多

代码

数据

0
重点内容
  • Grouping objects based on the similarity between them is a ubiquitous and important task in machine learning
  • Blum, and Chawla (2004) introduced the Correlation Clustering problem, a versatile model that elegantly captures this task of grouping objects based on similarity information
  • The pairwise similarity information is given as a weighted graph G with edges labeled as either “positive/similar” or as “negative/dissimilar” by a noisy binary classifier
  • For a clustering C, a positive edge is in disagreement with C, if its endpoints belong to distinct clusters; and a negative edge is in disagreement with C if its endpoints belong to the same cluster
  • The first quantity, disu(P, E+, E−), is the total weight of edges incident on u that are in disagreement with P. We show that this quantity can be charged to the convex programming (CP) cost of u and is at most A∞ ·yu
基金
  • Jafar Jafarov and Yury Makarychev were supported by NSF CCF-1718820, CCF-1955173, and NSF TRIPODS CCF-1934843/CCF-1934813
  • Sanchit Kalhan and Konstantin Makarychev were supported by NSF CCF-1955351 and NSF TRIPODS CCF-1934931
引用论文
  • Ahmadi, S., Khuller, S., and Saha, B. Min-max correlation clustering via multicut. In Proceedings of the Conference on Integer Programming and Combinatorial Optimization, pp. 13–26, 2019.
    Google ScholarLocate open access versionFindings
  • Ailon, N., Charikar, M., and Newman, A. Aggregating inconsistent information: ranking and clustering. Journal of the ACM (JACM), 55(5):23, 2008.
    Google ScholarLocate open access versionFindings
  • Bansal, N., Blum, A., and Chawla, S. Correlation clustering. Machine learning, 56(1-3):89–113, 2004.
    Google ScholarLocate open access versionFindings
  • Bartal, Y. Probabilistic approximation of metric spaces and its algorithmic applications. In Proceedings of 37th Conference on Foundations of Computer Science, pp. 184–193. IEEE, 1996.
    Google ScholarLocate open access versionFindings
  • Bonchi, F., Garcıa-Soriano, D., and Liberty, E. Correlation clustering: from theory to practice. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1972, 2014.
    Google ScholarLocate open access versionFindings
  • Calinescu, G., Karloff, H., and Rabani, Y. An improved approximation algorithm for multiway cut. Journal of Computer and System Sciences, 60(3):564–574, 2000.
    Google ScholarLocate open access versionFindings
  • Charikar, M., Guruswami, V., and Wirth, A. Clustering with qualitative information. In Proceedings of the Symposium on Foundations of Computer Science, 2003.
    Google ScholarLocate open access versionFindings
  • Charikar, M., Gupta, N., and Schwartz, R. Local guarantees in graph cuts and clustering. In Proceedings of the Conference on Integer Programming and Combinatorial Optimization, pp. 136–147, 2017.
    Google ScholarLocate open access versionFindings
  • Chawla, S., Makarychev, K., Schramm, T., and Yaroslavtsev, G. Near optimal LP rounding algorithm for correlation clustering on complete and complete k-partite graphs. In Proceedings of the Symposium on Theory of Computing, pp. 219–228, 2015.
    Google ScholarLocate open access versionFindings
  • Cohen, W. and Richman, J. Learning to match and cluster entity names. In Proceedings of the ACM SIGIR-2001 Workshop on Mathematical/Formal Methods in Information Retrieval, 2001.
    Google ScholarLocate open access versionFindings
  • Cohen, W. W. and Richman, J. Learning to match and cluster large high-dimensional data sets for data integration. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 475–480, 2002.
    Google ScholarLocate open access versionFindings
  • Demaine, E. D., Emanuel, D., Fiat, A., and Immorlica, N. Correlation clustering in general weighted graphs. Theoretical Computer Science, 361(2-3):172–187, 2006.
    Google ScholarLocate open access versionFindings
  • Fakcharoenphol, J., Rao, S., and Talwar, K. A tight bound on approximating arbitrary metrics by tree metrics. Journal of Computer and System Sciences, 69(3):485–497, 2004.
    Google ScholarLocate open access versionFindings
  • Jafarov, J., Kalhan, S., Makarychev, K., and Makarychev, Y. Correlation clustering with asymmetric classification errors. In Proceedings of the International Conference on Machine Learning, pp. 4641–4650, 2020.
    Google ScholarLocate open access versionFindings
  • Kalhan, S., Makarychev, K., and Zhou, T. Correlation clustering with local objectives. In Advances in Neural Information Processing System, pp. 9341–9350, 2019.
    Google ScholarLocate open access versionFindings
  • Puleo, G. J. and Milenkovic, O. Correlation clustering and biclustering with locally bounded errors. IEEE Transactions on Information Theory, 64(6):4105–4119, 2018.
    Google ScholarLocate open access versionFindings
  • Ramachandran, A., Feamster, N., and Vempala, S. Filtering spam with behavioral blacklisting. In Proceedings of the Conference on Computer and Communications Security, pp. 342–351, 2007.
    Google ScholarLocate open access versionFindings
  • Tang, S., Andres, B., Andriluka, M., and Schiele, B. Multi-person tracking by multicut and deep matching. In Proceedings of the European Conference on Computer Vision, pp. 100–111, 2016.
    Google ScholarLocate open access versionFindings
  • Tang, S., Andriluka, M., Andres, B., and Schiele, B. Multiple people tracking by lifted multicut and person re-identification. In Proceedings of the Conference on Computer Vision and Pattern Recognition, pp. 3539– 3548, 2017.
    Google ScholarLocate open access versionFindings
  • van Zuylen, A., Hegde, R., Jain, K., and Williamson, D. P. Deterministic pivoting algorithms for constrained ranking and clustering problems. In Proceedings of the Symposium on Discrete Algorithms, pp. 405–414, 2007.
    Google ScholarLocate open access versionFindings
您的评分 :
0

 

标签
评论
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn
小科