Skip to main content
Erschienen in: International Journal of Machine Learning and Cybernetics 3/2024

12.09.2023 | Original Article

A Top-K formal concepts-based algorithm for mining positive and negative correlation biclusters of DNA microarray data

verfasst von: Amina Houari, Sadok Ben Yahia

Erschienen in: International Journal of Machine Learning and Cybernetics | Ausgabe 3/2024

Einloggen

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

search-config
loading …

Abstract

Analyzing and understanding large and complex volumes of biological data is a challenging task as data becomes more widely available. In biomedical research, gene expression data are among the most commonly used biological data. Formal concept analysis frequently identifies deferentially expressed genes in microarray data. Top-K formal concepts are effective at producing effective Formal Concepts. To our knowledge, no existing algorithm can complete the difficult task of identifying only important biclusters. For this purpose, a new Top-K formal concepts-based algorithm for mining biclusters from gene expression data is proposed: Top-BicMiner. It extracts biclusters’ sets with positively and negatively correlated genes according to distinct correlation measures. The proposed method is applied to both synthetic and real-life microarray datasets. The experimental results highlight the Top-BicMiner’s ability to identify statistically and biologically significant biclusters.

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!

Weitere Produktempfehlungen anzeigen
Anhänge
Nur mit Berechtigung zugänglich
Fußnoten
1
TOPSIS stands for Order of Preference by Similarity to Ideal Solution [36].
 
2
We use a separator-free abbreviated form for the sets, e.g., \(\{I_{1}I_{2}I_{3}\}\) stands for the set of items \(\{I_1, I_2, I_3\}\).
 
3
The extraction of the formal concepts is carried out through the invocation of the efficient LCM algorithm [72].
 
4
nb1 is the number of FCs extracted in Line 9 and nb2 is the number of FCs extracted in Line 10(i.e \(nb=max(nb1,nb2\))).
 
10
The best biclusters have an adjusted p-value less than 0.001%.
 
Literatur
1.
Zurück zum Zitat Ayadi W, Elloumi M, Hao JK (2009) A biclustering algorithm based on a bicluster enumeration tree: application to dna microarray data. BioData Min 2:9CrossRefPubMedPubMedCentral Ayadi W, Elloumi M, Hao JK (2009) A biclustering algorithm based on a bicluster enumeration tree: application to dna microarray data. BioData Min 2:9CrossRefPubMedPubMedCentral
2.
Zurück zum Zitat Ayadi W, Elloumi M, Hao JK (2012) Bicfinder: a biclustering algorithm for microarray data analysis. Knowl Inf Syst 30(2):341–358CrossRef Ayadi W, Elloumi M, Hao JK (2012) Bicfinder: a biclustering algorithm for microarray data analysis. Knowl Inf Syst 30(2):341–358CrossRef
5.
Zurück zum Zitat Behera N, Sinha S (2022) Extracting the candidate genes for cancer from the microarray gene expression data by stochastic computation Behera N, Sinha S (2022) Extracting the candidate genes for cancer from the microarray gene expression data by stochastic computation
6.
Zurück zum Zitat Ben-Dor A, Chor B, Karp RM, Yakhini Z (2003) Discovering local structure in gene expression data: the order-preserving submatrix problem. J Comput Biol 10(3/4):373–384CrossRefPubMed Ben-Dor A, Chor B, Karp RM, Yakhini Z (2003) Discovering local structure in gene expression data: the order-preserving submatrix problem. J Comput Biol 10(3/4):373–384CrossRefPubMed
7.
Zurück zum Zitat Bergmann S, Ihmels J, Barkai N (2004) Defining transcription modules using large-scale gene expression data. Bioinformatics 20(13):1993–2003CrossRefPubMed Bergmann S, Ihmels J, Barkai N (2004) Defining transcription modules using large-scale gene expression data. Bioinformatics 20(13):1993–2003CrossRefPubMed
8.
Zurück zum Zitat Besson J, Robardet C, Boulicaut J, Rome S (2005) Constraint-based concept mining and its application to microarray data analysis. Intell Data Anal 9(1):59–82CrossRef Besson J, Robardet C, Boulicaut J, Rome S (2005) Constraint-based concept mining and its application to microarray data analysis. Intell Data Anal 9(1):59–82CrossRef
9.
Zurück zum Zitat Bogdanović M, Gligorijević MF, Veljković N, Puflović D, Stoimenov L (2023) Cross-portal metadata alignment-connecting open data portals through means of formal concept analysis. Inf Sci 118958 Bogdanović M, Gligorijević MF, Veljković N, Puflović D, Stoimenov L (2023) Cross-portal metadata alignment-connecting open data portals through means of formal concept analysis. Inf Sci 118958
10.
Zurück zum Zitat Bouasker S, Ben Yahia S, Diallo G (2019) An insight into biological datamining based on rarity and correlation as constraints. In: Hung C, Papadopoulos GA (eds) Proceedings of the 34th ACM/SIGAPP symposium on applied computing, SAC 2019, Limassol, Cyprus, April 8–12, 2019. ACM, pp 3–10. https://doi.org/10.1145/3297280.3297281 Bouasker S, Ben Yahia S, Diallo G (2019) An insight into biological datamining based on rarity and correlation as constraints. In: Hung C, Papadopoulos GA (eds) Proceedings of the 34th ACM/SIGAPP symposium on applied computing, SAC 2019, Limassol, Cyprus, April 8–12, 2019. ACM, pp 3–10. https://​doi.​org/​10.​1145/​3297280.​3297281
12.
Zurück zum Zitat Burgos-Salcedo J (2021) A comparative analysis of clinical stage 3 covid-19 vaccines using knowledge representation. medRxiv 2021–03 Burgos-Salcedo J (2021) A comparative analysis of clinical stage 3 covid-19 vaccines using knowledge representation. medRxiv 2021–03
15.
Zurück zum Zitat Madeira S, Oliveira LA (2004) Biclustering algorithms for biological data analysis: a survey. IEEE Trans Comput Biol Bioinform 1:24–45 Madeira S, Oliveira LA (2004) Biclustering algorithms for biological data analysis: a survey. IEEE Trans Comput Biol Bioinform 1:24–45
16.
Zurück zum Zitat Cheng Y, Church GM (2000) Biclustering of expression data. In: Proceedings of ISMB, UC San Diego, California, pp 93–103 Cheng Y, Church GM (2000) Biclustering of expression data. In: Proceedings of ISMB, UC San Diego, California, pp 93–103
17.
Zurück zum Zitat Daniel PB, Werner D, Martin G (2003) Practical approach to microarray data analysis Daniel PB, Werner D, Martin G (2003) Practical approach to microarray data analysis
18.
Zurück zum Zitat Ganter B, Wille R (1999) Formal concept analysis—mathematical foundations. Springer, Berlin Ganter B, Wille R (1999) Formal concept analysis—mathematical foundations. Springer, Berlin
20.
Zurück zum Zitat Ghosh M, Roy A, Mondal KC (2022) Fca-based constant and coherent-signed bicluster identification and its application in biodiversity study. In: Proceedings of international conference on advanced computing applications: ICACA 2021. Springer, pp 679–691 Ghosh M, Roy A, Mondal KC (2022) Fca-based constant and coherent-signed bicluster identification and its application in biodiversity study. In: Proceedings of international conference on advanced computing applications: ICACA 2021. Springer, pp 679–691
21.
Zurück zum Zitat Hao F, Min G, Pei Z, Park DS, Yang LT (2015) \(k\)-clique community detection in social networks based on formal concept analysis. IEEE Syst J 11(1):250–259ADSCrossRef Hao F, Min G, Pei Z, Park DS, Yang LT (2015) \(k\)-clique community detection in social networks based on formal concept analysis. IEEE Syst J 11(1):250–259ADSCrossRef
22.
Zurück zum Zitat Hao F, Park DS, Min G, Jeong YS, Park JH (2016) k-cliques mining in dynamic social networks based on triadic formal concept analysis. Neurocomputing 209:57–66CrossRef Hao F, Park DS, Min G, Jeong YS, Park JH (2016) k-cliques mining in dynamic social networks based on triadic formal concept analysis. Neurocomputing 209:57–66CrossRef
23.
Zurück zum Zitat Hao F, Sun Y, Lin Y (2022) Rough maximal cliques enumeration in incomplete graphs based on partially-known concept learning. Neurocomputing 496:96–106CrossRef Hao F, Sun Y, Lin Y (2022) Rough maximal cliques enumeration in incomplete graphs based on partially-known concept learning. Neurocomputing 496:96–106CrossRef
24.
Zurück zum Zitat Henriques R, Antunes C, Madeira SC (2013) Methods for the efficient discovery of large item-indexable sequential patterns. In: New Frontiers in Mining Complex Patterns - Second International Workshop, NFMCP 2013, Held in Conjunction with ECML-PKDD 2013, Prague, Czech Republic, September 27, 2013, Revised Selected Papers, pp. 100–116. https://doi.org/10.1007/978-3-319-08407-7_7 Henriques R, Antunes C, Madeira SC (2013) Methods for the efficient discovery of large item-indexable sequential patterns. In: New Frontiers in Mining Complex Patterns - Second International Workshop, NFMCP 2013, Held in Conjunction with ECML-PKDD 2013, Prague, Czech Republic, September 27, 2013, Revised Selected Papers, pp. 100–116. https://​doi.​org/​10.​1007/​978-3-319-08407-7_​7
31.
Zurück zum Zitat Houari A, Ayadi W, Ben Yahia S (2015) Discovering low overlapping biclusters in gene expression data through generic association rules. In: Bellatreche L, Manolopoulos Y (eds) Model and data engineering—5th international conference, MEDI 2015, Rhodes, Greece, September 26–28, 2015, Proceedings, lecture notes in computer science, vol 9344. Springer, pp 139–153. https://doi.org/10.1007/978-3-319-23781-7_12 Houari A, Ayadi W, Ben Yahia S (2015) Discovering low overlapping biclusters in gene expression data through generic association rules. In: Bellatreche L, Manolopoulos Y (eds) Model and data engineering—5th international conference, MEDI 2015, Rhodes, Greece, September 26–28, 2015, Proceedings, lecture notes in computer science, vol 9344. Springer, pp 139–153. https://​doi.​org/​10.​1007/​978-3-319-23781-7_​12
32.
Zurück zum Zitat Houari A, Ayadi W, Ben Yahia S (2017) Mining negative correlation biclusters from gene expression data using generic association rules. In: Zanni-Merk C, Frydman CS, Toro C, Hicks Y, Howlett RJ, Jain LC (eds) Knowledge-based and intelligent information & engineering systems: Proceedings of the 21st international conference KES-2017, Marseille, France, 6–8 September 2017, Procedia computer science, vol 112. Elsevier, pp 278–287. https://doi.org/10.1016/j.procs.2017.08.262 Houari A, Ayadi W, Ben Yahia S (2017) Mining negative correlation biclusters from gene expression data using generic association rules. In: Zanni-Merk C, Frydman CS, Toro C, Hicks Y, Howlett RJ, Jain LC (eds) Knowledge-based and intelligent information & engineering systems: Proceedings of the 21st international conference KES-2017, Marseille, France, 6–8 September 2017, Procedia computer science, vol 112. Elsevier, pp 278–287. https://​doi.​org/​10.​1016/​j.​procs.​2017.​08.​262
33.
Zurück zum Zitat Houari A, Ayadi W, Ben Yahia S (2018) NBF: an fca-based algorithm to identify negative correlation biclusters of DNA microarray data. In: Barolli L, Takizawa M, Enokido T, Ogiela MR, Ogiela L, Javaid N (eds) 32nd IEEE international conference on advanced information networking and applications, AINA 2018, Krakow, Poland, May 16–18, 2018. IEEE Computer Society, pp 1003–1010. https://doi.org/10.1109/AINA.2018.00146 Houari A, Ayadi W, Ben Yahia S (2018) NBF: an fca-based algorithm to identify negative correlation biclusters of DNA microarray data. In: Barolli L, Takizawa M, Enokido T, Ogiela MR, Ogiela L, Javaid N (eds) 32nd IEEE international conference on advanced information networking and applications, AINA 2018, Krakow, Poland, May 16–18, 2018. IEEE Computer Society, pp 1003–1010. https://​doi.​org/​10.​1109/​AINA.​2018.​00146
35.
Zurück zum Zitat Houari A, Ben Yahia S (2021) Top-k formal concepts for identifying positively and negatively correlated biclusters. In: Attiogbé JC, Yahia SB (eds) Model and data engineering—10th international conference, MEDI 2021, Tallinn, Estonia, June 21–23, 2021, Proceedings, lecture notes in computer science, vol 12732. Springer, pp 156–172. https://doi.org/10.1007/978-3-030-78428-7_13 Houari A, Ben Yahia S (2021) Top-k formal concepts for identifying positively and negatively correlated biclusters. In: Attiogbé JC, Yahia SB (eds) Model and data engineering—10th international conference, MEDI 2021, Tallinn, Estonia, June 21–23, 2021, Proceedings, lecture notes in computer science, vol 12732. Springer, pp 156–172. https://​doi.​org/​10.​1007/​978-3-030-78428-7_​13
36.
Zurück zum Zitat Hwang CL, Yoon K (1981) Methods for multiple attribute decision making. In: Multiple attribute decision making. Springer, pp 58–191 Hwang CL, Yoon K (1981) Methods for multiple attribute decision making. In: Multiple attribute decision making. Springer, pp 58–191
37.
Zurück zum Zitat Ignatov DI, Khvorykh GV, Khrunin AV, Nikolić S, Shaban M, Petrova EA, Koltsova EA, Takelait F, Egurnov D (2021) Object-attribute biclustering for elimination of missing genotypes in ischemic stroke genome-wide data. In: Recent trends in analysis of images, social networks and texts: 9th international conference, AIST 2020, Skolkovo, Moscow, Russia, October 15–16, 2020 revised supplementary Proceedings 9. Springer, pp 185–204 Ignatov DI, Khvorykh GV, Khrunin AV, Nikolić S, Shaban M, Petrova EA, Koltsova EA, Takelait F, Egurnov D (2021) Object-attribute biclustering for elimination of missing genotypes in ischemic stroke genome-wide data. In: Recent trends in analysis of images, social networks and texts: 9th international conference, AIST 2020, Skolkovo, Moscow, Russia, October 15–16, 2020 revised supplementary Proceedings 9. Springer, pp 185–204
38.
Zurück zum Zitat Iqbal N, Kumar P (2023) From data science to bioscience: emerging era of bioinformatics applications, tools and challenges. Procedia Comput Sci 218:1516–1528CrossRef Iqbal N, Kumar P (2023) From data science to bioscience: emerging era of bioinformatics applications, tools and challenges. Procedia Comput Sci 218:1516–1528CrossRef
40.
Zurück zum Zitat Juniarta N, Couceiro M, Napoli A (2019) A unified approach to biclustering based on formal concept analysis and interval pattern structure. In: Discovery science: 22nd international conference, DS 2019, Split, Croatia, October 28–30, 2019, Proceedings 22. Springer, pp 51–60 Juniarta N, Couceiro M, Napoli A (2019) A unified approach to biclustering based on formal concept analysis and interval pattern structure. In: Discovery science: 22nd international conference, DS 2019, Split, Croatia, October 28–30, 2019, Proceedings 22. Springer, pp 51–60
41.
Zurück zum Zitat Juniarta N, Couceiro M, Napoli A (2020) Order-preserving biclustering based on fca and pattern structures. In: Complex pattern mining Juniarta N, Couceiro M, Napoli A (2020) Order-preserving biclustering based on fca and pattern structures. In: Complex pattern mining
42.
Zurück zum Zitat Kataria S, Batra U (2022) Co-clustering neighborhood?based collaborative filtering framework using formal concept analysis. Int J Inf Technol 14(4):1725–1731 Kataria S, Batra U (2022) Co-clustering neighborhood?based collaborative filtering framework using formal concept analysis. Int J Inf Technol 14(4):1725–1731
44.
Zurück zum Zitat Kaytoue M, Kuznetsov SO, Napoli A (2011) Biclustering numerical data in formal concept analysis. In: Proceedings of ICFCA, Leuven, Belgium, pp 135–150 Kaytoue M, Kuznetsov SO, Napoli A (2011) Biclustering numerical data in formal concept analysis. In: Proceedings of ICFCA, Leuven, Belgium, pp 135–150
48.
Zurück zum Zitat Kuznetsov SO (2013) Fitting pattern structures to knowledge discovery in big data. In: Formal concept analysis: 11th international conference, ICFCA 2013, Dresden, Germany, May 21–24, 2013. Proceedings 11. Springer, pp 254–266 Kuznetsov SO (2013) Fitting pattern structures to knowledge discovery in big data. In: Formal concept analysis: 11th international conference, ICFCA 2013, Dresden, Germany, May 21–24, 2013. Proceedings 11. Springer, pp 254–266
49.
Zurück zum Zitat Kuznetsov SO, Makhazhanov N, Ushakov M (2017) On neural network architecture based on concept lattices. In: Foundations of intelligent systems: 23rd international symposium, ISMIS 2017, Warsaw, Poland, June 26–29, 2017, Proceedings 23. Springer, pp 653–663 Kuznetsov SO, Makhazhanov N, Ushakov M (2017) On neural network architecture based on concept lattices. In: Foundations of intelligent systems: 23rd international symposium, ISMIS 2017, Warsaw, Poland, June 26–29, 2017, Proceedings 23. Springer, pp 653–663
50.
Zurück zum Zitat Lehmann F, Wille R (1995) A triadic approach to formal concept analysis. In: Conceptual structures: applications, implementation and theory, third international conference on conceptual structures, ICCS ’95, Santa Cruz, California, USA, August 14–18, 1995, Proceedings, pp 32–43. https://doi.org/10.1007/3-540-60161-9_27 Lehmann F, Wille R (1995) A triadic approach to formal concept analysis. In: Conceptual structures: applications, implementation and theory, third international conference on conceptual structures, ICCS ’95, Santa Cruz, California, USA, August 14–18, 1995, Proceedings, pp 32–43. https://​doi.​org/​10.​1007/​3-540-60161-9_​27
51.
Zurück zum Zitat Li G, Ma Q, Tang H, Paterson AH, Xu Y (2009) Qubic: a qualitative biclustering algorithm for analyses of gene expression data. Nucl Acids Res gkp491 Li G, Ma Q, Tang H, Paterson AH, Xu Y (2009) Qubic: a qualitative biclustering algorithm for analyses of gene expression data. Nucl Acids Res gkp491
52.
Zurück zum Zitat Li J, Liu Q, Zeng T (2010) Negative correlations in collaboration: concepts and algorithms. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, Washington, DC, USA, July 25–28, 2010, pp 463–472. https://doi.org/10.1145/1835804.1835864 Li J, Liu Q, Zeng T (2010) Negative correlations in collaboration: concepts and algorithms. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, Washington, DC, USA, July 25–28, 2010, pp 463–472. https://​doi.​org/​10.​1145/​1835804.​1835864
53.
Zurück zum Zitat Luan Y, Li H (2003) Clustering of time-course gene expression data using a mixed-effects model with b-splines. Bioinformatics 19(4):474–482CrossRefPubMed Luan Y, Li H (2003) Clustering of time-course gene expression data using a mixed-effects model with b-splines. Bioinformatics 19(4):474–482CrossRefPubMed
56.
Zurück zum Zitat Mandal K, Sarmah R, Bhattacharyya DK (2020) Popbic: pathway-based order preserving biclustering algorithm towards the analysis of gene expression data. IEEE/ACM Trans Comput Biol Bioinform 18(6):2659–2670CrossRef Mandal K, Sarmah R, Bhattacharyya DK (2020) Popbic: pathway-based order preserving biclustering algorithm towards the analysis of gene expression data. IEEE/ACM Trans Comput Biol Bioinform 18(6):2659–2670CrossRef
58.
Zurück zum Zitat Mondal KC, Pasquier N (2014) Galois closure based association rule mining from biological data. In: Elloumi M, Zomaya AY (eds) Biological knowledge discovery handbook: preprocessing, mining, and postprocessing of biological data, pp 761–802 Mondal KC, Pasquier N (2014) Galois closure based association rule mining from biological data. In: Elloumi M, Zomaya AY (eds) Biological knowledge discovery handbook: preprocessing, mining, and postprocessing of biological data, pp 761–802
59.
Zurück zum Zitat Mouakher A, Ben Yahia S (2019) On the efficient stability computation for the selection of interesting formal concepts. Inf Sci 472:15–34CrossRef Mouakher A, Ben Yahia S (2019) On the efficient stability computation for the selection of interesting formal concepts. Inf Sci 472:15–34CrossRef
61.
Zurück zum Zitat Murali T, Kasif S (2002) Extracting conserved gene expression motifs from gene expression data. In: Biocomputing 2003. World Scientific, pp 77–88 Murali T, Kasif S (2002) Extracting conserved gene expression motifs from gene expression data. In: Biocomputing 2003. World Scientific, pp 77–88
65.
Zurück zum Zitat Peddada S, Lobenhofer E, Li L, Afshari C, Weinberg C (2003) Gene selection and clustering for time-course and dose-response microarray experiments using order-restricted inference. Bioinformatics 19:834–841CrossRefPubMed Peddada S, Lobenhofer E, Li L, Afshari C, Weinberg C (2003) Gene selection and clustering for time-course and dose-response microarray experiments using order-restricted inference. Bioinformatics 19:834–841CrossRefPubMed
66.
Zurück zum Zitat Pensa RG, Besson J, Boulicaut JF (2004) A methodology for biologically relevant pattern discovery from gene expression data. In: Proceedings of discovery science, pp 230–241 Pensa RG, Besson J, Boulicaut JF (2004) A methodology for biologically relevant pattern discovery from gene expression data. In: Proceedings of discovery science, pp 230–241
67.
Zurück zum Zitat Prelic A, Bleuler1 S, Zimmermann P, Wille A, Buhlmann P, Gruissem W, Hennig L, Thiele L, Zitzler E (2006) A systematic comparison and evaluation of biclustering methods for gene expression data. Bioinformatics 22(9):1122–1129 Prelic A, Bleuler1 S, Zimmermann P, Wille A, Buhlmann P, Gruissem W, Hennig L, Thiele L, Zitzler E (2006) A systematic comparison and evaluation of biclustering methods for gene expression data. Bioinformatics 22(9):1122–1129
68.
Zurück zum Zitat Roscoe S, Khatri M, Voshall A, Batra S, Kaur S, Deogun J (2022) Formal concept analysis applications in bioinformatics. ACM Comput Surv 55(8):1–40CrossRef Roscoe S, Khatri M, Voshall A, Batra S, Kaur S, Deogun J (2022) Formal concept analysis applications in bioinformatics. ACM Comput Surv 55(8):1–40CrossRef
69.
Zurück zum Zitat Roy S, Bhattacharyya DK, Kalita JK (2013) Cobi: pattern based co-regulated biclustering of gene expression data. Pattern Recognit Lett 34(14):1669–1678ADSCrossRef Roy S, Bhattacharyya DK, Kalita JK (2013) Cobi: pattern based co-regulated biclustering of gene expression data. Pattern Recognit Lett 34(14):1669–1678ADSCrossRef
70.
Zurück zum Zitat Trabelsi C, Jelassi, N, Ben Yahia S (2012) Scalable mining of frequent tri-concepts from folksonomies. In: Advances in knowledge discovery and data mining—16th Pacific–Asia conference, PAKDD 2012, Kuala Lumpur, Malaysia, May 29–June 1, 2012, Proceedings, Part II. Springer, pp 231–242. https://doi.org/10.1007/978-3-642-30220-6_20 Trabelsi C, Jelassi, N, Ben Yahia S (2012) Scalable mining of frequent tri-concepts from folksonomies. In: Advances in knowledge discovery and data mining—16th Pacific–Asia conference, PAKDD 2012, Kuala Lumpur, Malaysia, May 29–June 1, 2012, Proceedings, Part II. Springer, pp 231–242. https://​doi.​org/​10.​1007/​978-3-642-30220-6_​20
72.
Zurück zum Zitat Uno T, Asai T, Uchida Y, Arimura H (2004) An efficient algorithm for enumerating closed patterns in transaction databases. In: Discovery science, 7th international conference, DS 2004, Padova, Italy, October 2–5, 2004, Proceedings, pp 16–31. https://doi.org/10.1007/978-3-540-30214-8_2 Uno T, Asai T, Uchida Y, Arimura H (2004) An efficient algorithm for enumerating closed patterns in transaction databases. In: Discovery science, 7th international conference, DS 2004, Padova, Italy, October 2–5, 2004, Proceedings, pp 16–31. https://​doi.​org/​10.​1007/​978-3-540-30214-8_​2
73.
Zurück zum Zitat Wang H, Wang W, Yang J, Yu PS (2002) Clustering by pattern similarity in large data sets. In: Proceedings of the 2002 ACM SIGMOD international conference on management of data, Madison, Wisconsin, June 3–6, 2002, pp 394–405. https://doi.org/10.1145/564691.564737 Wang H, Wang W, Yang J, Yu PS (2002) Clustering by pattern similarity in large data sets. In: Proceedings of the 2002 ACM SIGMOD international conference on management of data, Madison, Wisconsin, June 3–6, 2002, pp 394–405. https://​doi.​org/​10.​1145/​564691.​564737
75.
Zurück zum Zitat Zeng T, Li J (2010) Maximization of negative correlations in time-course gene expression data for enhancing understanding of molecular pathways. Nucl Acids Res 38(1):e1ADSCrossRefPubMed Zeng T, Li J (2010) Maximization of negative correlations in time-course gene expression data for enhancing understanding of molecular pathways. Nucl Acids Res 38(1):e1ADSCrossRefPubMed
77.
Zurück zum Zitat Zhou H, Lin W, Labra SR, Lipton SA, Schork NJ, Rangan AV (2022) Detecting Boolean asymmetric relationships with a loop counting technique and its implications for analyzing heterogeneity within gene expression datasets. bioRxiv 2022–08 Zhou H, Lin W, Labra SR, Lipton SA, Schork NJ, Rangan AV (2022) Detecting Boolean asymmetric relationships with a loop counting technique and its implications for analyzing heterogeneity within gene expression datasets. bioRxiv 2022–08
Metadaten
Titel
A Top-K formal concepts-based algorithm for mining positive and negative correlation biclusters of DNA microarray data
verfasst von
Amina Houari
Sadok Ben Yahia
Publikationsdatum
12.09.2023
Verlag
Springer Berlin Heidelberg
Erschienen in
International Journal of Machine Learning and Cybernetics / Ausgabe 3/2024
Print ISSN: 1868-8071
Elektronische ISSN: 1868-808X
DOI
https://doi.org/10.1007/s13042-023-01949-9

Weitere Artikel der Ausgabe 3/2024

International Journal of Machine Learning and Cybernetics 3/2024 Zur Ausgabe

Neuer Inhalt