Exploring high dimensional data with Butterfly: a novel classification algorithm based on discrete dynamical systems
Motivation: We introduce a novel method for visualizing high dimensional data via a discrete dynamical system. This method provides a 2D representation of the relationship between subjects according to a set of variables without geometric projections, transformed axes or principal components. The al...
Saved in:
Published in | Bioinformatics Vol. 30; no. 5; pp. 712 - 718 |
---|---|
Main Authors | , , , , , , |
Format | Journal Article |
Language | English |
Published |
England
01.03.2014
|
Subjects | |
Online Access | Get full text |
ISSN | 1367-4803 1367-4811 1367-4811 1460-2059 |
DOI | 10.1093/bioinformatics/btt602 |
Cover
Abstract | Motivation: We introduce a novel method for visualizing high dimensional data via a discrete dynamical system. This method provides a 2D representation of the relationship between subjects according to a set of variables without geometric projections, transformed axes or principal components. The algorithm exploits a memory-type mechanism inherent in a certain class of discrete dynamical systems collectively referred to as the chaos game that are closely related to iterative function systems. The goal of the algorithm was to create a human readable representation of high dimensional patient data that was capable of detecting unrevealed subclusters of patients from within anticipated classifications. This provides a mechanism to further pursue a more personalized exploration of pathology when used with medical data. For clustering and classification protocols, the dynamical system portion of the algorithm is designed to come after some feature selection filter and before some model evaluation (e.g. clustering accuracy) protocol. In the version given here, a univariate features selection step is performed (in practice more complex feature selection methods are used), a discrete dynamical system is driven by this reduced set of variables (which results in a set of 2D cluster models), these models are evaluated for their accuracy (according to a user-defined binary classification) and finally a visual representation of the top classification models are returned. Thus, in addition to the visualization component, this methodology can be used for both supervised and unsupervised machine learning as the top performing models are returned in the protocol we describe here.
Results: Butterfly, the algorithm we introduce and provide working code for, uses a discrete dynamical system to classify high dimensional data and provide a 2D representation of the relationship between subjects. We report results on three datasets (two in the article; one in the appendix) including a public lung cancer dataset that comes along with the included Butterfly R package. In the included R script, a univariate feature selection method is used for the dimension reduction step, but in the future we wish to use a more powerful multivariate feature reduction method based on neural networks (Kriesel, 2007).
Availability and implementation: A script written in R (designed to run on R studio) accompanies this article that implements this algorithm and is available at http://butterflygeraci.codeplex.com/. For details on the R package or for help installing the software refer to the accompanying document, Supporting Material and Appendix.
Contact: geraci.joseph@gmail.com
Supplementary information: Supplementary data are available at Bioinformatics online. |
---|---|
AbstractList | We introduce a novel method for visualizing high dimensional data via a discrete dynamical system. This method provides a 2D representation of the relationship between subjects according to a set of variables without geometric projections, transformed axes or principal components. The algorithm exploits a memory-type mechanism inherent in a certain class of discrete dynamical systems collectively referred to as the chaos game that are closely related to iterative function systems. The goal of the algorithm was to create a human readable representation of high dimensional patient data that was capable of detecting unrevealed subclusters of patients from within anticipated classifications. This provides a mechanism to further pursue a more personalized exploration of pathology when used with medical data. For clustering and classification protocols, the dynamical system portion of the algorithm is designed to come after some feature selection filter and before some model evaluation (e.g. clustering accuracy) protocol. In the version given here, a univariate features selection step is performed (in practice more complex feature selection methods are used), a discrete dynamical system is driven by this reduced set of variables (which results in a set of 2D cluster models), these models are evaluated for their accuracy (according to a user-defined binary classification) and finally a visual representation of the top classification models are returned. Thus, in addition to the visualization component, this methodology can be used for both supervised and unsupervised machine learning as the top performing models are returned in the protocol we describe here.MOTIVATIONWe introduce a novel method for visualizing high dimensional data via a discrete dynamical system. This method provides a 2D representation of the relationship between subjects according to a set of variables without geometric projections, transformed axes or principal components. The algorithm exploits a memory-type mechanism inherent in a certain class of discrete dynamical systems collectively referred to as the chaos game that are closely related to iterative function systems. The goal of the algorithm was to create a human readable representation of high dimensional patient data that was capable of detecting unrevealed subclusters of patients from within anticipated classifications. This provides a mechanism to further pursue a more personalized exploration of pathology when used with medical data. For clustering and classification protocols, the dynamical system portion of the algorithm is designed to come after some feature selection filter and before some model evaluation (e.g. clustering accuracy) protocol. In the version given here, a univariate features selection step is performed (in practice more complex feature selection methods are used), a discrete dynamical system is driven by this reduced set of variables (which results in a set of 2D cluster models), these models are evaluated for their accuracy (according to a user-defined binary classification) and finally a visual representation of the top classification models are returned. Thus, in addition to the visualization component, this methodology can be used for both supervised and unsupervised machine learning as the top performing models are returned in the protocol we describe here.Butterfly, the algorithm we introduce and provide working code for, uses a discrete dynamical system to classify high dimensional data and provide a 2D representation of the relationship between subjects. We report results on three datasets (two in the article; one in the appendix) including a public lung cancer dataset that comes along with the included Butterfly R package. In the included R script, a univariate feature selection method is used for the dimension reduction step, but in the future we wish to use a more powerful multivariate feature reduction method based on neural networks (Kriesel, 2007).RESULTSButterfly, the algorithm we introduce and provide working code for, uses a discrete dynamical system to classify high dimensional data and provide a 2D representation of the relationship between subjects. We report results on three datasets (two in the article; one in the appendix) including a public lung cancer dataset that comes along with the included Butterfly R package. In the included R script, a univariate feature selection method is used for the dimension reduction step, but in the future we wish to use a more powerful multivariate feature reduction method based on neural networks (Kriesel, 2007).A script written in R (designed to run on R studio) accompanies this article that implements this algorithm and is available at http://butterflygeraci.codeplex.com/. For details on the R package or for help installing the software refer to the accompanying document, Supporting Material and Appendix.AVAILABILITY AND IMPLEMENTATIONA script written in R (designed to run on R studio) accompanies this article that implements this algorithm and is available at http://butterflygeraci.codeplex.com/. For details on the R package or for help installing the software refer to the accompanying document, Supporting Material and Appendix. We introduce a novel method for visualizing high dimensional data via a discrete dynamical system. This method provides a 2D representation of the relationship between subjects according to a set of variables without geometric projections, transformed axes or principal components. The algorithm exploits a memory-type mechanism inherent in a certain class of discrete dynamical systems collectively referred to as the chaos game that are closely related to iterative function systems. The goal of the algorithm was to create a human readable representation of high dimensional patient data that was capable of detecting unrevealed subclusters of patients from within anticipated classifications. This provides a mechanism to further pursue a more personalized exploration of pathology when used with medical data. For clustering and classification protocols, the dynamical system portion of the algorithm is designed to come after some feature selection filter and before some model evaluation (e.g. clustering accuracy) protocol. In the version given here, a univariate features selection step is performed (in practice more complex feature selection methods are used), a discrete dynamical system is driven by this reduced set of variables (which results in a set of 2D cluster models), these models are evaluated for their accuracy (according to a user-defined binary classification) and finally a visual representation of the top classification models are returned. Thus, in addition to the visualization component, this methodology can be used for both supervised and unsupervised machine learning as the top performing models are returned in the protocol we describe here. Butterfly, the algorithm we introduce and provide working code for, uses a discrete dynamical system to classify high dimensional data and provide a 2D representation of the relationship between subjects. We report results on three datasets (two in the article; one in the appendix) including a public lung cancer dataset that comes along with the included Butterfly R package. In the included R script, a univariate feature selection method is used for the dimension reduction step, but in the future we wish to use a more powerful multivariate feature reduction method based on neural networks (Kriesel, 2007). A script written in R (designed to run on R studio) accompanies this article that implements this algorithm and is available at http://butterflygeraci.codeplex.com/. For details on the R package or for help installing the software refer to the accompanying document, Supporting Material and Appendix. Motivation:We introduce a novel method for visualizing high dimensional data via a discrete dynamical system. This method provides a 2D representation of the relationship between subjects according to a set of variables without geometric projections, transformed axes or principal components. The algorithm exploits a memory-type mechanism inherent in a certain class of discrete dynamical systems collectively referred to as the chaos game that are closely related to iterative function systems. The goal of the algorithm was to create a human readable representation of high dimensional patient data that was capable of detecting unrevealed subclusters of patients from within anticipated classifications. This provides a mechanism to further pursue a more personalized exploration of pathology when used with medical data. For clustering and classification protocols, the dynamical system portion of the algorithm is designed to come after some feature selection filter and before some model evaluation (e.g. clustering accuracy) protocol. In the version given here, a univariate features selection step is performed (in practice more complex feature selection methods are used), a discrete dynamical system is driven by this reduced set of variables (which results in a set of 2D cluster models), these models are evaluated for their accuracy (according to a user-defined binary classification) and finally a visual representation of the top classification models are returned. Thus, in addition to the visualization component, this methodology can be used for both supervised and unsupervised machine learning as the top performing models are returned in the protocol we describe here.Results:Butterfly, the algorithm we introduce and provide working code for, uses a discrete dynamical system to classify high dimensional data and provide a 2D representation of the relationship between subjects. We report results on three datasets (two in the article; one in the appendix) including a public lung cancer dataset that comes along with the included Butterfly R package. In the included R script, a univariate feature selection method is used for the dimension reduction step, but in the future we wish to use a more powerful multivariate feature reduction method based on neural networks (Kriesel, 2007). Motivation: We introduce a novel method for visualizing high dimensional data via a discrete dynamical system. This method provides a 2D representation of the relationship between subjects according to a set of variables without geometric projections, transformed axes or principal components. The algorithm exploits a memory-type mechanism inherent in a certain class of discrete dynamical systems collectively referred to as the chaos game that are closely related to iterative function systems. The goal of the algorithm was to create a human readable representation of high dimensional patient data that was capable of detecting unrevealed subclusters of patients from within anticipated classifications. This provides a mechanism to further pursue a more personalized exploration of pathology when used with medical data. For clustering and classification protocols, the dynamical system portion of the algorithm is designed to come after some feature selection filter and before some model evaluation (e.g. clustering accuracy) protocol. In the version given here, a univariate features selection step is performed (in practice more complex feature selection methods are used), a discrete dynamical system is driven by this reduced set of variables (which results in a set of 2D cluster models), these models are evaluated for their accuracy (according to a user-defined binary classification) and finally a visual representation of the top classification models are returned. Thus, in addition to the visualization component, this methodology can be used for both supervised and unsupervised machine learning as the top performing models are returned in the protocol we describe here. Results: Butterfly, the algorithm we introduce and provide working code for, uses a discrete dynamical system to classify high dimensional data and provide a 2D representation of the relationship between subjects. We report results on three datasets (two in the article; one in the appendix) including a public lung cancer dataset that comes along with the included Butterfly R package. In the included R script, a univariate feature selection method is used for the dimension reduction step, but in the future we wish to use a more powerful multivariate feature reduction method based on neural networks (Kriesel, 2007). Availability and implementation: A script written in R (designed to run on R studio) accompanies this article that implements this algorithm and is available at http://butterflygeraci.codeplex.com/. For details on the R package or for help installing the software refer to the accompanying document, Supporting Material and Appendix. Contact: geraci.joseph@gmail.com Supplementary information: Supplementary data are available at Bioinformatics online. |
Author | Nuin, Paulo Dharsee, Moyez Evans, Ken Geraci, Joseph Haslehurst, Alexandria Feilotter, Harriet E. Koti, Madhuri |
Author_xml | – sequence: 1 givenname: Joseph surname: Geraci fullname: Geraci, Joseph – sequence: 2 givenname: Moyez surname: Dharsee fullname: Dharsee, Moyez – sequence: 3 givenname: Paulo surname: Nuin fullname: Nuin, Paulo – sequence: 4 givenname: Alexandria surname: Haslehurst fullname: Haslehurst, Alexandria – sequence: 5 givenname: Madhuri surname: Koti fullname: Koti, Madhuri – sequence: 6 givenname: Harriet E. surname: Feilotter fullname: Feilotter, Harriet E. – sequence: 7 givenname: Ken surname: Evans fullname: Evans, Ken |
BackLink | https://www.ncbi.nlm.nih.gov/pubmed/24149051$$D View this record in MEDLINE/PubMed |
BookMark | eNqNkUtLQzEQhYMoPqo_QcnSTTWPm9tWV1p8QcGNri-5yaSN5CY1SdX-e1Orgm50NcPwnTPDnD206YMHhA4pOaFkxE9bG6w3IXYyW5VO25xrwjbQLuX1oF8NKd387gnfQXspPRFCBBH1NtphFa1GRNBdlK_e5i5E66d4ZqczrG0HPtngpcNaZolfbZ7hy0XOEI1bnmGJfXgBh5WTKVljVdkfPJZuWlzyrMOtTKBxGWmbVIQMWC-97ArocFqmDF3aR1tGugQHn7WHHq-vHsa3_cn9zd34YtJXFWO5L7ikYEYtFaTSsuVDZsAwM2JaVUpwIxQxRAk1EGwFaT1UrOXKUMEJ1C3hPXS89p3H8LyAlJuu3ATOSQ9hkRpaD6ioeC0Gf6OCV0PGGP0PSnh5NSvOPXT0iS7aDnQzj7aTcdl8_b8AYg2oGFKKYL4RSppVzs3PnJt1zkV3_kunbP5IIkdp3R_qd8AVuB4 |
CitedBy_id | crossref_primary_10_1016_j_compbiomed_2017_08_031 crossref_primary_10_1186_1471_2164_15_S12_S10 crossref_primary_10_1155_2015_676129 crossref_primary_10_1371_journal_pone_0111318 crossref_primary_10_1038_s41590_024_01952_4 |
Cites_doi | 10.1007/b98888 10.1186/1748-7188-7-10 10.1186/1748-7188-7-12 10.1093/bib/bbk007 10.1016/0022-2836(92)90857-G 10.4061/2009/869093 10.1371/journal.pone.0011022 10.1093/bioinformatics/btp711 10.1186/1471-2105-7-243 10.1016/S1093-3263(97)00106-X 10.7150/jca.1.14 10.4137/CIN.S9037 10.1002/wics.101 10.1093/nar/18.8.2163 10.1002/9781118032879 10.1016/j.jcma.2012.04.015 10.1198/jasa.2011.tm10314 10.1016/j.cub.2007.10.019 10.1145/1412734.1412738 |
ContentType | Journal Article |
DBID | AAYXX CITATION CGR CUY CVF ECM EIF NPM 7X8 7QO 7TM 8FD FR3 P64 7SC JQ2 L7M L~C L~D |
DOI | 10.1093/bioinformatics/btt602 |
DatabaseName | CrossRef Medline MEDLINE MEDLINE (Ovid) MEDLINE MEDLINE PubMed MEDLINE - Academic Biotechnology Research Abstracts Nucleic Acids Abstracts Technology Research Database Engineering Research Database Biotechnology and BioEngineering Abstracts Computer and Information Systems Abstracts ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
DatabaseTitle | CrossRef MEDLINE Medline Complete MEDLINE with Full Text PubMed MEDLINE (Ovid) MEDLINE - Academic Engineering Research Database Biotechnology Research Abstracts Technology Research Database Nucleic Acids Abstracts Biotechnology and BioEngineering Abstracts Computer and Information Systems Abstracts Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
DatabaseTitleList | MEDLINE - Academic MEDLINE Computer and Information Systems Abstracts CrossRef Engineering Research Database |
Database_xml | – sequence: 1 dbid: NPM name: PubMed url: https://proxy.k.utb.cz/login?url=http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 2 dbid: EIF name: MEDLINE url: https://proxy.k.utb.cz/login?url=https://www.webofscience.com/wos/medline/basic-search sourceTypes: Index Database |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Biology |
EISSN | 1367-4811 1460-2059 |
EndPage | 718 |
ExternalDocumentID | 24149051 10_1093_bioinformatics_btt602 |
Genre | Research Support, Non-U.S. Gov't Journal Article |
GroupedDBID | --- -E4 -~X .2P .DC .I3 0R~ 1TH 23N 2WC 4.4 48X 53G 5GY 5WA 70D AAIJN AAIMJ AAJKP AAJQQ AAKPC AAMDB AAMVS AAOGV AAPQZ AAPXW AAUQX AAVAP AAVLN AAYXX ABEJV ABEUO ABGNP ABIXL ABNKS ABPQP ABPTD ABQLI ABWST ABXVV ABZBJ ACGFS ACIWK ACPRK ACUFI ACUXJ ACYTK ADBBV ADEYI ADEZT ADFTL ADGKP ADGZP ADHKW ADHZD ADMLS ADOCK ADPDF ADRDM ADRTK ADVEK ADYVW ADZTZ ADZXQ AECKG AEGPL AEJOX AEKKA AEKSI AELWJ AEMDU AENEX AENZO AEPUE AETBJ AEWNT AFFZL AFGWE AFIYH AFOFC AFRAH AGINJ AGKEF AGQXC AGSYK AHMBA AHXPO AIJHB AJEEA AJEUX AKHUL AKWXX ALMA_UNASSIGNED_HOLDINGS ALTZX ALUQC AMNDL APIBT APWMN ARIXL ASPBG AVWKF AXUDD AYOIW AZVOD BAWUL BAYMD BHONS BQDIO BQUQU BSWAC BTQHN C45 CDBKE CITATION CS3 CZ4 DAKXR DIK DILTD DU5 D~K EBD EBS EE~ EJD EMOBN F5P F9B FEDTE FHSFR FLIZI FLUFQ FOEOM FQBLK GAUVT GJXCC GROUPED_DOAJ GX1 H13 H5~ HAR HW0 HZ~ IOX J21 JXSIZ KAQDR KOP KQ8 KSI KSN M-Z MK~ ML0 N9A NGC NLBLG NMDNZ NOMLY NU- NVLIB O9- OAWHX ODMLO OJQWA OK1 OVD OVEED P2P PAFKI PEELM PQQKQ Q1. Q5Y R44 RD5 RNS ROL RPM RUSNO RW1 RXO SV3 TEORI TJP TLC TOX TR2 W8F WOQ X7H YAYTL YKOAZ YXANX ZKX ~91 ~KM ABQTQ CGR CUY CVF ECM EIF M49 NPM 7X8 482 7QO 7TM 8FD ABJNI FR3 P64 ROZ TN5 WH7 7SC JQ2 L7M L~C L~D |
ID | FETCH-LOGICAL-c422t-53a1ef9b1504dab382fef2f92dc4c53f5c0f0c5c7529b15dd8c2b3cf1530e6b03 |
ISSN | 1367-4803 1367-4811 |
IngestDate | Thu Sep 04 17:03:24 EDT 2025 Fri Sep 05 12:06:51 EDT 2025 Fri Jul 11 10:15:08 EDT 2025 Thu Apr 03 06:55:57 EDT 2025 Tue Jul 01 03:27:09 EDT 2025 Thu Apr 24 23:06:37 EDT 2025 |
IsDoiOpenAccess | false |
IsOpenAccess | true |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 5 |
Language | English |
LinkModel | OpenURL |
MergedId | FETCHMERGED-LOGICAL-c422t-53a1ef9b1504dab382fef2f92dc4c53f5c0f0c5c7529b15dd8c2b3cf1530e6b03 |
Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
OpenAccessLink | https://academic.oup.com/bioinformatics/article-pdf/30/5/712/17147092/btt602.pdf |
PMID | 24149051 |
PQID | 1503000254 |
PQPubID | 23479 |
PageCount | 7 |
ParticipantIDs | proquest_miscellaneous_1671543657 proquest_miscellaneous_1534822217 proquest_miscellaneous_1503000254 pubmed_primary_24149051 crossref_primary_10_1093_bioinformatics_btt602 crossref_citationtrail_10_1093_bioinformatics_btt602 |
ProviderPackageCode | CITATION AAYXX |
PublicationCentury | 2000 |
PublicationDate | 2014-03-01 2014-Mar-01 20140301 |
PublicationDateYYYYMMDD | 2014-03-01 |
PublicationDate_xml | – month: 03 year: 2014 text: 2014-03-01 day: 01 |
PublicationDecade | 2010 |
PublicationPlace | England |
PublicationPlace_xml | – name: England |
PublicationTitle | Bioinformatics |
PublicationTitleAlternate | Bioinformatics |
PublicationYear | 2014 |
References | Fawcett (2023012710430775100_btt602-B8) 2008; 10 Ramsay (2023012710430775100_btt602-B19) 2005 GSE18842 (2023012710430775100_btt602-B11) 2010 Gomez-Ferreria (2023012710430775100_btt602-B9) 2007; 17 GSE10245 (2023012710430775100_btt602-B10) 2009 Shang (2023012710430775100_btt602-B21) 2013 Ultsch (2023012710430775100_btt602-B23) 2002 Wolfram (2023012710430775100_btt602-B25) 2002 Jeffrey (2023012710430775100_btt602-B13) 1990; 18 Dutta (2023012710430775100_btt602-B7) 1992; 228 Zhou (2023012710430775100_btt602-B27) 2012; 75 Vinga (2023012710430775100_btt602-B24) 2012; 7 Almeida (2023012710430775100_btt602-B2) 2012; 7 Lu (2023012710430775100_btt602-B17) 2010; 5 Barnsley (2023012710430775100_btt602-B4) 2006 Martelli (2023012710430775100_btt602-B18) 1999 Abdi (2023012710430775100_btt602-B1) 2010; 2 Kriesel (2023012710430775100_btt602-B15) 2007 Sahab (2023012710430775100_btt602-B20) 2010; 1 Larraaga (2023012710430775100_btt602-B16) 2006; 7 Joseph (2023012710430775100_btt602-B14) 2006; 7 Chen (2023012710430775100_btt602-B6) 2011; 106 Basu (2023012710430775100_btt602-B5) 1997; 15 Ultsch (2023012710430775100_btt602-B22) 2000 Wu (2023012710430775100_btt602-B26) 2010; 26 Hamid (2023012710430775100_btt602-B12) 2009 Andreopoulos (2023012710430775100_btt602-B3) 2012; 11 |
References_xml | – volume-title: Functional Data Analysis year: 2005 ident: 2023012710430775100_btt602-B19 doi: 10.1007/b98888 – volume: 7 start-page: 10 year: 2012 ident: 2023012710430775100_btt602-B24 article-title: Pattern matching through chaos game representation: bridging numerical and discrete data structures for biological sequence analysis publication-title: Algorithms Mol. Biol. doi: 10.1186/1748-7188-7-10 – volume: 7 start-page: 12 year: 2012 ident: 2023012710430775100_btt602-B2 article-title: Fractal mapreduce decomposition of sequence alignment publication-title: Algorithms Mol. Biol doi: 10.1186/1748-7188-7-12 – volume: 7 start-page: 86 year: 2006 ident: 2023012710430775100_btt602-B16 article-title: Machine learning in bioinformatics publication-title: Brief Bioinform doi: 10.1093/bib/bbk007 – volume: 228 start-page: 715 year: 1992 ident: 2023012710430775100_btt602-B7 article-title: Mathematical characterization of chaos game representation. new algorithms for nucleotide sequence analysis publication-title: J. Mol. Biol. doi: 10.1016/0022-2836(92)90857-G – year: 2009 ident: 2023012710430775100_btt602-B12 article-title: Data integration in genetics and genomics: methods and challenges publication-title: Hum. Genomics Proteomics doi: 10.4061/2009/869093 – volume-title: Proceedings of European Meeting of Cybernetics and Systems Research year: 2000 ident: 2023012710430775100_btt602-B22 article-title: An artificial life approach to data mining – volume-title: Super Fractals year: 2006 ident: 2023012710430775100_btt602-B4 – volume-title: A New Kind of Science year: 2002 ident: 2023012710430775100_btt602-B25 – volume: 5 start-page: e11022 year: 2010 ident: 2023012710430775100_btt602-B17 article-title: Evidence that sox2 overexpression is oncogenic in the lung publication-title: PLoS One doi: 10.1371/journal.pone.0011022 – volume: 26 start-page: 509 year: 2010 ident: 2023012710430775100_btt602-B26 article-title: Functional embedding for the classification of gene expression profiles publication-title: Bioinformatics doi: 10.1093/bioinformatics/btp711 – volume: 7 start-page: 243 year: 2006 ident: 2023012710430775100_btt602-B14 article-title: Chaos game representation for comparison of whole genomes publication-title: BMC Bioinformatics doi: 10.1186/1471-2105-7-243 – volume: 15 start-page: 279 year: 1997 ident: 2023012710430775100_btt602-B5 article-title: Chaos game representation of proteins publication-title: J. Mol. Graph Model. doi: 10.1016/S1093-3263(97)00106-X – volume-title: A survey of functional principal component analysis year: 2013 ident: 2023012710430775100_btt602-B21 – start-page: 191 volume-title: Proceedings of Fifth German Workshop on Artificial Life year: 2002 ident: 2023012710430775100_btt602-B23 article-title: Data mining as an application for artificial life – volume: 1 start-page: 14 year: 2010 ident: 2023012710430775100_btt602-B20 article-title: Tumor suppressor rarres1 regulates dlg2, pp2a, vcp, eb1, and ankrd26 publication-title: J. Cancer doi: 10.7150/jca.1.14 – year: 2010 ident: 2023012710430775100_btt602-B11 – volume: 11 start-page: 61 year: 2012 ident: 2023012710430775100_btt602-B3 article-title: Integrated analysis reveals hsa-mir-142 as a representative of a lymphocyte-specific gene expression and methylation signature publication-title: Cancer Inform. doi: 10.4137/CIN.S9037 – volume: 2 start-page: 433 year: 2010 ident: 2023012710430775100_btt602-B1 article-title: Principal component analysis publication-title: Wiley Interdiscip. Rev. Comput. Stat. doi: 10.1002/wics.101 – volume: 18 start-page: 2163 year: 1990 ident: 2023012710430775100_btt602-B13 article-title: Chaos game representation of gene structure publication-title: Nucleic Acids Res. doi: 10.1093/nar/18.8.2163 – volume-title: A Brief Introduction to Neural Networks year: 2007 ident: 2023012710430775100_btt602-B15 – volume-title: Introduction to Discrete Dynamical Systems and Chaos year: 1999 ident: 2023012710430775100_btt602-B18 doi: 10.1002/9781118032879 – volume: 75 start-page: 296 year: 2012 ident: 2023012710430775100_btt602-B27 article-title: Significance of trim29 and β-catenin expression in non-small-cell lung cancer publication-title: J. Chin. Med. Assoc. doi: 10.1016/j.jcma.2012.04.015 – year: 2009 ident: 2023012710430775100_btt602-B10 – volume: 106 start-page: 275 year: 2011 ident: 2023012710430775100_btt602-B6 article-title: Stringing high-dimensional data for functional analysis publication-title: J. Am. Stat. Assoc. doi: 10.1198/jasa.2011.tm10314 – volume: 17 start-page: 1960 year: 2007 ident: 2023012710430775100_btt602-B9 article-title: Human cep192 is required for mitotic centrosome and spindle assembly publication-title: Curr. Biol. doi: 10.1016/j.cub.2007.10.019 – volume: 10 start-page: 32 year: 2008 ident: 2023012710430775100_btt602-B8 article-title: Data mining with cellular automata publication-title: ACM SIGKDD Explor. Newslett doi: 10.1145/1412734.1412738 |
SSID | ssj0005056 ssj0051444 |
Score | 2.1459968 |
Snippet | Motivation: We introduce a novel method for visualizing high dimensional data via a discrete dynamical system. This method provides a 2D representation of the... We introduce a novel method for visualizing high dimensional data via a discrete dynamical system. This method provides a 2D representation of the relationship... Motivation:We introduce a novel method for visualizing high dimensional data via a discrete dynamical system. This method provides a 2D representation of the... |
SourceID | proquest pubmed crossref |
SourceType | Aggregation Database Index Database Enrichment Source |
StartPage | 712 |
SubjectTerms | Algorithms Artificial Intelligence Classification Classification - methods Cluster Analysis Computer Graphics Dynamical systems Female Gene Expression Profiling Humans Lung Neoplasms - classification Lung Neoplasms - genetics Mathematical models Models, Theoretical Ovarian Neoplasms - classification Ovarian Neoplasms - genetics Packages Representations Scripts Software Two dimensional |
Title | Exploring high dimensional data with Butterfly: a novel classification algorithm based on discrete dynamical systems |
URI | https://www.ncbi.nlm.nih.gov/pubmed/24149051 https://www.proquest.com/docview/1503000254 https://www.proquest.com/docview/1534822217 https://www.proquest.com/docview/1671543657 |
Volume | 30 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
journalDatabaseRights | – providerCode: PRVAFT databaseName: Open Access Digital Library customDbUrl: eissn: 1367-4811 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0005056 issn: 1367-4803 databaseCode: KQ8 dateStart: 19960101 isFulltext: true titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html providerName: Colorado Alliance of Research Libraries – providerCode: PRVEBS databaseName: Inspec with Full Text customDbUrl: eissn: 1367-4811 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0005056 issn: 1367-4803 databaseCode: ADMLS dateStart: 19980101 isFulltext: true titleUrlDefault: https://www.ebsco.com/products/research-databases/inspec-full-text providerName: EBSCOhost – providerCode: PRVBFR databaseName: Free Medical Journals - Free Access to All customDbUrl: eissn: 1367-4811 dateEnd: 20241001 omitProxy: true ssIdentifier: ssj0005056 issn: 1367-4803 databaseCode: DIK dateStart: 19960101 isFulltext: true titleUrlDefault: http://www.freemedicaljournals.com providerName: Flying Publisher – providerCode: PRVFQY databaseName: GFMER Free Medical Journals customDbUrl: eissn: 1367-4811 dateEnd: 20241001 omitProxy: true ssIdentifier: ssj0005056 issn: 1367-4803 databaseCode: GX1 dateStart: 19960101 isFulltext: true titleUrlDefault: http://www.gfmer.ch/Medical_journals/Free_medical.php providerName: Geneva Foundation for Medical Education and Research – providerCode: PRVAQN databaseName: PubMed Central customDbUrl: eissn: 1367-4811 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0005056 issn: 1367-4803 databaseCode: RPM dateStart: 20070101 isFulltext: true titleUrlDefault: https://www.ncbi.nlm.nih.gov/pmc/ providerName: National Library of Medicine – providerCode: PRVOVD databaseName: Journals@Ovid LWW All Open Access Journal Collection Rolling customDbUrl: eissn: 1367-4811 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0005056 issn: 1367-4803 databaseCode: OVEED dateStart: 20010101 isFulltext: true titleUrlDefault: http://ovidsp.ovid.com/ providerName: Ovid – providerCode: PRVASL databaseName: Oxford Journals Open Access Collection customDbUrl: eissn: 1367-4811 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0005056 issn: 1367-4803 databaseCode: TOX dateStart: 19850101 isFulltext: true titleUrlDefault: https://academic.oup.com/journals/ providerName: Oxford University Press – providerCode: PRVASL databaseName: Oxford Journals Open Access Collection customDbUrl: eissn: 1367-4811 dateEnd: 20220930 omitProxy: true ssIdentifier: ssj0005056 issn: 1367-4803 databaseCode: TOX dateStart: 19850101 isFulltext: true titleUrlDefault: https://academic.oup.com/journals/ providerName: Oxford University Press |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lj9MwELbKIiQuiPcuLxmJW9RuaufJDSFghQRculJvUfwIrZRNVt0E0f0j_F1mYsdJBLs8LlHl2EmT-TKesWe-IeRVGiUp2N16HsF0PA8wRzcRgGUmQvCBcs140UX5fo5OToOP63A9m_0YRS21jVjIy9_mlfyPVKEN5IpZsv8gWXdRaIDfIF84goTh-FcyHgLokHXYU8jUb1g2PIz8NIusthR1uTd5zVX9TZeeRKMZo4SM_PPyK1yn2Zx5OKsp3EHAdN0dWNSeMjXrMa9kxG7e7wNva0u92tE9I3fp9z5c3tYHGa01fNC7XG5HGw-9Fb0B99pEBH2q9_rSrVC3huEAwxfrQVdelHrT7kyyik3QMcHSbv1iGQwBXAttdC5H6vXE6lyrlO1mzXa87d1p2NhEXf-i-Q0rlpg8NTY0TeRPRsDLPj_rAAHGS4D0ZMNU6AIU-1M3yE0WRxGWxlh9WQ-xQ2A29ulgKT-e3vXY3BNppu1VpjbPFY5MZ9Cs7pI71hOhbwys7pGZru6TW6Y26f4BaRy4KIKLjsBFEVwUwUUduF7TnHbQolNoUQct2kGLQlMPLeqgRS20HpLT9-9Wb0_mtkTHXAaMNfOQ50tdpALcikDlgies0AUrUqZkIEP4zqVf-DKUcciwk1KJZILLAuZZX0fC54_IQVVX-pDQQvA8BukyufQDLePUT5TUKiyUTmXiyyMS9C8xk5a_HsuolJmJo-DZVAyZEcMRWbhh54bA5U8DXvYSykDV4v5ZXum6vcjgIbnf0Udc1wfZohg4-tf0iWJwXHgUQp_HBgLur_WQeXLlmafk9vAZPSMHza7Vz8EwbsSLDqQ_AY_5xOY |
linkProvider | Oxford University Press |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Exploring+high+dimensional+data+with+Butterfly%3A+a+novel+classification+algorithm+based+on+discrete+dynamical+systems&rft.jtitle=Bioinformatics+%28Oxford%2C+England%29&rft.au=Geraci%2C+Joseph&rft.au=Dharsee%2C+Moyez&rft.au=Nuin%2C+Paulo&rft.au=Haslehurst%2C+Alexandria&rft.date=2014-03-01&rft.eissn=1367-4811&rft.volume=30&rft.issue=5&rft.spage=712&rft_id=info:doi/10.1093%2Fbioinformatics%2Fbtt602&rft_id=info%3Apmid%2F24149051&rft.externalDocID=24149051 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1367-4803&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1367-4803&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1367-4803&client=summon |