| pubmed-article:18337496 | rdf:type | pubmed:Citation | lld:pubmed |
| pubmed-article:18337496 | lifeskim:mentions | umls-concept:C1882365 | lld:lifeskim |
| pubmed-article:18337496 | lifeskim:mentions | umls-concept:C0439855 | lld:lifeskim |
| pubmed-article:18337496 | lifeskim:mentions | umls-concept:C0009085 | lld:lifeskim |
| pubmed-article:18337496 | lifeskim:mentions | umls-concept:C0185125 | lld:lifeskim |
| pubmed-article:18337496 | lifeskim:mentions | umls-concept:C1956267 | lld:lifeskim |
| pubmed-article:18337496 | lifeskim:mentions | umls-concept:C1552871 | lld:lifeskim |
| pubmed-article:18337496 | lifeskim:mentions | umls-concept:C2003862 | lld:lifeskim |
| pubmed-article:18337496 | lifeskim:mentions | umls-concept:C0205352 | lld:lifeskim |
| pubmed-article:18337496 | lifeskim:mentions | umls-concept:C2828393 | lld:lifeskim |
| pubmed-article:18337496 | pubmed:issue | 11 | lld:pubmed |
| pubmed-article:18337496 | pubmed:dateCreated | 2008-3-19 | lld:pubmed |
| pubmed-article:18337496 | pubmed:abstractText | Unraveling of the unified networking characteristics of complex networking phenomena is of great interest yet a formidable task. There is currently no simple strategy with a rigorous framework. Using an analogy to the exact algebraic property for a transition matrix of a master equation in statistical physics, we propose a method based on a Laplacian matrix for the discovery and prediction of new classes in the unsupervised complex networking phenomena where the class of each sample is completely unknown. Using this proposed Laplacian approach, we can simultaneously discover different classes and determine the identity of each class. Through an illustrative test of the Laplacian approach applied to real datasets of gene expression profiles, leukemia data [Golub TR, et al. (1999) Science 286:531-537], and lymphoma data [Alizadeh AA, et al. (2000) Nature 403:503-511], we demonstrate that this approach is accurate and robust with a mathematical and physical realization. It offers a general framework for characterizing any kind of complex networking phenomenon in broad areas irrespective of whether they are supervised or unsupervised. | lld:pubmed |
| pubmed-article:18337496 | pubmed:commentsCorrections | http://linkedlifedata.com/r... | lld:pubmed |
| pubmed-article:18337496 | pubmed:commentsCorrections | http://linkedlifedata.com/r... | lld:pubmed |
| pubmed-article:18337496 | pubmed:commentsCorrections | http://linkedlifedata.com/r... | lld:pubmed |
| pubmed-article:18337496 | pubmed:commentsCorrections | http://linkedlifedata.com/r... | lld:pubmed |
| pubmed-article:18337496 | pubmed:commentsCorrections | http://linkedlifedata.com/r... | lld:pubmed |
| pubmed-article:18337496 | pubmed:commentsCorrections | http://linkedlifedata.com/r... | lld:pubmed |
| pubmed-article:18337496 | pubmed:commentsCorrections | http://linkedlifedata.com/r... | lld:pubmed |
| pubmed-article:18337496 | pubmed:commentsCorrections | http://linkedlifedata.com/r... | lld:pubmed |
| pubmed-article:18337496 | pubmed:commentsCorrections | http://linkedlifedata.com/r... | lld:pubmed |
| pubmed-article:18337496 | pubmed:commentsCorrections | http://linkedlifedata.com/r... | lld:pubmed |
| pubmed-article:18337496 | pubmed:language | eng | lld:pubmed |
| pubmed-article:18337496 | pubmed:journal | http://linkedlifedata.com/r... | lld:pubmed |
| pubmed-article:18337496 | pubmed:citationSubset | IM | lld:pubmed |
| pubmed-article:18337496 | pubmed:status | MEDLINE | lld:pubmed |
| pubmed-article:18337496 | pubmed:month | Mar | lld:pubmed |
| pubmed-article:18337496 | pubmed:issn | 1091-6490 | lld:pubmed |
| pubmed-article:18337496 | pubmed:author | pubmed-author:ChangIksooI | lld:pubmed |
| pubmed-article:18337496 | pubmed:author | pubmed-author:KangMinhoM | lld:pubmed |
| pubmed-article:18337496 | pubmed:author | pubmed-author:KimChoongrakC | lld:pubmed |
| pubmed-article:18337496 | pubmed:author | pubmed-author:CheonMookyung... | lld:pubmed |
| pubmed-article:18337496 | pubmed:issnType | Electronic | lld:pubmed |
| pubmed-article:18337496 | pubmed:day | 18 | lld:pubmed |
| pubmed-article:18337496 | pubmed:volume | 105 | lld:pubmed |
| pubmed-article:18337496 | pubmed:owner | NLM | lld:pubmed |
| pubmed-article:18337496 | pubmed:authorsComplete | Y | lld:pubmed |
| pubmed-article:18337496 | pubmed:pagination | 4083-7 | lld:pubmed |
| pubmed-article:18337496 | pubmed:dateRevised | 2010-9-22 | lld:pubmed |
| pubmed-article:18337496 | pubmed:meshHeading | pubmed-meshheading:18337496... | lld:pubmed |
| pubmed-article:18337496 | pubmed:meshHeading | pubmed-meshheading:18337496... | lld:pubmed |
| pubmed-article:18337496 | pubmed:meshHeading | pubmed-meshheading:18337496... | lld:pubmed |
| pubmed-article:18337496 | pubmed:year | 2008 | lld:pubmed |
| pubmed-article:18337496 | pubmed:articleTitle | A simple and exact Laplacian clustering of complex networking phenomena: application to gene expression profiles. | lld:pubmed |
| pubmed-article:18337496 | pubmed:affiliation | Department of Statistics, National Research Laboratory for Computational Proteomics and Biophysics, Pusan National University, Busan 609-735, Korea. | lld:pubmed |
| pubmed-article:18337496 | pubmed:publicationType | Journal Article | lld:pubmed |
| pubmed-article:18337496 | pubmed:publicationType | Research Support, Non-U.S. Gov't | lld:pubmed |
