{"id":"https://openalex.org/W1964417694","doi":"https://doi.org/10.1145/2396761.2398667","title":"Learning to rank search results for time-sensitive queries","display_name":"Learning to rank search results for time-sensitive queries","publication_year":2012,"publication_date":"2012-10-29","ids":{"openalex":"https://openalex.org/W1964417694","doi":"https://doi.org/10.1145/2396761.2398667","mag":"1964417694"},"language":"en","primary_location":{"id":"doi:10.1145/2396761.2398667","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2396761.2398667","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 21st ACM international conference on Information and knowledge management","raw_type":"proceedings-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/A5017997949","display_name":"Nattiya Kanhabua","orcid":"https://orcid.org/0000-0002-4028-6715"},"institutions":[{"id":"https://openalex.org/I114112103","display_name":"Leibniz University Hannover","ror":"https://ror.org/0304hq317","country_code":"DE","type":"education","lineage":["https://openalex.org/I114112103"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Nattiya Kanhabua","raw_affiliation_strings":["Leibniz Universit\u00e4t Hannover, Hannover, Germany"],"affiliations":[{"raw_affiliation_string":"Leibniz Universit\u00e4t Hannover, Hannover, Germany","institution_ids":["https://openalex.org/I114112103"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052652788","display_name":"Kjetil N\u00f8rv\u00e5g","orcid":"https://orcid.org/0000-0002-4250-9329"},"institutions":[{"id":"https://openalex.org/I204778367","display_name":"Norwegian University of Science and Technology","ror":"https://ror.org/05xg72x27","country_code":"NO","type":"education","lineage":["https://openalex.org/I204778367"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Kjetil N\u00f8rv\u00e5g","raw_affiliation_strings":["Norwegian University of Science and Technology, Trondheim, Norway","(Norwegian University of Science and Technology, Trondheim, Norway)"],"affiliations":[{"raw_affiliation_string":"Norwegian University of Science and Technology, Trondheim, Norway","institution_ids":["https://openalex.org/I204778367"]},{"raw_affiliation_string":"(Norwegian University of Science and Technology, Trondheim, Norway)","institution_ids":["https://openalex.org/I204778367"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5017997949"],"corresponding_institution_ids":["https://openalex.org/I114112103"],"apc_list":null,"apc_paid":null,"fwci":1.9818,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.88634784,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"2463","last_page":"2466"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10286","display_name":"Information Retrieval and Search Behavior","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.7957754135131836},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7910318970680237},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.654986560344696},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.6458922028541565},{"id":"https://openalex.org/keywords/learning-to-rank","display_name":"Learning to rank","score":0.5878897309303284},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5173929929733276},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4928186237812042},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.48720353841781616},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.45441707968711853},{"id":"https://openalex.org/keywords/semantic-similarity","display_name":"Semantic similarity","score":0.4305034279823303},{"id":"https://openalex.org/keywords/temporal-database","display_name":"Temporal database","score":0.42531919479370117},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.32140612602233887},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10602706670761108}],"concepts":[{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.7957754135131836},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7910318970680237},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.654986560344696},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.6458922028541565},{"id":"https://openalex.org/C86037889","wikidata":"https://www.wikidata.org/wiki/Q4330127","display_name":"Learning to rank","level":3,"score":0.5878897309303284},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5173929929733276},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4928186237812042},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.48720353841781616},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.45441707968711853},{"id":"https://openalex.org/C130318100","wikidata":"https://www.wikidata.org/wiki/Q2268914","display_name":"Semantic similarity","level":2,"score":0.4305034279823303},{"id":"https://openalex.org/C77277458","wikidata":"https://www.wikidata.org/wiki/Q1969246","display_name":"Temporal database","level":2,"score":0.42531919479370117},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.32140612602233887},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10602706670761108},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2396761.2398667","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2396761.2398667","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 21st ACM international conference on Information and knowledge management","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.299.6152","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.299.6152","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.idi.ntnu.no/~noervaag/papers/CIKM2012_LTR.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/2283fc81-8a9a-4ac0-9499-c5a1609c5ecd","is_oa":false,"landing_page_url":"https://vbn.aau.dk/da/publications/2283fc81-8a9a-4ac0-9499-c5a1609c5ecd","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kanhabua , N & N\u00f8rv\u00e5g , K 2012 , Learning to rank search results for time-sensitive queries . i Proceedings of the 21st ACM international conference on Information and knowledge management . Association for Computing Machinery , New York, NY, USA , s. 2463-2466 . https://doi.org/10.1145/2396761.2398667","raw_type":"bookPart"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6299999952316284,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1486587593","https://openalex.org/W1511283908","https://openalex.org/W1973435495","https://openalex.org/W1984919363","https://openalex.org/W1993972354","https://openalex.org/W2018022208","https://openalex.org/W2022266300","https://openalex.org/W2023217766","https://openalex.org/W2041737440","https://openalex.org/W2047221353","https://openalex.org/W2057034832","https://openalex.org/W2070633821","https://openalex.org/W2085680808","https://openalex.org/W2091825929","https://openalex.org/W2099421013","https://openalex.org/W2103569001","https://openalex.org/W2108280221","https://openalex.org/W2112617223","https://openalex.org/W2115403396","https://openalex.org/W2125993116","https://openalex.org/W2127176025","https://openalex.org/W2137426349","https://openalex.org/W2142623206","https://openalex.org/W2149427297","https://openalex.org/W2160218441","https://openalex.org/W2167355161","https://openalex.org/W3009009611"],"related_works":["https://openalex.org/W3127142483","https://openalex.org/W3160516639","https://openalex.org/W4385565564","https://openalex.org/W2898073868","https://openalex.org/W2138488530","https://openalex.org/W2798835721","https://openalex.org/W2971071571","https://openalex.org/W2387658907","https://openalex.org/W2922169395","https://openalex.org/W2385796165"],"abstract_inverted_index":{"Retrieval":[0],"effectiveness":[1,123],"of":[2,21,50,71],"temporal":[3,16,34,48,80,104,108],"queries":[4],"can":[5],"be":[6],"improved":[7],"by":[8],"taking":[9],"into":[10],"account":[11],"the":[12,45,94,107,121],"time":[13],"dimension.":[14],"Existing":[15],"ranking":[17,61,76,117,127],"models":[18],"follow":[19],"one":[20],"two":[22,69],"main":[23],"approaches:":[24],"1)":[25],"a":[26,38,42,58,75,98,101],"mixture":[27],"model":[28,40,62,118],"linearly":[29],"combining":[30],"textual":[31,46],"similarity":[32,96],"and":[33,36,47,79,100],"similarity,":[35],"2)":[37],"probabilistic":[39],"generating":[41],"query":[43,99],"from":[44,85],"part":[49],"document":[51],"independently.":[52],"In":[53],"this":[54],"paper,":[55],"we":[56,113],"propose":[57],"novel":[59],"time-aware":[60,126],"based":[63],"on":[64],"learning-to-rank":[65],"techniques.":[66],"We":[67],"employ":[68],"classes":[70],"features":[72,89,105],"for":[73],"learning":[74],"model,":[77],"entity-based":[78],"features,":[81],"which":[82],"are":[83,90],"derived":[84],"annotation":[86],"data.":[87],"Entity-based":[88],"aimed":[91],"at":[92],"capturing":[93],"semantic":[95],"between":[97],"document,":[102],"whereas":[103],"measure":[106],"similarity.":[109],"Through":[110],"extensive":[111],"experiments":[112],"show":[114],"that":[115],"our":[116],"significantly":[119],"improves":[120],"retrieval":[122],"over":[124],"existing":[125],"models.":[128]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}