{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T06:59:52Z","timestamp":1742799592260,"version":"3.35.0"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,7,1]],"date-time":"2008-07-01T00:00:00Z","timestamp":1214870400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1007\/s11390-008-9152-9","type":"journal-article","created":{"date-parts":[[2008,8,6]],"date-time":"2008-08-06T22:26:42Z","timestamp":1218061602000},"page":"557-572","source":"Crossref","is-referenced-by-count":17,"title":["New Information Distance Measure and Its Application in Question Answering System"],"prefix":"10.1007","volume":"23","author":[{"given":"Xian","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Hao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao-Yan","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,8,5]]},"reference":[{"key":"9152_CR1","doi-asserted-by":"crossref","unstructured":"Tan P N, Kumar V, Srivastava J. Selecting the right interestingness measure for association patterns. In Proc. SIGKDD\u201902, Edmonton, Alberta, Canada, pp.32\u201344.","DOI":"10.1145\/775047.775053"},{"key":"9152_CR2","doi-asserted-by":"crossref","unstructured":"Bennett C H, Gacs P, Li M, Vit\u00e1nyi P, Zurek W. Information distance. IEEE Trans. Inform. Theory (STOC\u201993), July 1998, 44(4): 1407\u20131423.","DOI":"10.1109\/18.681318"},{"issue":"2","key":"9152_CR3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1093\/bioinformatics\/17.2.149","volume":"17","author":"M Li","year":"2001","unstructured":"Li M, Badger J, Chen X, Kwong S, Kearney P, Zhang H. An information-based sequence distance and its application to whole mitochondrial genome phylogeny. Bioinformatics, 2001, 17(2): 149\u2013154.","journal-title":"Bioinformatics"},{"issue":"12","key":"9152_CR4","doi-asserted-by":"crossref","first-page":"3250","DOI":"10.1109\/TIT.2004.838101","volume":"50","author":"M Li","year":"2004","unstructured":"Li M, Chen X, Li X, Ma B, Vit\u00e1nyi P. The similarity metric. IEEE Trans. Information Theory, 2004, 50(12): 3250\u20133264.","journal-title":"IEEE Trans. Information Theory"},{"key":"9152_CR5","doi-asserted-by":"crossref","unstructured":"Li M, Vit\u00e1nyi P. An Introduction to Kolmogorov Complexity and Its Applications. 2nd Edition, Springer-Verlag, 1997.","DOI":"10.1007\/978-1-4757-2606-0"},{"key":"9152_CR6","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0304-3975(01)00037-8","volume":"271","author":"M V V\u2019yugin","year":"2002","unstructured":"V\u2019yugin M V. Information distance and conditional complexities. Theoret. Comput. Sci., 2002, 271: 145\u2013150.","journal-title":"Theoret. Comput. Sci."},{"key":"9152_CR7","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0304-3975(01)00036-6","volume":"271","author":"N K Vereshchagin","year":"2002","unstructured":"Vereshchagin N K, V\u2019yugin M V. Independent minimum length programs to translate between given strings. Theoret. Comput. Sci., 2002, 271: 131\u2013143.","journal-title":"Theoret. Comput. Sci."},{"key":"9152_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0304-3975(01)00035-4","volume":"271","author":"A K Shen","year":"2002","unstructured":"Shen A K, Vereshchagin N K. Logical operations and Kolmogorov complexity. Theoret. Comput. Sci., 2002, 271: 125\u2013129.","journal-title":"Theoret. Comput. Sci."},{"key":"9152_CR9","doi-asserted-by":"crossref","unstructured":"An A Muchnik, N Vereshchagin. Shannon entropy vs. Kolmogorov complexity. In Porc. First International Computer Science Symposium in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, pp.281\u2013191.","DOI":"10.1007\/11753728_29"},{"issue":"1","key":"9152_CR10","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0304-3975(01)00033-0","volume":"271","author":"A Muchnik An","year":"2002","unstructured":"Muchnik An A. Conditional complexity and codes. Theoretical Computer Science, 2002, 271(1): 97\u2013109.","journal-title":"Theoretical Computer Science"},{"key":"9152_CR11","doi-asserted-by":"crossref","unstructured":"Muchnik An A, Vereshchagin N K. Logical operations and Kolmogorov complexity II. In Proc. 16th Conf. Comput. Complexity, Chicago, USA, 2001, pp.256\u2013265.","DOI":"10.1109\/CCC.2001.933892"},{"key":"9152_CR12","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0304-3975(01)00032-9","volume":"271","author":"A V Chernov","year":"2002","unstructured":"Chernov A V, Muchnik An A, Romashchenko A E, Shen A K, Vereshchagin N K. Upper semi-lattice of binary strings with the relation \u201cx is simple conditional to y\u201d. Theoret. Comput. Sci., 2002, 271: 69\u201395.","journal-title":"Theoret. Comput. Sci."},{"key":"9152_CR13","doi-asserted-by":"crossref","unstructured":"Keogh E J, Lonardi S, Ratanamahatana C A. Towards parameter-free data mining. In Proc. KDD\u20192004, Seattle, WA, USA, pp. 206\u2013215.","DOI":"10.1145\/1014052.1014077"},{"issue":"4","key":"9152_CR14","doi-asserted-by":"crossref","first-page":"048702","DOI":"10.1103\/PhysRevLett.88.048702","volume":"88","author":"D Benedetto","year":"2002","unstructured":"Benedetto D, Caglioti E, Loreto V. Language trees and zipping. Phys. Rev. Lett., 2002, 88(4): 048702.","journal-title":"Phys. Rev. Lett."},{"issue":"7","key":"9152_CR15","doi-asserted-by":"crossref","first-page":"1545","DOI":"10.1109\/TIT.2004.830793","volume":"50","author":"X Chen","year":"2004","unstructured":"Chen X, Francia B, Li M, Mckinnon B, Seker A. Shared information and program plagiarism detection. IEEE Trans. Information Theory, July 2004, 50(7): 1545\u20131550.","journal-title":"IEEE Trans. Information Theory"},{"issue":"4","key":"9152_CR16","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1162\/0148926042728449","volume":"28","author":"R Cilibrasi","year":"2004","unstructured":"R Cilibrasi, P M B Vit\u00e1nyi, R de Wolf. Algorithmic clustring of music based on string compression. Comput. Music J., 2004, 28(4): 49\u201367.","journal-title":"Comput. Music J."},{"issue":"3","key":"9152_CR17","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1109\/TKDE.2007.48","volume":"19","author":"R Cilibrasi","year":"2007","unstructured":"Cilibrasi R, Vit\u00e1nyi P M B. The Google similarity distance. IEEE Trans. Knowledge and Data Engineering, 2007, 19(3): 370\u2013383.","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"issue":"4","key":"9152_CR18","doi-asserted-by":"crossref","first-page":"1111","DOI":"10.1016\/j.neunet.2005.07.010","volume":"18","author":"M Cuturi","year":"2005","unstructured":"Cuturi M, Vert J P. The context-tree kernel for strings. Neural Networks, 2005, 18(4): 1111\u20131123.","journal-title":"Neural Networks"},{"key":"9152_CR19","doi-asserted-by":"crossref","unstructured":"Emanuel K, Ravela S, Vivant E, Risi C. A combined statistical-deterministic approach of hurricane risk assessment. Manuscript, Program in Atmospheres, Oceans, and Climate, MIT, 2005.","DOI":"10.1175\/BAMS-87-3-299"},{"key":"9152_CR20","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0164-1212(03)00217-6","volume":"72","author":"S R Kirk","year":"2004","unstructured":"Kirk S R, Jenkins S. Information theory-based software metrics and obfuscation. J. Systems and Software, 2004, 72: 179\u2013186.","journal-title":"J. Systems and Software"},{"issue":"2","key":"9152_CR21","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1209\/epl\/i2004-10483-y","volume":"70","author":"A Kraskov","year":"2005","unstructured":"Kraskov A, St\u00f6gbauer H, Andrzejak R G, Grassberger P. Hierarchical clustering using mutual information. Europhys. Lett., 2005, 70(2): 278\u2013284.","journal-title":"Europhys. Lett."},{"issue":"4","key":"9152_CR22","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1093\/bioinformatics\/bti806","volume":"22","author":"A Kocsor","year":"2006","unstructured":"Kocsor A, Kertesz-Farkas A, Kajan L, Pongor S. Application of compression-based distance measures to protein sequence classification: A methodology study. Bioinformatics, 2006, 22(4): 407\u2013412.","journal-title":"Bioinformatics"},{"issue":"7","key":"9152_CR23","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1093\/bioinformatics\/bth031","volume":"20","author":"N Krasnogor","year":"2004","unstructured":"Krasnogor N, Pelta D A. Measuring the similarity of protein structures by means of the universal similarity metric. Bioinformatics, 2004, 20(7): 1015\u20131021.","journal-title":"Bioinformatics"},{"key":"9152_CR24","unstructured":"Taha W, Crosby S, Swadi K. A new approach to data mining for software design. Manuscript. Rice Univ. 2006."},{"issue":"6","key":"9152_CR25","doi-asserted-by":"crossref","first-page":"2122","DOI":"10.1093\/bioinformatics\/btg295","volume":"19","author":"H H Otu","year":"2003","unstructured":"Otu H H, Sayood K. A new sequence distance measure for phylogenetic tree construction. Bioinformatics 2003, 19(6): 2122\u20132130.","journal-title":"Bioinformatics"},{"key":"9152_CR26","unstructured":"Pao H K, Case J. Computing entropy for ortholog detection. In Proc. Int. Conf. Comput. Intell., Dec. 17\u201319, 2004, pp.89\u201392."},{"key":"9152_CR27","unstructured":"Parry D. Use of Kolmogorov distance identification of web page authorship, topic and domain. In Proc. Workshop on Open Source Web Inf. Retrieval, Compi\u00e8gne, France, 2005, pp.47\u201350."},{"key":"9152_CR28","doi-asserted-by":"crossref","unstructured":"Santos C C, Bernardes J, Vit\u00e1nyi P M B, Antunes L. Clustering fetal heart rate tracings by compression. In Proc. 19th IEEE Int. Symp. Computer-Based Medical Systems, Salt Lake City, Utah, June 22\u201323, 2006, pp.685\u2013690.","DOI":"10.1109\/CBMS.2006.68"},{"key":"9152_CR29","unstructured":"Arbuckle T, Balaban A, Peters D K, Lawford M. Software documents: Comparison and measurement. In Proc. SEKE2007, Boston, USA, July 9\u201311, 2007, pp.740\u2013748."},{"issue":"1","key":"9152_CR30","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1080\/10635150590905984","volume":"54","author":"C An\u00e9","year":"2005","unstructured":"An\u00e9 C, Sanderson M J. Missing the forest for the trees: Phylogenetic compression and its implications for inferring complex evolutionary histories. Systematic Biology, 2005, 54(1): 146\u2013157.","journal-title":"Systematic Biology"},{"issue":"4","key":"9152_CR31","doi-asserted-by":"crossref","first-page":"1523","DOI":"10.1109\/TIT.2005.844059","volume":"51","author":"R Cilibrasi","year":"2005","unstructured":"Cilibrasi R, Vit\u00e1nyi P M B, Clustering by compression. IEEE Trans. Inform. Theory, 2005, 51(4): 1523\u20131545.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9152_CR32","doi-asserted-by":"crossref","unstructured":"Zhang X, Hao Y, Zhu X, Li M. Information distance from a question to an answer. In Proc. 13th ACM SIGKDD, San Jose, California, USA, 2007, pp.874\u2013883.","DOI":"10.1145\/1281192.1281285"},{"issue":"4","key":"9152_CR33","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1142\/S0129054107004905","volume":"18","author":"M Li","year":"2007","unstructured":"Li M. Information distance and its applications. Int. J. Found. Comput. Sci., 2007, 18(4): 669\u2013681.","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"6","key":"9152_CR34","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1038\/scientificamerican0603-76","volume":"288","author":"C H Bennett","year":"2003","unstructured":"Bennett C H, Li M, Ma B. Chain letters and evolutionary histories. Scientific American, June 2003, feature article, 288(6): 76\u201381.","journal-title":"Scientific American"},{"key":"9152_CR35","doi-asserted-by":"crossref","unstructured":"Siebes A, Struzik Z. Complex Data: Mining using patterns. In Proc. the ESF Exploratory Workshop on Pattern Detection and Discovery, London, 2002, pp.24\u201335.","DOI":"10.1007\/3-540-45728-3_3"},{"issue":"3","key":"9152_CR36","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1023\/A:1008023416823","volume":"28","author":"R Fagin","year":"1998","unstructured":"Fagin R, Stockmeyer L. Relaxing the triangle inequality in pattern matching. Int. J. Comput. Vision, 1998, 28(3): 219\u2013231.","journal-title":"Int. J. Comput. Vision"},{"key":"9152_CR37","doi-asserted-by":"crossref","unstructured":"Veltkamp R C. Shape matching: Similarity measures and algorithms. In Proc. Int. Conf. Shape Modeling Applications, Italy, Invited talk, 2001, pp.188\u2013197.","DOI":"10.1109\/SMA.2001.923389"},{"key":"9152_CR38","unstructured":"Lin J. The web as a resource for question answering: Perspectives and challenges. In Proc. 3rd Int. Conf. Language Resources and Evolution, Las Palmas, Spain, May, 2002."},{"key":"9152_CR39","doi-asserted-by":"crossref","unstructured":"Clarke C, Cormack G V, Kemkes G, Laszlo M, Lynam T R, Terra E L, Tilker P L. Statistical selection of exact answers (multitext experiments for TREC 2002). Report, University of Waterloo, 2002.","DOI":"10.6028\/NIST.SP.500-251.qa-waterloo"},{"issue":"2","key":"9152_CR40","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/1046456.1046460","volume":"6","author":"P Cimiano","year":"2004","unstructured":"Cimiano P, Staab S. Learning by googling. ACM SIGKDD Explorations Newsletter, 2004, 6(2): 24\u201333.","journal-title":"ACM SIGKDD Explorations Newsletter"},{"key":"9152_CR41","doi-asserted-by":"crossref","unstructured":"Lin J, Katz B. Question answering from the web using knowledge annotation and knowledge mining techniques. In Proc. 12th Int. CIKM, New Orleans, Louisiana, USA, 2003, pp.116\u2013123.","DOI":"10.1145\/956863.956886"},{"key":"9152_CR42","doi-asserted-by":"crossref","unstructured":"Li X, Roth D. Learning question classifiers. In Proc. COLING\u201902, Taipei, Taiwan, China, 2002, pp.556\u2013562.","DOI":"10.3115\/1072228.1072378"},{"key":"9152_CR43","unstructured":"Chang C C, Lin C J. LIBSVM: A library for support vector machines. 2001, http:\/\/www.csie.ntu.edu.tw\/~cjlin\/libsvm ."},{"key":"9152_CR44","doi-asserted-by":"crossref","unstructured":"Tsuruoka Y, Tsujii J. Bidirectional inference with the easiest-first strategy for tagging sequence data. In Proc. HLT\/EMNLP\u201905, Vancouver, October 2005, pp.467\u2013474.","DOI":"10.3115\/1220575.1220634"},{"key":"9152_CR45","unstructured":"Ramshaw L, Marcus M. Text chunking using transformation-based learning. In Proc. 3rd Workshop on Very Large Corpora, Cambridge, Massachusetts, USA, 1995, pp.82\u201394."},{"key":"9152_CR46","doi-asserted-by":"crossref","unstructured":"Finkel J R, Grenager T, Manning C. Incorporating non-local information into information extraction systems by Gibbs sampling. In Proc. 43rd Annual Meeting of ACL, Michigan, USA, 2005, pp.363\u2013370.","DOI":"10.3115\/1219840.1219885"},{"issue":"7","key":"9152_CR47","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1002\/asi.20348","volume":"57","author":"J Lin","year":"2006","unstructured":"Lin J, Katz B. Building a reusable test collection for question answering. Journal of the American Society for Information Science and Technology, 2006, 57(7): 851\u2013861.","journal-title":"Journal of the American Society for Information Science and Technology"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-008-9152-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-008-9152-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-008-9152-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T10:33:48Z","timestamp":1738319628000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-008-9152-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":47,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["9152"],"URL":"https:\/\/doi.org\/10.1007\/s11390-008-9152-9","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"type":"print","value":"1000-9000"},{"type":"electronic","value":"1860-4749"}],"subject":[],"published":{"date-parts":[[2008,7]]}}}