{"id":"https://openalex.org/W2177614019","doi":"https://doi.org/10.1017/s1351324910000148","title":"A non-negative tensor factorization model for selectional preference induction","display_name":"A non-negative tensor factorization model for selectional preference induction","publication_year":2010,"publication_date":"2010-10-01","ids":{"openalex":"https://openalex.org/W2177614019","doi":"https://doi.org/10.1017/s1351324910000148","mag":"2177614019"},"language":"en","primary_location":{"id":"doi:10.1017/s1351324910000148","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1351324910000148","pdf_url":null,"source":{"id":"https://openalex.org/S18088403","display_name":"Natural Language Engineering","issn_l":"1351-3249","issn":["1351-3249","1469-8110"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Natural Language Engineering","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067470407","display_name":"Tim Van de Cruys","orcid":"https://orcid.org/0000-0002-4650-0444"},"institutions":[{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"TIM VAN DE CRUYS","raw_affiliation_strings":["INRIA & Universit\u00e9 Paris 7, Rocquencourt, France e-mail:"],"affiliations":[{"raw_affiliation_string":"INRIA & Universit\u00e9 Paris 7, Rocquencourt, France e-mail:","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5067470407"],"corresponding_institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I204730241"],"apc_list":null,"apc_paid":null,"fwci":1.366,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.78599222,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"16","issue":"4","first_page":"417","last_page":"437"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8192806243896484},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.7101497650146484},{"id":"https://openalex.org/keywords/tensor","display_name":"Tensor (intrinsic definition)","score":0.6740567684173584},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.643378734588623},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5990314483642578},{"id":"https://openalex.org/keywords/preference","display_name":"Preference","score":0.5916911959648132},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5580031275749207},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.5435940027236938},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.5205013155937195},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36157432198524475},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32829660177230835},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3200768232345581},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.18066132068634033},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1417936086654663},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06863293051719666}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8192806243896484},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.7101497650146484},{"id":"https://openalex.org/C155281189","wikidata":"https://www.wikidata.org/wiki/Q3518150","display_name":"Tensor (intrinsic definition)","level":2,"score":0.6740567684173584},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.643378734588623},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5990314483642578},{"id":"https://openalex.org/C2781249084","wikidata":"https://www.wikidata.org/wiki/Q908656","display_name":"Preference","level":2,"score":0.5916911959648132},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5580031275749207},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.5435940027236938},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.5205013155937195},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36157432198524475},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32829660177230835},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3200768232345581},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.18066132068634033},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1417936086654663},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06863293051719666},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s1351324910000148","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1351324910000148","pdf_url":null,"source":{"id":"https://openalex.org/S18088403","display_name":"Natural Language Engineering","issn_l":"1351-3249","issn":["1351-3249","1469-8110"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Natural Language Engineering","raw_type":"journal-article"},{"id":"pmh:oai:pure.rug.nl:openaire_cris_publications/7a1a3b44-467f-4c4e-8871-c64e39dc90a5","is_oa":false,"landing_page_url":"https://research.rug.nl/en/publications/7a1a3b44-467f-4c4e-8871-c64e39dc90a5","pdf_url":null,"source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Van de Cruys, T 2010, 'A non-negative tensor factorization model for selectional preference induction', Natural Language Engineering, vol. 16, no. 4, pp. 417-437. https://doi.org/10.1017/S1351324910000148","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:HAL:inria-00546045v1","is_oa":false,"landing_page_url":"https://inria.hal.science/inria-00546045","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Natural Language Engineering, 2010, 16 (4), pp.417-437. ⟨10.1017/S1351324910000148⟩","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","score":0.41999998688697815,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W94565353","https://openalex.org/W126404662","https://openalex.org/W1485398277","https://openalex.org/W1516391399","https://openalex.org/W1538021842","https://openalex.org/W1551449546","https://openalex.org/W1553625635","https://openalex.org/W1593045043","https://openalex.org/W1612003148","https://openalex.org/W1859173823","https://openalex.org/W1963826206","https://openalex.org/W1978304080","https://openalex.org/W1978400666","https://openalex.org/W1983578042","https://openalex.org/W1986326495","https://openalex.org/W1986678274","https://openalex.org/W2000215628","https://openalex.org/W2008294903","https://openalex.org/W2024165284","https://openalex.org/W2037271374","https://openalex.org/W2073502026","https://openalex.org/W2075645124","https://openalex.org/W2075665712","https://openalex.org/W2085072851","https://openalex.org/W2096423148","https://openalex.org/W2098098075","https://openalex.org/W2108138101","https://openalex.org/W2113055885","https://openalex.org/W2113522550","https://openalex.org/W2115323600","https://openalex.org/W2119610041","https://openalex.org/W2121739212","https://openalex.org/W2123713213","https://openalex.org/W2127314673","https://openalex.org/W2135029798","https://openalex.org/W2140862024","https://openalex.org/W2144920235","https://openalex.org/W2151170651","https://openalex.org/W2156961248","https://openalex.org/W2158334418","https://openalex.org/W2158997610","https://openalex.org/W2170471032","https://openalex.org/W2534722639","https://openalex.org/W2915098601","https://openalex.org/W2930957955","https://openalex.org/W2989457786","https://openalex.org/W3023742835","https://openalex.org/W3144175392","https://openalex.org/W4232448985","https://openalex.org/W4255380597","https://openalex.org/W4285719527","https://openalex.org/W6635456232","https://openalex.org/W6638899456"],"related_works":["https://openalex.org/W2487162673","https://openalex.org/W2942366970","https://openalex.org/W2793211469","https://openalex.org/W2949152769","https://openalex.org/W4372354731","https://openalex.org/W1692008701","https://openalex.org/W2597588799","https://openalex.org/W4205262062","https://openalex.org/W181477314","https://openalex.org/W2002629668"],"abstract_inverted_index":{"Abstract":[0],"The":[1,71,89],"distributional":[2],"similarity":[3],"methods":[4,63],"have":[5],"proven":[6],"to":[7,26,48,64,75],"be":[8,37],"a":[9,66,86,102],"valuable":[10],"tool":[11,104],"for":[12,105],"the":[13,28,76],"induction":[14],"of":[15,30,52,68,78],"semantic":[16],"similarity.":[17],"Until":[18],"now,":[19],"most":[20],"algorithms":[21],"use":[22],"two-way":[23],"co-occurrence":[24,50],"data":[25],"compute":[27],"meaning":[29],"words.":[31],"Co-occurrence":[32],"frequencies,":[33],"however,":[34],"need":[35],"not":[36],"pairwise.":[38],"One":[39],"can":[40],"easily":[41],"imagine":[42],"situations":[43],"where":[44],"it":[45],"is":[46,73,101],"desirable":[47],"investigate":[49,60],"frequencies":[51],"three":[53],"modes":[54],"and":[55,82,95],"beyond.":[56],"This":[57],"paper":[58],"will":[59],"tensor":[61,93,97],"factorization":[62,98],"build":[65],"model":[67],"three-way":[69],"co-occurrences.":[70],"approach":[72],"applied":[74],"problem":[77],"selectional":[79],"preference":[80],"induction,":[81],"automatically":[83],"evaluated":[84],"in":[85,99],"pseudo-disambiguation":[87],"task.":[88],"results":[90],"show":[91],"that":[92],"factorization,":[94],"non-negative":[96],"particular,":[100],"promising":[103],"Natural":[106],"Language":[107],"Processing":[108],"(":[109],"nlp":[110],").":[111]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}