Finding high-order correlations in high-dimensional biological data

Xiang Zhang, Feng Pan, Wei Wang

Research output: Chapter in Book/Report/Conference proceedingChapter

3 Citations (Scopus)

Abstract

In many emerging real-life problems, the number of dimensions in the data sets can be from thousands to millions. The large number of features poses great challenge to existing high-dimensional data analysis methods. One particular issue is that the latent patterns may only exist in subspaces of the full-dimensional space. In this chapter, we discuss the problem of finding correlations hidden in feature subspaces. Both linear and nonlinear cases will be discussed. We present efficient algorithms for finding such correlated feature subsets.

Original languageEnglish (US)
Title of host publicationLink Mining
Subtitle of host publicationModels, Algorithms, and Applications
PublisherSpringer New York
Pages505-534
Number of pages30
Volume9781441965158
ISBN (Electronic)9781441965158
ISBN (Print)9781441965141
DOIs
StatePublished - Jan 1 2010

Fingerprint

Datasets

All Science Journal Classification (ASJC) codes

  • Medicine(all)

Cite this

Zhang, X., Pan, F., & Wang, W. (2010). Finding high-order correlations in high-dimensional biological data. In Link Mining: Models, Algorithms, and Applications (Vol. 9781441965158, pp. 505-534). Springer New York. https://doi.org/10.1007/978-1-4419-6515-8-19
Zhang, Xiang ; Pan, Feng ; Wang, Wei. / Finding high-order correlations in high-dimensional biological data. Link Mining: Models, Algorithms, and Applications. Vol. 9781441965158 Springer New York, 2010. pp. 505-534
@inbook{95c6e2a9b5a44653ab289a59955eacc0,
title = "Finding high-order correlations in high-dimensional biological data",
abstract = "In many emerging real-life problems, the number of dimensions in the data sets can be from thousands to millions. The large number of features poses great challenge to existing high-dimensional data analysis methods. One particular issue is that the latent patterns may only exist in subspaces of the full-dimensional space. In this chapter, we discuss the problem of finding correlations hidden in feature subspaces. Both linear and nonlinear cases will be discussed. We present efficient algorithms for finding such correlated feature subsets.",
author = "Xiang Zhang and Feng Pan and Wei Wang",
year = "2010",
month = "1",
day = "1",
doi = "10.1007/978-1-4419-6515-8-19",
language = "English (US)",
isbn = "9781441965141",
volume = "9781441965158",
pages = "505--534",
booktitle = "Link Mining",
publisher = "Springer New York",
address = "United States",

}

Zhang, X, Pan, F & Wang, W 2010, Finding high-order correlations in high-dimensional biological data. in Link Mining: Models, Algorithms, and Applications. vol. 9781441965158, Springer New York, pp. 505-534. https://doi.org/10.1007/978-1-4419-6515-8-19

Finding high-order correlations in high-dimensional biological data. / Zhang, Xiang; Pan, Feng; Wang, Wei.

Link Mining: Models, Algorithms, and Applications. Vol. 9781441965158 Springer New York, 2010. p. 505-534.

Research output: Chapter in Book/Report/Conference proceedingChapter

TY - CHAP

T1 - Finding high-order correlations in high-dimensional biological data

AU - Zhang, Xiang

AU - Pan, Feng

AU - Wang, Wei

PY - 2010/1/1

Y1 - 2010/1/1

N2 - In many emerging real-life problems, the number of dimensions in the data sets can be from thousands to millions. The large number of features poses great challenge to existing high-dimensional data analysis methods. One particular issue is that the latent patterns may only exist in subspaces of the full-dimensional space. In this chapter, we discuss the problem of finding correlations hidden in feature subspaces. Both linear and nonlinear cases will be discussed. We present efficient algorithms for finding such correlated feature subsets.

AB - In many emerging real-life problems, the number of dimensions in the data sets can be from thousands to millions. The large number of features poses great challenge to existing high-dimensional data analysis methods. One particular issue is that the latent patterns may only exist in subspaces of the full-dimensional space. In this chapter, we discuss the problem of finding correlations hidden in feature subspaces. Both linear and nonlinear cases will be discussed. We present efficient algorithms for finding such correlated feature subsets.

UR - http://www.scopus.com/inward/record.url?scp=84919847059&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84919847059&partnerID=8YFLogxK

U2 - 10.1007/978-1-4419-6515-8-19

DO - 10.1007/978-1-4419-6515-8-19

M3 - Chapter

AN - SCOPUS:84919847059

SN - 9781441965141

VL - 9781441965158

SP - 505

EP - 534

BT - Link Mining

PB - Springer New York

ER -

Zhang X, Pan F, Wang W. Finding high-order correlations in high-dimensional biological data. In Link Mining: Models, Algorithms, and Applications. Vol. 9781441965158. Springer New York. 2010. p. 505-534 https://doi.org/10.1007/978-1-4419-6515-8-19