{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:28:30Z","timestamp":1725470910345},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642318993"},{"type":"electronic","value":"9783642319006"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31900-6_35","type":"book-chapter","created":{"date-parts":[[2012,7,28]],"date-time":"2012-07-28T03:22:28Z","timestamp":1343445748000},"page":"276-281","source":"Crossref","is-referenced-by-count":0,"title":["Learning to Classify Service Data with Latent Semantics"],"prefix":"10.1007","author":[{"given":"Le","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"35_CR1","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1002\/aris.1440380105","volume":"38","author":"S.T. Dumais","year":"2004","unstructured":"Dumais, S.T.: Latent Semantic Analysis. Annual Reiview of Information Science and Technology\u00a038(1), 188\u2013230 (2004)","journal-title":"Annual Reiview of Information Science and Technology"},{"unstructured":"Borman, S.: The Expectation Maximization Algorithm\u2014A Short Tutorial (2009), \n                    \n                      http:\/\/www.seanborman.com\/publications\/EMalgorithm.pdf","key":"35_CR2"},{"issue":"2","key":"35_CR3","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1023\/A:1009715923555","volume":"2","author":"C.J.C. Burges","year":"1998","unstructured":"Burges, C.J.C.: A Tutorial on Support Vector Machines for Pattern Recognition. Data Mining and Knowledge Discovery\u00a02(2), 121\u2013167 (1998)","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"4","key":"35_CR4","doi-asserted-by":"publisher","first-page":"32","DOI":"10.4018\/jwsr.2006100102","volume":"3","author":"L. Aversano","year":"2006","unstructured":"Aversano, L., Bruno, M., et al.: Using Concept Lattices to Support Service Selection. International Journal of Web Services Research\u00a03(4), 32\u201351 (2006)","journal-title":"International Journal of Web Services Research"},{"key":"35_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/11776420_14","volume-title":"Learning Theory","author":"H.Q. Minh","year":"2006","unstructured":"Minh, H.Q., Niyogi, P., Yao, Y.: Mercer\u2019s Theorem, Feature Maps, and Smoothing. In: Lugosi, G., Simon, H.U. (eds.) COLT 2006. LNCS (LNAI), vol.\u00a04005, pp. 154\u2013168. Springer, Heidelberg (2006)"},{"issue":"2","key":"35_CR6","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1109\/72.991427","volume":"13","author":"C.W. Hsu","year":"2002","unstructured":"Hsu, C.W., Lin, C.J.: A Comparison of Methods for Multi-class Support Vector Machines. IEEE Transactions on Neural Networks\u00a013(2), 415\u2013425 (2002)","journal-title":"IEEE Transactions on Neural Networks"},{"doi-asserted-by":"crossref","unstructured":"Joachims, T.: A Statistical Learning Model of Text Classification for Support Vector Machines. In: Proc. of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 128\u2013136 (2001)","key":"35_CR7","DOI":"10.1145\/383952.383974"},{"issue":"3","key":"35_CR8","first-page":"361","volume":"5","author":"D.D. Lewis","year":"2004","unstructured":"Lewis, D.D., Li, F., Rose, T., Yang, Y.: RCV 1: A new benchmark collection for text categorization research. Journal of Machine Learning Research\u00a05(3), 361\u2013397 (2004)","journal-title":"Journal of Machine Learning Research"},{"key":"35_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-540-30116-5_17","volume-title":"Knowledge Discovery in Databases: PKDD 2004","author":"G. Forman","year":"2004","unstructured":"Forman, G., Cohen, I.: Learning from Little: Comparison of Classifiers Given Little Training. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) PKDD 2004. LNCS (LNAI), vol.\u00a03202, pp. 161\u2013172. Springer, Heidelberg (2004)"},{"issue":"6","key":"35_CR10","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1002\/asi.20147","volume":"56","author":"F. Debole","year":"2004","unstructured":"Debole, F., Sebastiani, F.: An analysis of the Relative Hardness of Reuters-21578 Subsets. Journal of the American Society for Information Science and Technology\u00a056(6), 584\u2013596 (2004)","journal-title":"Journal of the American Society for Information Science and Technology"}],"container-title":["Lecture Notes in Computer Science","Rough Sets and Knowledge Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31900-6_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:50:26Z","timestamp":1620129026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31900-6_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642318993","9783642319006"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31900-6_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}