{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,7]],"date-time":"2024-04-07T23:31:59Z","timestamp":1712532719288},"reference-count":41,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2010,10,11]],"date-time":"2010-10-11T00:00:00Z","timestamp":1286755200000},"content-version":"unspecified","delay-in-days":10,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Nat. Lang. Eng."],"published-print":{"date-parts":[[2010,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The distributional similarity methods have proven to be a valuable tool for the induction of semantic similarity. Until now, most algorithms use two-way co-occurrence data to compute the meaning of words. Co-occurrence frequencies, however, need not be pairwise. One can easily imagine situations where it is desirable to investigate co-occurrence frequencies of three modes and beyond. This paper will investigate tensor factorization methods to build a model of three-way co-occurrences. The approach is applied to the problem of selectional preference induction, and automatically evaluated in a pseudo-disambiguation task. The results show that tensor factorization, and non-negative tensor factorization in particular, is a promising tool for Natural Language Processing (<jats:sc>nlp<\/jats:sc>).<\/jats:p>","DOI":"10.1017\/s1351324910000148","type":"journal-article","created":{"date-parts":[[2010,10,11]],"date-time":"2010-10-11T15:13:10Z","timestamp":1286809990000},"page":"417-437","source":"Crossref","is-referenced-by-count":22,"title":["A non-negative tensor factorization model for selectional preference induction"],"prefix":"10.1017","volume":"16","author":[{"given":"TIM","family":"VAN DE CRUYS","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2010,10,11]]},"reference":[{"key":"S1351324910000148_ref22","doi-asserted-by":"publisher","DOI":"10.1002\/1099-128X(200005\/06)14:3<105::AID-CEM582>3.0.CO;2-I"},{"key":"S1351324910000148_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF02310791"},{"key":"S1351324910000148_ref13","first-page":"95","volume-title":"Proceedings of NAACL 2001","author":"Clark","year":"2001"},{"key":"S1351324910000148_ref32","first-page":"183","volume-title":"31st Annual Meeting of the ACL","author":"Pereira","year":"1993"},{"key":"S1351324910000148_ref9","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-128X(199709\/10)11:5<393::AID-CEM483>3.0.CO;2-L"},{"key":"S1351324910000148_ref20","first-page":"289","volume-title":"Proceedings of Uncertainty in Artificial Intelligence, UAI'99","author":"Hofmann","year":"1999"},{"key":"S1351324910000148_ref4","doi-asserted-by":"crossref","unstructured":"Bader B. W. and Kolda T. G. 2006b. Efficient MATLAB computations with sparse and factored tensors. Technical Report SAND2006-7592, Sandia National Laboratories, Albuquerque, NM and Livermore, CA, December.","DOI":"10.2172\/897641"},{"key":"S1351324910000148_ref21","doi-asserted-by":"publisher","DOI":"10.1037\/1082-989X.6.1.84"},{"key":"S1351324910000148_ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102451"},{"key":"S1351324910000148_ref38","unstructured":"Turney P. D. 2007. Empirical evaluation of four tensor decomposition algorithms. Technical Report ERB-1152, Ottawa, ON, Canada: National Research Council, Institute for Information Technology."},{"key":"S1351324910000148_ref34","doi-asserted-by":"publisher","DOI":"10.1016\/S0010-0277(96)00722-6"},{"key":"S1351324910000148_ref28","first-page":"556","volume-title":"Proceedings of the 2000 Conference of the Advances in Neural information Processing Systems 13","author":"Lee","year":"2000"},{"key":"S1351324910000148_ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1186785.1186794"},{"key":"S1351324910000148_ref16","doi-asserted-by":"publisher","DOI":"10.1162\/089120102760275983"},{"key":"S1351324910000148_ref27","volume-title":"Solving Least Squares Problems","author":"Lawson","year":"1974"},{"key":"S1351324910000148_ref12","first-page":"22","article-title":"Word association norms, mutual information and lexicography","volume":"16","author":"Church","year":"1990","journal-title":"Computational Linguistics"},{"key":"S1351324910000148_ref24","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"S1351324910000148_ref35","first-page":"104","volume-title":"37th Annual Meeting of the ACL","author":"Rooth","year":"1999"},{"key":"S1351324910000148_ref15","first-page":"216","volume-title":"Proceedings of ACL 2007","author":"Erk","year":"2007"},{"key":"S1351324910000148_ref18","first-page":"1","volume-title":"UCLA Working Papers in Phonetics","author":"Harshman","year":"1970"},{"key":"S1351324910000148_ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.112"},{"key":"S1351324910000148_ref5","unstructured":"Bader B. W. and Kolda T. G. 2009. Matlab tensor toolbox version 2.3. http:\/\/csmr.ca.sandia.gov\/~tgkolda\/TensorToolbox\/, July."},{"key":"S1351324910000148_ref6","doi-asserted-by":"publisher","DOI":"10.3115\/974499.974516"},{"key":"S1351324910000148_ref7","volume-title":"Proceedings of RANLP 2007","author":"Basili","year":"2007"},{"key":"S1351324910000148_ref41","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(01)00070-8"},{"key":"S1351324910000148_ref8","first-page":"161","volume-title":"Proceedings of Conference on Empirical Methods in Natural Language Processing (EMNLP-07)","author":"Bhagat","year":"2007"},{"key":"S1351324910000148_ref10","doi-asserted-by":"publisher","DOI":"10.3758\/BF03193020"},{"key":"S1351324910000148_ref14","volume-title":"SVD and Signal Processing: Algorithms, Applications and Architectures","author":"Deprettere","year":"1988"},{"key":"S1351324910000148_ref17","first-page":"658","volume-title":"Proceedings of COLING 1992","author":"Grishman","year":"1992"},{"key":"S1351324910000148_ref29","doi-asserted-by":"publisher","DOI":"10.1207\/s15516709cog2603_4"},{"key":"S1351324910000148_ref19","first-page":"103","article-title":"Structural ambiguity and lexical relations","volume":"19","author":"Hindle","year":"1993","journal-title":"Computational Linguistics"},{"key":"S1351324910000148_ref23","volume-title":"Workshop on Link Analysis, Counterterrorism and Security","author":"Kolda","year":"2006"},{"key":"S1351324910000148_ref25","doi-asserted-by":"publisher","DOI":"10.1037\/0033-295X.104.2.211"},{"key":"S1351324910000148_ref26","doi-asserted-by":"publisher","DOI":"10.1080\/01638539809545028"},{"key":"S1351324910000148_ref30","doi-asserted-by":"publisher","DOI":"10.1162\/089120103322753365"},{"key":"S1351324910000148_ref31","unstructured":"Ordelman R. J. F. 2002. Twente Nieuws Corpus (TwNC), August. Parlevink Language Technology Group, University of Twente, The Netherlands."},{"key":"S1351324910000148_ref33","doi-asserted-by":"crossref","unstructured":"Resnik P. S. 1993. Selection And Information: A Class-based Approach to Lexical Relationships. Ph.D. thesis, University of Pennsylvania.","DOI":"10.3115\/981967.982021"},{"key":"S1351324910000148_ref37","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289464"},{"key":"S1351324910000148_ref1","first-page":"3","volume-title":"Proceedings of the Thirteenth International Conference on Machine Learning","author":"Abe","year":"1996"},{"key":"S1351324910000148_ref39","first-page":"20","volume-title":"TALN06. Verbum Ex Machina. Actes de la 13e conference sur le traitement automatique des langues naturelles","author":"van Noord","year":"2006"},{"key":"S1351324910000148_ref40","first-page":"447","volume-title":"European Conference on Computer Vision (ECCV '02)","author":"Vasilescu","year":"2002"}],"container-title":["Natural Language Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1351324910000148","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T21:14:04Z","timestamp":1556399644000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1351324910000148\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["S1351324910000148"],"URL":"https:\/\/doi.org\/10.1017\/s1351324910000148","relation":{},"ISSN":["1351-3249","1469-8110"],"issn-type":[{"value":"1351-3249","type":"print"},{"value":"1469-8110","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10]]}}}