MITree
MITree applies a matrix incision tree (MIT) geometric hierarchical clustering algorithm to organize and reduce dimensionality of high-dimensional gene expression data from DNA microarrays.
Key Features:
- Geometric-Based Clustering: Uses the matrix incision tree (MIT) algorithm to exploit geometric properties of data for hierarchical clustering without requiring prior knowledge.
- Hierarchical Structural Organization: Identifies successive hyperplanes that partition the data hyperspace to reveal hierarchical relationships and enable successive refinement of clusters.
- Adaptability to High-Dimensional Data: Organizes complex high-dimensional gene expression spaces, such as DNA microarray datasets, into lower-dimensional representations while preserving essential structural information.
Scientific Applications:
- Gene Expression Analysis: Analysis of gene expression data obtained from DNA microarrays to detect structure and associations among genes.
- Knowledge Discovery and Predictive Modeling: Extraction of hierarchical patterns from expression data to support knowledge discovery and the construction of predictive models.
- Functional Genomics and Translational Research: Exploration of hierarchical gene associations to inform studies in functional genomics, disease research, and personalized medicine.
Methodology:
Application of the matrix incision tree algorithm to identify hyperplanes that separate the data into clusters, reducing dimensionality while preserving structural information through hierarchical refinement.
Topics
Details
- Tool Type:
- desktop application
- Operating Systems:
- Windows
- Added:
- 12/18/2017
- Last Updated:
- 11/25/2024
Operations
Publications
Kim JH, Ohno-Machado L, Kohane IS. UNSUPERVISED LEARNING FROM COMPLEX DATA: THE MATRIX INCISION TREE ALGORITHM. Biocomputing 2001. 2000. doi:10.1142/9789814447362_0004. PMID:11262950.
PMID: 11262950