Skip to main content

2022 | OriginalPaper | Buchkapitel

11. Triclustering in Big Data Setting

verfasst von : Dmitry Egurnov, Dmitry I. Ignatov, Dmitry Tochilkin

Erschienen in: Complex Data Analytics with Formal Concept Analysis

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper, we describe versions of triclustering algorithms adapted for efficient calculations in distributed environments with MapReduce model or parallelisation mechanism provided by modern programming languages. OAC-family of triclustering algorithms shows good parallelisation capabilities due to the independent processing of triples of a triadic formal context. We provide time and space complexity of the algorithms and justify their relevance. We also compare performance gain from using a distributed system and scalability.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Collin F. Baker, Charles J. Fillmore, and John B. Lowe. The Berkeley FrameNet Project. In Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics - Volume 1, ACL ’98/COLING ’98, pages 86–90, Stroudsburg, PA, USA, 1998. Association for Computational Linguistics. Collin F. Baker, Charles J. Fillmore, and John B. Lowe. The Berkeley FrameNet Project. In Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics - Volume 1, ACL ’98/COLING ’98, pages 86–90, Stroudsburg, PA, USA, 1998. Association for Computational Linguistics.
2.
Zurück zum Zitat Besson, J., Pensa, R.G., Robardet, C., Boulicaut, J.F.: Constraint-based mining of fault-tolerant patterns from boolean data. In: International Workshop on Knowledge Discovery in Inductive Databases. pp. 55–71. Springer (2005) Besson, J., Pensa, R.G., Robardet, C., Boulicaut, J.F.: Constraint-based mining of fault-tolerant patterns from boolean data. In: International Workshop on Knowledge Discovery in Inductive Databases. pp. 55–71. Springer (2005)
3.
Zurück zum Zitat Loïc Cerf, Jérémy Besson, Kim-Ngan Nguyen, and Jean-François Boulicaut. Closed and noise-tolerant patterns in n-ary relations. Data Min. Knowl. Discov., 26(3):574–619, 2013.MathSciNetCrossRef Loïc Cerf, Jérémy Besson, Kim-Ngan Nguyen, and Jean-François Boulicaut. Closed and noise-tolerant patterns in n-ary relations. Data Min. Knowl. Discov., 26(3):574–619, 2013.MathSciNetCrossRef
4.
Zurück zum Zitat Dmitrii Egurnov, Dmitry Ignatov, and Engelbert Mephu Nguifo. Mining triclusters of similar values in triadic real-valued contexts. In 14th International Conference on Formal Concept Analysis-Supplementary Proceedings, pages 31–47, 2017. Dmitrii Egurnov, Dmitry Ignatov, and Engelbert Mephu Nguifo. Mining triclusters of similar values in triadic real-valued contexts. In 14th International Conference on Formal Concept Analysis-Supplementary Proceedings, pages 31–47, 2017.
5.
Zurück zum Zitat Dmitrii Egurnov and Dmitry I. Ignatov. Triclustring toolbox. In Supplementary Proceedings of ICFCA 2019 Conference and Workshops, Frankfurt, Germany, June 25–28, 2019, pages 65–69, 2019. Dmitrii Egurnov and Dmitry I. Ignatov. Triclustring toolbox. In Supplementary Proceedings of ICFCA 2019 Conference and Workshops, Frankfurt, Germany, June 25–28, 2019, pages 65–69, 2019.
6.
Zurück zum Zitat Kemal Eren, Mehmet Deveci, Onur Kucuktunc, and Catalyurek, Umit V. A comparative analysis of biclustering algorithms for gene expression data. Briefings in Bioinform., 2012. Kemal Eren, Mehmet Deveci, Onur Kucuktunc, and Catalyurek, Umit V. A comparative analysis of biclustering algorithms for gene expression data. Briefings in Bioinform., 2012.
7.
Zurück zum Zitat Bernhard Ganter, Peter A. Grigoriev, Sergei O. Kuznetsov, and Mikhail V. Samokhin. Concept-based data mining with scaled labeled graphs. In ICCS, pages 94–108, 2004. Bernhard Ganter, Peter A. Grigoriev, Sergei O. Kuznetsov, and Mikhail V. Samokhin. Concept-based data mining with scaled labeled graphs. In ICCS, pages 94–108, 2004.
8.
Zurück zum Zitat Bernhard Ganter and Rudolf Wille. Formal Concept Analysis: Mathematical Foundations. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 1st edition, 1999. Bernhard Ganter and Rudolf Wille. Formal Concept Analysis: Mathematical Foundations. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 1st edition, 1999.
9.
Zurück zum Zitat Elisabeth Georgii, Koji Tsuda, and Bernhard Schölkopf. Multi-way set enumeration in weight tensors. Machine Learning, 82(2):123–155, 2011.MathSciNetCrossRef Elisabeth Georgii, Koji Tsuda, and Bernhard Schölkopf. Multi-way set enumeration in weight tensors. Machine Learning, 82(2):123–155, 2011.MathSciNetCrossRef
10.
Zurück zum Zitat Dmitry V. Gnatyshak, Dmitry I. Ignatov, and Sergei O. Kuznetsov. From triadic FCA to triclustering: Experimental comparison of some triclustering algorithms. In CLA, pages 249–260, 2013. Dmitry V. Gnatyshak, Dmitry I. Ignatov, and Sergei O. Kuznetsov. From triadic FCA to triclustering: Experimental comparison of some triclustering algorithms. In CLA, pages 249–260, 2013.
11.
Zurück zum Zitat Dmitry V. Gnatyshak, Dmitry I. Ignatov, Sergei O. Kuznetsov, and Lhouari Nourine. A one-pass triclustering approach: Is there any room for big data? In CLA 2014, 2014. Dmitry V. Gnatyshak, Dmitry I. Ignatov, Sergei O. Kuznetsov, and Lhouari Nourine. A one-pass triclustering approach: Is there any room for big data? In CLA 2014, 2014.
12.
Zurück zum Zitat Dmitry V. Gnatyshak, Dmitry I. Ignatov, Alexander V. Semenov, and Jonas Poelmans. Gaining insight in social networks with biclustering and triclustering. In BIR, volume 128 of Lecture Notes in Business Information Processing, pages 162–171. Springer, 2012. Dmitry V. Gnatyshak, Dmitry I. Ignatov, Alexander V. Semenov, and Jonas Poelmans. Gaining insight in social networks with biclustering and triclustering. In BIR, volume 128 of Lecture Notes in Business Information Processing, pages 162–171. Springer, 2012.
13.
Zurück zum Zitat F. Maxwell Harper and Joseph A. Konstan. The MovieLens datasets: History and context. TiiS, 5(4):19:1–19:19, 2016. F. Maxwell Harper and Joseph A. Konstan. The MovieLens datasets: History and context. TiiS, 5(4):19:1–19:19, 2016.
14.
Zurück zum Zitat Rui Henriques and Sara C. Madeira. Triclustering algorithms for three-dimensional data analysis: A comprehensive survey. ACM Comput. Surv., 51(5):95:1–95:43, September 2018. Rui Henriques and Sara C. Madeira. Triclustering algorithms for three-dimensional data analysis: A comprehensive survey. ACM Comput. Surv., 51(5):95:1–95:43, September 2018.
15.
Zurück zum Zitat Dmitry I. Ignatov, Dmitry V. Gnatyshak, Sergei O. Kuznetsov, and Boris Mirkin. Triadic formal concept analysis and triclustering: searching for optimal patterns. Machine Learning, pages 1–32, 2015. Dmitry I. Ignatov, Dmitry V. Gnatyshak, Sergei O. Kuznetsov, and Boris Mirkin. Triadic formal concept analysis and triclustering: searching for optimal patterns. Machine Learning, pages 1–32, 2015.
16.
Zurück zum Zitat Dmitry I. Ignatov, Sergei O. Kuznetsov, and Jonas Poelmans. Concept-based biclustering for internet advertisement. In ICDM Workshops, pages 123–130. IEEE Computer Society, 2012. Dmitry I. Ignatov, Sergei O. Kuznetsov, and Jonas Poelmans. Concept-based biclustering for internet advertisement. In ICDM Workshops, pages 123–130. IEEE Computer Society, 2012.
17.
Zurück zum Zitat Dmitry I. Ignatov, Sergei O. Kuznetsov, Jonas Poelmans, and Leonid E. Zhukov. Can triconcepts become triclusters? International Journal of General Systems, 42(6):572–593, 2013.MathSciNetCrossRef Dmitry I. Ignatov, Sergei O. Kuznetsov, Jonas Poelmans, and Leonid E. Zhukov. Can triconcepts become triclusters? International Journal of General Systems, 42(6):572–593, 2013.MathSciNetCrossRef
18.
Zurück zum Zitat Dmitry I. Ignatov, Elena Nenova, Natalia Konstantinova, and Andrey V. Konstantinov. Boolean Matrix Factorisation for Collaborative Filtering: An FCA-Based Approach. In AIMSA 2014, Varna, Bulgaria, Proceedings, volume LNCS 8722, pages 47–58, 2014. Dmitry I. Ignatov, Elena Nenova, Natalia Konstantinova, and Andrey V. Konstantinov. Boolean Matrix Factorisation for Collaborative Filtering: An FCA-Based Approach. In AIMSA 2014, Varna, Bulgaria, Proceedings, volume LNCS 8722, pages 47–58, 2014.
19.
Zurück zum Zitat Dmitry I. Ignatov, Dmitry Tochilkin, and Dmitry Egurnov. Multimodal clustering of Boolean tensors on MapReduce: Experiments revisited. In Supplementary Proceedings of ICFCA 2019 Conference and Workshops, Frankfurt, Germany, June 25–28, 2019, pages 137–151, 2019. Dmitry I. Ignatov, Dmitry Tochilkin, and Dmitry Egurnov. Multimodal clustering of Boolean tensors on MapReduce: Experiments revisited. In Supplementary Proceedings of ICFCA 2019 Conference and Workshops, Frankfurt, Germany, June 25–28, 2019, pages 137–151, 2019.
20.
Zurück zum Zitat Mohamed Nader Jelassi, Sadok Ben Yahia, and Engelbert Mephu Nguifo. A personalized recommender system based on users’ information in folksonomies. In Leslie Carr and et al., editors, WWW (Companion Volume), pages 1215–1224. ACM, 2013. Mohamed Nader Jelassi, Sadok Ben Yahia, and Engelbert Mephu Nguifo. A personalized recommender system based on users’ information in folksonomies. In Leslie Carr and et al., editors, WWW (Companion Volume), pages 1215–1224. ACM, 2013.
21.
Zurück zum Zitat Mehdi Kaytoue, Sergei O. Kuznetsov, Juraj Macko, and Amedeo Napoli. Biclustering meets triadic concept analysis. Ann. Math. Artif. Intell., 70(1–2):55–79, 2014.MathSciNetCrossRef Mehdi Kaytoue, Sergei O. Kuznetsov, Juraj Macko, and Amedeo Napoli. Biclustering meets triadic concept analysis. Ann. Math. Artif. Intell., 70(1–2):55–79, 2014.MathSciNetCrossRef
22.
Zurück zum Zitat Mehdi Kaytoue, Sergei O. Kuznetsov, Amedeo Napoli, and Sébastien Duplessis. Mining gene expression data with pattern structures in formal concept analysis. Inf. Sci., 181(10):1989–2001, 2011.MathSciNetCrossRef Mehdi Kaytoue, Sergei O. Kuznetsov, Amedeo Napoli, and Sébastien Duplessis. Mining gene expression data with pattern structures in formal concept analysis. Inf. Sci., 181(10):1989–2001, 2011.MathSciNetCrossRef
23.
Zurück zum Zitat Petr Krajca and Vilem Vychodil. Distributed algorithm for computing formal concepts using map-reduce framework. In N. Adams et al. (Eds.): IDA 2009, volume LNCS 5772, pages 333–344, 2009. Petr Krajca and Vilem Vychodil. Distributed algorithm for computing formal concepts using map-reduce framework. In N. Adams et al. (Eds.): IDA 2009, volume LNCS 5772, pages 333–344, 2009.
24.
Zurück zum Zitat Sergey Kuznecov and Yury Kudryavcev. Applying map-reduce paradigm for parallel closed cube computation. In 1st Int. Conf. on Advances in Databases, Knowledge, and Data Applications, DBKDS 2009, pages 62–67, 2009. Sergey Kuznecov and Yury Kudryavcev. Applying map-reduce paradigm for parallel closed cube computation. In 1st Int. Conf. on Advances in Databases, Knowledge, and Data Applications, DBKDS 2009, pages 62–67, 2009.
25.
Zurück zum Zitat Lehmann, F., Wille, R.: A Triadic Approach to Formal Concept Analysis. In: Proceedings of the Third International Conference on Conceptual Structures: Applications, Implementation and Theory. pp. 32–43 (1995) Lehmann, F., Wille, R.: A Triadic Approach to Formal Concept Analysis. In: Proceedings of the Third International Conference on Conceptual Structures: Applications, Implementation and Theory. pp. 32–43 (1995)
26.
Zurück zum Zitat Ao Li and David Tuck. An effective tri-clustering algorithm combining expression data with gene regulation information. Gene regul. and syst. biol., 3:49–64, 2009. Ao Li and David Tuck. An effective tri-clustering algorithm combining expression data with gene regulation information. Gene regul. and syst. biol., 3:49–64, 2009.
27.
Zurück zum Zitat Sara C. Madeira and Arlindo L. Oliveira. Biclustering algorithms for biological data analysis: A survey. IEEE/ACM Trans. Comput. Biology Bioinform., 1(1):24–45, 2004.CrossRef Sara C. Madeira and Arlindo L. Oliveira. Biclustering algorithms for biological data analysis: A survey. IEEE/ACM Trans. Comput. Biology Bioinform., 1(1):24–45, 2004.CrossRef
28.
Zurück zum Zitat Saskia Metzler and Pauli Miettinen. Clustering Boolean tensors. Data Min. Knowl. Discov., 29(5):1343–1373, 2015.MathSciNetCrossRef Saskia Metzler and Pauli Miettinen. Clustering Boolean tensors. Data Min. Knowl. Discov., 29(5):1343–1373, 2015.MathSciNetCrossRef
29.
Zurück zum Zitat Boris Mirkin. Mathematical Classification and Clustering. Kluwer, Dordrecht, 1996.CrossRef Boris Mirkin. Mathematical Classification and Clustering. Kluwer, Dordrecht, 1996.CrossRef
30.
Zurück zum Zitat Boris G. Mirkin and Andrey V. Kramarenko. Approximate bicluster and tricluster boxes in the analysis of binary data. In Sergei O. Kuznetsov and et al., editors, RSFDGrC 2011, volume 6743 of Lecture Notes in Computer Science, pages 248–256. Springer, 2011. Boris G. Mirkin and Andrey V. Kramarenko. Approximate bicluster and tricluster boxes in the analysis of binary data. In Sergei O. Kuznetsov and et al., editors, RSFDGrC 2011, volume 6743 of Lecture Notes in Computer Science, pages 248–256. Springer, 2011.
31.
Zurück zum Zitat Rokia Missaoui and Léonard Kwuida. Mining triadic association rules from ternary relations. In Formal Concept Analysis - 9th International Conference, ICFCA 2011, Nicosia, Cyprus, May 2–6, 2011. Proceedings, pages 204–218, 2011. Rokia Missaoui and Léonard Kwuida. Mining triadic association rules from ternary relations. In Formal Concept Analysis - 9th International Conference, ICFCA 2011, Nicosia, Cyprus, May 2–6, 2011. Proceedings, pages 204–218, 2011.
32.
Zurück zum Zitat Alexandros Nanopoulos, Dimitrios Rafailidis, Panagiotis Symeonidis, and Yannis Manolopoulos. Musicbox: Personalized music recommendation based on cubic analysis of social tags. IEEE Transactions on Audio, Speech & Language Processing, 18(2):407–412, 2010.CrossRef Alexandros Nanopoulos, Dimitrios Rafailidis, Panagiotis Symeonidis, and Yannis Manolopoulos. Musicbox: Personalized music recommendation based on cubic analysis of social tags. IEEE Transactions on Audio, Speech & Language Processing, 18(2):407–412, 2010.CrossRef
33.
Zurück zum Zitat Alexander Panchenko, Eugen Ruppert, Stefano Faralli, Simone Paolo Ponzetto, and Chris Biemann. Building a Web-Scale Dependency-Parsed Corpus from CommonCrawl. In Nicoletta Calzolari (Conference chair), Khalid Choukri, Christopher Cieri, Thierry Declerck, Sara Goggi, Koiti Hasida, Hitoshi Isahara, Bente Maegaard, Joseph Mariani, Hélène Mazo, Asuncion Moreno, Jan Odijk, Stelios Piperidis, and Takenobu Tokunaga, editors, Proceedings of the Eleventh International Conference on Language Resources and Evaluation (LREC 2018), Miyazaki, Japan, May 7–12, 2018 2018. European Language Resources Association (ELRA). Alexander Panchenko, Eugen Ruppert, Stefano Faralli, Simone Paolo Ponzetto, and Chris Biemann. Building a Web-Scale Dependency-Parsed Corpus from CommonCrawl. In Nicoletta Calzolari (Conference chair), Khalid Choukri, Christopher Cieri, Thierry Declerck, Sara Goggi, Koiti Hasida, Hitoshi Isahara, Bente Maegaard, Joseph Mariani, Hélène Mazo, Asuncion Moreno, Jan Odijk, Stelios Piperidis, and Takenobu Tokunaga, editors, Proceedings of the Eleventh International Conference on Language Resources and Evaluation (LREC 2018), Miyazaki, Japan, May 7–12, 2018 2018. European Language Resources Association (ELRA).
34.
Zurück zum Zitat Z. Pawlak. Information systems – theoretical foundations. Information Systems, 6(3):205 – 218, 1981. Z. Pawlak. Information systems – theoretical foundations. Information Systems, 6(3):205 – 218, 1981.
35.
Zurück zum Zitat Anand Rajaraman, Jure Leskovec, and Jeffrey D. Ullman. Mining of Massive Datasets, chapter MapReduce and the New Software Stack, pages 19–70. Cambridge University Press, England, Cambridge, 2013. Anand Rajaraman, Jure Leskovec, and Jeffrey D. Ullman. Mining of Massive Datasets, chapter MapReduce and the New Software Stack, pages 19–70. Cambridge University Press, England, Cambridge, 2013.
36.
Zurück zum Zitat Nicole Schweikardt. One-pass algorithm. In Encyclopedia of Database Systems, Second Edition. 2018. Nicole Schweikardt. One-pass algorithm. In Encyclopedia of Database Systems, Second Edition. 2018.
37.
Zurück zum Zitat Kijung Shin, Bryan Hooi, and Christos Faloutsos. Fast, accurate, and flexible algorithms for dense subtensor mining. TKDD, 12(3):28:1–28:30, 2018. Kijung Shin, Bryan Hooi, and Christos Faloutsos. Fast, accurate, and flexible algorithms for dense subtensor mining. TKDD, 12(3):28:1–28:30, 2018.
38.
Zurück zum Zitat Eirini Spyropoulou, Tijl De Bie, and Mario Boley. Interesting pattern mining in multi-relational data. Data Mining and Knowledge Discovery, 28(3):808–849, 2014.MathSciNetCrossRef Eirini Spyropoulou, Tijl De Bie, and Mario Boley. Interesting pattern mining in multi-relational data. Data Mining and Knowledge Discovery, 28(3):808–849, 2014.MathSciNetCrossRef
39.
Zurück zum Zitat Dmitry Ustalov, Alexander Panchenko, Andrey Kutuzov, Chris Biemann, and Simone Paolo Ponzetto. Unsupervised semantic frame induction using triclustering. In Iryna Gurevych and Yusuke Miyao, editors, Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics, ACL 2018, Melbourne, Australia, July 15–20, 2018, Volume 2: Short Papers, pages 55–62. Association for Computational Linguistics, 2018. Dmitry Ustalov, Alexander Panchenko, Andrey Kutuzov, Chris Biemann, and Simone Paolo Ponzetto. Unsupervised semantic frame induction using triclustering. In Iryna Gurevych and Yusuke Miyao, editors, Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics, ACL 2018, Melbourne, Australia, July 15–20, 2018, Volume 2: Short Papers, pages 55–62. Association for Computational Linguistics, 2018.
41.
Zurück zum Zitat Rudolf Wille. Restructuring lattice theory: An approach based on hierarchies of concepts. In Ivan Rival, editor, Ordered Sets, volume 83 of NATO Advanced Study Institutes Series, pages 445–470. Springer Netherlands, 1982. Rudolf Wille. Restructuring lattice theory: An approach based on hierarchies of concepts. In Ivan Rival, editor, Ordered Sets, volume 83 of NATO Advanced Study Institutes Series, pages 445–470. Springer Netherlands, 1982.
42.
Zurück zum Zitat Biao Xu, Ruairı de Frein, Eric Robson, and Mıcheal O Foghlu. Distributed Formal Concept Analysis algorithms based on an iterative MapReduce framework. In F. Domenach, D.I. Ignatov, and J. Poelmans, editors, ICFCA 2012, volume LNAI 7278, pages 292–308, 2012. Biao Xu, Ruairı de Frein, Eric Robson, and Mıcheal O Foghlu. Distributed Formal Concept Analysis algorithms based on an iterative MapReduce framework. In F. Domenach, D.I. Ignatov, and J. Poelmans, editors, ICFCA 2012, volume LNAI 7278, pages 292–308, 2012.
43.
Zurück zum Zitat Matei Zaharia, Reynold S. Xin, Patrick Wendell, Tathagata Das, Michael Armbrust, Ankur Dave, Xiangrui Meng, Josh Rosen, Shivaram Venkataraman, Michael J. Franklin, Ali Ghodsi, Joseph Gonzalez, Scott Shenker, and Ion Stoica. Apache Spark: A unified engine for big data processing. Commun. ACM, 59(11):56–65, October 2016.CrossRef Matei Zaharia, Reynold S. Xin, Patrick Wendell, Tathagata Das, Michael Armbrust, Ankur Dave, Xiangrui Meng, Josh Rosen, Shivaram Venkataraman, Michael J. Franklin, Ali Ghodsi, Joseph Gonzalez, Scott Shenker, and Ion Stoica. Apache Spark: A unified engine for big data processing. Commun. ACM, 59(11):56–65, October 2016.CrossRef
44.
Zurück zum Zitat Lizhuang Zhao and Mohammed Javeed Zaki. Tricluster: An effective algorithm for mining coherent clusters in 3d microarray data. In SIGMOD 2005 Conference, pages 694–705, 2005. Lizhuang Zhao and Mohammed Javeed Zaki. Tricluster: An effective algorithm for mining coherent clusters in 3d microarray data. In SIGMOD 2005 Conference, pages 694–705, 2005.
45.
Zurück zum Zitat Sergey Zudin, Dmitry V. Gnatyshak, and Dmitry I. Ignatov. Putting OAC-triclustering on MapReduce. In Sadok Ben Yahia and Jan Konecny, editors, Proceedings of the Twelfth International Conference on Concept Lattices and Their Applications, Clermont-Ferrand, France, October 13–16, 2015., volume 1466 of CEUR Workshop Proceedings, pages 47–58. CEUR-WS.org, 2015. Sergey Zudin, Dmitry V. Gnatyshak, and Dmitry I. Ignatov. Putting OAC-triclustering on MapReduce. In Sadok Ben Yahia and Jan Konecny, editors, Proceedings of the Twelfth International Conference on Concept Lattices and Their Applications, Clermont-Ferrand, France, October 13–16, 2015., volume 1466 of CEUR Workshop Proceedings, pages 47–58. CEUR-WS.org, 2015.
Metadaten
Titel
Triclustering in Big Data Setting
verfasst von
Dmitry Egurnov
Dmitry I. Ignatov
Dmitry Tochilkin
Copyright-Jahr
2022
DOI
https://doi.org/10.1007/978-3-030-93278-7_11