{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T07:39:19Z","timestamp":1768635559396,"version":"3.49.0"},"reference-count":49,"publisher":"Oxford University Press (OUP)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["jcomplexnetw"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1093\/comnet\/cnv025","type":"journal-article","created":{"date-parts":[[2015,10,28]],"date-time":"2015-10-28T01:59:19Z","timestamp":1445997559000},"page":"342-362","source":"Crossref","is-referenced-by-count":20,"title":["Quantifying loss of information in network-based dimensionality reduction techniques"],"prefix":"10.1093","volume":"4","author":[{"given":"Hector","family":"Zenil","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Narsis A.","family":"Kiani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesper","family":"Tegn\u00e9r","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2015,10,26]]},"reference":[{"key":"2016082507534124000_4.3.342.1","doi-asserted-by":"crossref","unstructured":"Albert R. & Barab\u00e1si A.-L. (2002) Statistical mechanics of complex networks. Rev. Mod. Phys., 74.","DOI":"10.1103\/RevModPhys.74.47"},{"key":"2016082507534124000_4.3.342.2","doi-asserted-by":"publisher","DOI":"10.1080\/00018730110112519"},{"key":"2016082507534124000_4.3.342.3","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.036104"},{"key":"2016082507534124000_4.3.342.4","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"2016082507534124000_4.3.342.5","unstructured":"Alon U. (2007) Collection of Complex Networks Uri Alon Homepage 2007. http:\/\/www.weizmann.ac.il\/mcb\/UriAlon\/groupNetworksData.html (accessed on July 2013)."},{"key":"2016082507534124000_4.3.342.6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1177\/117693510600200004","article-title":"Challenges in the analysis of mass-throughput data: a technical commentary from the statistical machine learning perspective","volume":"2","author":"Aliferis","year":"2006","journal-title":"Cancer Inform."},{"key":"2016082507534124000_4.3.342.7","first-page":"1","article-title":"Three approaches to the quantitative definition of information","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Probl. Inform. Transm."},{"key":"2016082507534124000_4.3.342.8","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(64)90131-7"},{"key":"2016082507534124000_4.3.342.9","unstructured":"Li M. & Vit\u00e1nyi P. (2009) An Introduction to Kolmogorov Complexity and its Applications. 3rd edn. Berlin, Heidelberg, New York: Springer."},{"key":"2016082507534124000_4.3.342.10","unstructured":"Calude C. S. (2010) Information and Randomness: An Algorithmic Perspective, 2nd edn. EATCS Series. Berlin, Heidelberg, New York: Springer."},{"key":"2016082507534124000_4.3.342.11","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2014.02.060"},{"key":"2016082507534124000_4.3.342.12","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0096223"},{"key":"2016082507534124000_4.3.342.13","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0016431"},{"key":"2016082507534124000_4.3.342.14","doi-asserted-by":"crossref","unstructured":"Ivakhno S. & Armstrong J. D. (2007) Non-linear dimensionality reduction of signaling networks. BMC Syst. Biol., 1\u201327.","DOI":"10.1186\/1752-0509-1-27"},{"key":"2016082507534124000_4.3.342.15","doi-asserted-by":"crossref","unstructured":"Albrecht M. , Kerren A. , Klein K. , Kohlbacher O. , Mutzel P. , Paul W. , Schreiber F. & Wybrow M. (2010) On open problems in biological network visualization. Graph Drawing. Lecture Notes in Computer Science (D. Eppstein & E. Gansner eds), vol. 5849. Berlin, Heidelberg: Springer, pp. 256\u2013267.","DOI":"10.1007\/978-3-642-11805-0_25"},{"key":"2016082507534124000_4.3.342.16","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl038"},{"key":"2016082507534124000_4.3.342.17","doi-asserted-by":"crossref","unstructured":"Spielman D. A. & Srivastava N. (2008) Graph sparsification by effective resistances. Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing (STOC'08), pp. 563\u2013568.","DOI":"10.1145\/1374376.1374456"},{"key":"2016082507534124000_4.3.342.18","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"key":"2016082507534124000_4.3.342.19","first-page":"122","article-title":"Artificial gene networks for objective comparison of analysis algorithms","volume":"19","author":"Mendes","year":"2003","journal-title":"ECCB"},{"key":"2016082507534124000_4.3.342.20","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"2016082507534124000_4.3.342.21","unstructured":"Zenil H. , Kiani N. A. & Tegn\u00e9r J. (2014) Methods of information theory and algorithmic complexity for network biology. Seminars in Cell and Developmental Biology (forthcoming)."},{"key":"2016082507534124000_4.3.342.22","doi-asserted-by":"publisher","DOI":"10.1126\/science.1089167"},{"key":"2016082507534124000_4.3.342.23","doi-asserted-by":"crossref","unstructured":"Gundert A. & Wagne U. (2012) On Laplacians of random complexes. Proceedings of the ACM Symposium on Computational Geometry, SoCG.","DOI":"10.1145\/2261250.2261272"},{"key":"2016082507534124000_4.3.342.24","doi-asserted-by":"crossref","unstructured":"Knabe J. F. (2013) Computational Genetic Regulatory Networks: Evolvable, Self-organizing Systems. Berlin, Heidelberg, New York: Springer.","DOI":"10.1007\/978-3-642-30296-1"},{"key":"2016082507534124000_4.3.342.25","doi-asserted-by":"publisher","DOI":"10.1016\/j.biosystems.2008.05.012"},{"key":"2016082507534124000_4.3.342.26","doi-asserted-by":"publisher","DOI":"10.1038\/ng881"},{"key":"2016082507534124000_4.3.342.27","doi-asserted-by":"publisher","DOI":"10.1145\/2492007.2492029"},{"key":"2016082507534124000_4.3.342.28","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti1110"},{"key":"2016082507534124000_4.3.342.29","doi-asserted-by":"publisher","DOI":"10.1186\/1752-0509-3-25"},{"key":"2016082507534124000_4.3.342.30","doi-asserted-by":"publisher","DOI":"10.1038\/35019019"},{"key":"2016082507534124000_4.3.342.31","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0701175104"},{"key":"2016082507534124000_4.3.342.32","doi-asserted-by":"publisher","DOI":"10.1038\/nphys1746"},{"key":"2016082507534124000_4.3.342.33","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(89)90044-5"},{"key":"2016082507534124000_4.3.342.34","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/MAHC.1985.10011","article-title":"On the history of the minimum spanning tree problem","volume":"1","author":"Graham","year":"1985","journal-title":"Ann. Hist. Comput."},{"key":"2016082507534124000_4.3.342.35","doi-asserted-by":"publisher","DOI":"10.1137\/08074489X"},{"key":"2016082507534124000_4.3.342.36","doi-asserted-by":"publisher","DOI":"10.1137\/0201008"},{"key":"2016082507534124000_4.3.342.37","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.06.033"},{"key":"2016082507534124000_4.3.342.38","doi-asserted-by":"crossref","first-page":"112","DOI":"10.13001\/1081-3810.1428","article-title":"Graphs determined by their (signless) Laplacian spectra","volume":"22","author":"Liu","year":"2011","journal-title":"Electron. J. Linear Algebra"},{"key":"2016082507534124000_4.3.342.39","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pbio.0020328"},{"key":"2016082507534124000_4.3.342.40","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"2016082507534124000_4.3.342.41","first-page":"206","article-title":"Laws of information conservation (non-growth) and aspects of the foundation of probability theory","volume":"10","author":"Levin","year":"1974","journal-title":"Probl. Inform. Transm."},{"key":"2016082507534124000_4.3.342.42","doi-asserted-by":"publisher","DOI":"10.1145\/321356.321363"},{"key":"2016082507534124000_4.3.342.43","doi-asserted-by":"publisher","DOI":"10.1016\/0167-2789(86)90237-X"},{"key":"2016082507534124000_4.3.342.44","unstructured":"Cover T. M. & Thomas J. A. (2009) Elements of Information Theory. 2nd edn. Wiley-Blackwell."},{"key":"2016082507534124000_4.3.342.45","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2011.10.006"},{"key":"2016082507534124000_4.3.342.46","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1962.tb00480.x"},{"key":"2016082507534124000_4.3.342.47","doi-asserted-by":"crossref","first-page":"125","DOI":"10.3233\/COM-13019","article-title":"Correspondence and independence of numerical evaluations of algorithmic information measures","volume":"2","author":"Soler-Toscano","year":"2013","journal-title":"Computability"},{"key":"2016082507534124000_4.3.342.48","unstructured":"Zenil H. , Soler-Toscano F. , Delahaye J.-P. & Gauvrit N. (2013) Two-dimensional Kolmogorov complexity and validation of the coding theorem method by compressibility."},{"key":"2016082507534124000_4.3.342.49","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth436"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/4\/3\/342\/6716257\/cnv025.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T11:59:47Z","timestamp":1599739187000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article-lookup\/doi\/10.1093\/comnet\/cnv025"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,26]]},"references-count":49,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2016,8,25]]},"published-print":{"date-parts":[[2016,9]]}},"alternative-id":["10.1093\/comnet\/cnv025"],"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnv025","relation":{},"ISSN":["2051-1310","2051-1329"],"issn-type":[{"value":"2051-1310","type":"print"},{"value":"2051-1329","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,26]]}}}