Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Finding a Cluster in Incomplete Data (2312.07628v1)

Published 12 Dec 2023 in cs.DS

Abstract: We study two variants of the fundamental problem of finding a cluster in incomplete data. In the problems under consideration, we are given a multiset of incomplete $d$-dimensional vectors over the binary domain and integers $k$ and $r$, and the goal is to complete the missing vector entries so that the multiset of complete vectors either contains (i) a cluster of $k$ vectors of radius at most $r$, or (ii) a cluster of $k$ vectors of diameter at most $r$. We give tight characterizations of the parameterized complexity of the problems under consideration with respect to the parameters $k$, $r$, and a third parameter that captures the missing vector entries.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (28)
  1. k𝑘kitalic_k-subspaces with missing data. 2012 IEEE Statistical Signal Processing Workshop (SSP), pages 612–615, 2012.
  2. Closest string with outliers. BMC Bioinformatics, 12(S-1):S55, 2011.
  3. Consensus strings with small maximum distance and small distance sum. Algorithmica, 82(5):1378–1409, 2020.
  4. Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension. ACM Trans. Algorithms, 7(4):43:1–43:27, 2011.
  5. Clustering to minimize the sum of cluster diameters. Journal of Computer and System Sciences, 68(2):417 – 441, 2004.
  6. Parameterized Algorithms. Springer, 2015.
  7. Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, 2013.
  8. A simple heuristic for the p𝑝pitalic_p-centre problem. Oper. Res. Lett., 3(6):285–288, 1985.
  9. The parameterized complexity of clustering incomplete data. In The Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, pages 7296–7304. AAAI Press, 2021.
  10. Ehsan Elhamifar. High-rank matrix completion and clustering under self-expressive models. In D. D. Lee, M. Sugiyama, U. V. Luxburg, I. Guyon, and R. Garnett, editors, Advances in Neural Information Processing Systems 29, pages 73–81. Curran Associates, Inc., 2016.
  11. Sparse subspace clustering: Algorithm, theory, and applications. IEEE Trans. Pattern Anal. Mach. Intell., 35(11):2765–2781, 2013.
  12. Optimal algorithms for approximate clustering. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC ’88, pages 434–444. ACM, 1988.
  13. Parameterized Complexity Theory, volume XIV of Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, 2006.
  14. M. Frances and A. Litman. On covering problems of codes. Theory of Computing Systems, 30(2):113–119, 1997.
  15. Parameterized algorithms for the matrix completion problem. In ICML, volume 80 of JMLR Workshop and Conference Proceedings, pages 1642–1651, 2018.
  16. Efficient approximation algorithms for the Hamming center problem. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 905–906, 1999.
  17. Approximation algorithms for Hamming clustering problems. Journal of Discrete Algorithms, 2(2):289 – 301, 2004.
  18. Teofilo F. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38:293 – 306, 1985.
  19. Fixed-parameter algorithms for CLOSEST STRING and related problems. Algorithmica, 37(1):25–42, 2003.
  20. Parameterized complexity analysis for the closest string with wildcards problem. Theoretical Computer Science, 600:11–18, 2015.
  21. Parameterized algorithms for matrix completion with radius constraints. In Inge Li Gørtz and Oren Weimann, editors, 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark, volume 161 of LIPIcs, pages 20:1–20:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
  22. Binary matrix completion under diameter constraints. In Markus Bläser and Benjamin Monmege, editors, 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference), volume 187 of LIPIcs, pages 47:1–47:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
  23. Parameterized complexity and kernelizability of max ones and exact ones problems. TOCT, 8(1):1:1–1:28, 2016.
  24. H. W. Lenstra and Jr. Integer programming with a fixed number of variables. Math. Oper. Res., 8(4):538–548, 1983.
  25. On the closest string and substring problems. J. ACM, 49(2):157–171, 2002.
  26. Dániel Marx. Parameterized complexity of constraint satisfaction problems. Computational Complexity, 14(2):153–183, 2005.
  27. Dániel Marx. Closest substring problems with small distances. SIAM J. Comput., 38(4):1382–1410, 2008.
  28. Robust ensemble clustering by matrix completion. In 2012 IEEE 12th International Conference on Data Mining, pages 1176–1181, 2012.
Citations (3)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now