Document Open Access Logo

Parameterized Dynamic Cluster Editing

Authors Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier



PDF
Thumbnail PDF

File

LIPIcs.FSTTCS.2018.46.pdf
  • Filesize: 0.49 MB
  • 15 pages

Document Identifiers

Author Details

Junjie Luo
  • Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China , School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing, China
Hendrik Molter
  • Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany
André Nichterlein
  • Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany
Rolf Niedermeier
  • Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany

Cite AsGet BibTex

Junjie Luo, Hendrik Molter, André Nichterlein, and Rolf Niedermeier. Parameterized Dynamic Cluster Editing. In 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 122, pp. 46:1-46:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.FSTTCS.2018.46

Abstract

We introduce a dynamic version of the NP-hard Cluster Editing problem. The essential point here is to take into account dynamically evolving input graphs: Having a cluster graph (that is, a disjoint union of cliques) that represents a solution for a first input graph, can we cost-efficiently transform it into a "similar" cluster graph that is a solution for a second ("subsequent") input graph? This model is motivated by several application scenarios, including incremental clustering, the search for compromise clusterings, or also local search in graph-based data clustering. We thoroughly study six problem variants (edge editing, edge deletion, edge insertion; each combined with two distance measures between cluster graphs). We obtain both fixed-parameter tractability as well as parameterized hardness results, thus (except for two open questions) providing a fairly complete picture of the parameterized computational complexity landscape under the perhaps two most natural parameterizations: the distance of the new "similar" cluster graph to (i) the second input graph and to (ii) the input cluster graph.

Subject Classification

ACM Subject Classification
  • Theory of computation → Graph algorithms analysis
  • Theory of computation → Parameterized complexity and exact algorithms
Keywords
  • graph-based data clustering
  • goal-oriented clustering
  • compromise clustering
  • NP-hard problems
  • fixed-parameter tractability
  • parameterized hardness

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Faisal N. Abu-Khzam. On the complexity of multi-parameterized cluster editing. Journal of Discrete Algorithms, 45:26-34, 2017. Google Scholar
  2. Faisal N. Abu-Khzam, Shaowei Cai, Judith Egan, Peter Shaw, and Kai Wang. Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis. In Proceedings of the 14th Annual Conference on Theory and Applications of Models of Computation, TAMC 2017, volume 10185 of LNCS, pages 59-70. Springer, 2017. Google Scholar
  3. Faisal N Abu-Khzam, Judith Egan, Michael R Fellows, Frances A Rosamond, and Peter Shaw. On the parameterized complexity of dynamic problems. Theoretical Computer Science, 607:426-434, 2015. Google Scholar
  4. Faisal N. Abu-Khzam, Judith Egan, Serge Gaspers, Alexis Shaw, and Peter Shaw. Cluster Editing with Vertex Splitting. In Proceeding of the 5th International Symposium on Combinatorial Optimization, ISCO 2018, volume 10856 of LNCS, pages 1-13. Springer, 2018. Google Scholar
  5. Nikhil Bansal, Avrim Blum, and Shuchi Chawla. Correlation Clustering. Machine Learning, 56:89-113, 2004. Google Scholar
  6. Amir Ben-Dor, Ron Shamir, and Zohar Yakhini. Clustering Gene Expression Patterns. Journal of Computational Biology, 6(3-4):281-297, 1999. Google Scholar
  7. Hans-Joachim Böckenhauer, Juraj Hromkovič, Tobias Mömke, and Peter Widmayer. On the Hardness of Reoptimization. In Proceedings of the 34th Conference on Theory and Practice of Computer Science, SOFSEM 2008, volume 4910 of LNCS, pages 50-65. Springer, 2008. Google Scholar
  8. Sebastian Böcker and Jan Baumbach. Cluster Editing. In Proceedings of the 9th Conference on Computability in Europe, CiE 2013, volume 7921 of LNCS, pages 33-44. Springer, 2013. Google Scholar
  9. Yixin Cao and Jianer Chen. Cluster Editing: Kernelization Based on Edge Cuts. Algorithmica, 64(1):152-169, 2012. Google Scholar
  10. Moses Charikar, Chandra Chekuri, Tomás Feder, and Rajeev Motwani. Incremental clustering and dynamic information retrieval. SIAM Journal on Computing, 33(6):1417-1440, 2004. Google Scholar
  11. Jianer Chen and Jie Meng. A 2k kernel for the cluster editing problem. Journal of Computer and System Sciences, 78(1):211-220, 2012. Google Scholar
  12. Jiehua Chen, Hendrik Molter, Manuel Sorge, and Ondrej Suchý. Cluster Editing in Multi-Layer and Temporal Graphs. In Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC '18), LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. To appear. Google Scholar
  13. Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh. Parameterized Algorithms. Springer, 2015. Google Scholar
  14. Tamal K. Dey, Alfred Rossi, and Anastasios Sidiropoulos. Temporal Clustering. In Proceedings of the 25th Annual European Symposium on Algorithms, ESA 2017, volume 87 of LIPIcs, pages 34:1-34:14. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2017. Google Scholar
  15. X. Dong, P. Frossard, P. Vandergheynst, and N. Nefedov. Clustering With Multi-Layer Graphs: A Spectral Perspective. IEEE Transactions on Signal Processing, 60(11):5820-5831, 2012. Google Scholar
  16. Rodney G Downey, Judith Egan, Michael R Fellows, Frances A Rosamond, and Peter Shaw. Dynamic dominating set and turbo-charging greedy heuristics. Tsinghua Science and Technology, 19(4):329-337, 2014. Google Scholar
  17. Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, and Yngve Villanger. Local search: Is brute-force avoidable? Journal of Computer and System Sciences, 78(3):707-719, 2012. Google Scholar
  18. Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk, and Yngve Villanger. Tight Bounds for Parameterized Complexity of Cluster Editing with a Small Number of Clusters. Journal of Computer and System Sciences, 80(7):1430-1447, 2014. Google Scholar
  19. Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, and Stefan Szeider. Don't Be Strict in Local Search! In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, pages 486-492. AAAI Press, 2012. Google Scholar
  20. Jens Gramm, Jiong Guo, Falk Hüffner, and Rolf Niedermeier. Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation. Theory of Computing Systems, 38(4):373-392, 2005. Google Scholar
  21. Jiong Guo, Sepp Hartung, Rolf Niedermeier, and Ondrej Suchý. The Parameterized Complexity of Local Search for TSP, More Refined. Algorithmica, 67(1):89-110, 2013. Google Scholar
  22. Sepp Hartung and Holger H. Hoos. Programming by Optimisation Meets Parameterised Algorithmics: A Case Study for Cluster Editing. In Proceedings of the 9th International Conference on Learning and Intelligent Optimization, LION 2015, volume 8994 of LNCS, pages 43-58. Springer, 2015. Google Scholar
  23. Sepp Hartung and Rolf Niedermeier. Incremental list coloring of graphs, parameterized by conservation. Theoretical Computer Science, 494:86-98, 2013. Google Scholar
  24. Hans Kellerer, Ulrich Pferschy, and David Pisinger. Knapsack Problems. Springer, 2004. Google Scholar
  25. Christian Komusiewicz and Johannes Uhlmann. Cluster editing with locally bounded modifications. Discrete Applied Mathematics, 160(15):2259-2270, 2012. Google Scholar
  26. R Krithika, Abhishek Sahu, and Prafullkumar Tale. Dynamic parameterized problems. Algorithmica, 80(9):2637-2655, 2018. Google Scholar
  27. Dániel Marx and Ildikó Schlotter. Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties. Algorithmica, 58(1):170-187, 2010. Google Scholar
  28. Marina Meilă. Comparing clusterings: an axiomatic view. In Proceedings of the 22nd International Conference on Machine Learning, pages 577-584. ACM, 2005. Google Scholar
  29. Marina Meilă. Local equivalences of distances between clusterings—a geometric perspective. Machine Learning, 86(3):369-389, 2012. Google Scholar
  30. Baruch Schieber, Hadas Shachnai, Gal Tamir, and Tami Tamir. A theory and algorithms for combinatorial reoptimization. Algorithmica, 80(2):576-607, 2018. Google Scholar
  31. Ron Shamir, Roded Sharan, and Dekel Tsur. Cluster graph modification problems. Discrete Applied Mathematics, 144(1-2):173-182, 2004. Google Scholar
  32. W. Tang, Z. Lu, and I. S. Dhillon. Clustering with Multiple Graphs. In Proceedings of the Ninth IEEE International Conference on Data Mining, ICDM 2009, pages 1016-1021, 2009. Google Scholar
  33. C. Tantipathananandh and T. Y. Berger-Wolf. Finding Communities in Dynamic Social Networks. In Proceedings of the IEEE 11th International Conference on Data Mining, ICDM 2011, pages 1236-1241, 2011. Google Scholar
  34. Chayant Tantipathananandh, T. Y. Berger-Wolf, and David Kempe. A Framework for Community Identification in Dynamic Social Networks. In Proceedings of the 13th SIGKDD Conference on Knowledge Discovery and Data Mining, KDD 2007, pages 717-726. ACM, 2007. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail