{"id":"https://openalex.org/W1964488740","doi":"https://doi.org/10.1145/1390334.1390442","title":"trNon-greedy active learning for text categorization using convex ansductive experimental design","display_name":"trNon-greedy active learning for text categorization using convex ansductive experimental design","publication_year":2008,"publication_date":"2008-07-20","ids":{"openalex":"https://openalex.org/W1964488740","doi":"https://doi.org/10.1145/1390334.1390442","mag":"1964488740"},"language":"en","primary_location":{"id":"doi:10.1145/1390334.1390442","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1390334.1390442","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval","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/A5100692615","display_name":"Kai Yu","orcid":"https://orcid.org/0000-0001-6593-2130"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kai Yu","raw_affiliation_strings":["NEC Laboratories America, Cupertino, USA"],"affiliations":[{"raw_affiliation_string":"NEC Laboratories America, Cupertino, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103861122","display_name":"Shenghuo Zhu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shenghuo Zhu","raw_affiliation_strings":["NEC Laboratories America, Cupertino, USA"],"affiliations":[{"raw_affiliation_string":"NEC Laboratories America, Cupertino, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085260822","display_name":"Wei Xu","orcid":"https://orcid.org/0009-0001-9354-0297"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wei Xu","raw_affiliation_strings":["NEC Laboratories America, Cupertino, USA"],"affiliations":[{"raw_affiliation_string":"NEC Laboratories America, Cupertino, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100687952","display_name":"Yihong Gong","orcid":"https://orcid.org/0000-0002-1793-5836"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yihong Gong","raw_affiliation_strings":["NEC Laboratories America, Cupertino, USA"],"affiliations":[{"raw_affiliation_string":"NEC Laboratories America, Cupertino, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100692615"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.7173,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.94313106,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"635","last_page":"642"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12535","display_name":"Machine Learning and Data Classification","score":0.9847999811172485,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11338","display_name":"Advancements in Photolithography Techniques","score":0.967199981212616,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.7205687761306763},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6933492422103882},{"id":"https://openalex.org/keywords/active-learning","display_name":"Active learning (machine learning)","score":0.6556676626205444},{"id":"https://openalex.org/keywords/categorization","display_name":"Categorization","score":0.6091009974479675},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5215818285942078},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4783758223056793},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.455024778842926},{"id":"https://openalex.org/keywords/text-categorization","display_name":"Text categorization","score":0.44741785526275635},{"id":"https://openalex.org/keywords/semi-supervised-learning","display_name":"Semi-supervised learning","score":0.4463811218738556},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.437328040599823},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41777825355529785},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32967492938041687},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26114004850387573},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17150777578353882}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7205687761306763},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6933492422103882},{"id":"https://openalex.org/C77967617","wikidata":"https://www.wikidata.org/wiki/Q4677561","display_name":"Active learning (machine learning)","level":2,"score":0.6556676626205444},{"id":"https://openalex.org/C94124525","wikidata":"https://www.wikidata.org/wiki/Q912550","display_name":"Categorization","level":2,"score":0.6091009974479675},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5215818285942078},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4783758223056793},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.455024778842926},{"id":"https://openalex.org/C2986744138","wikidata":"https://www.wikidata.org/wiki/Q302088","display_name":"Text categorization","level":3,"score":0.44741785526275635},{"id":"https://openalex.org/C58973888","wikidata":"https://www.wikidata.org/wiki/Q1041418","display_name":"Semi-supervised learning","level":2,"score":0.4463811218738556},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.437328040599823},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41777825355529785},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32967492938041687},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26114004850387573},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17150777578353882},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1390334.1390442","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1390334.1390442","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7300000190734863,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1514940655","https://openalex.org/W1524688041","https://openalex.org/W1528361845","https://openalex.org/W1530548230","https://openalex.org/W1569099997","https://openalex.org/W1596717185","https://openalex.org/W1993644118","https://openalex.org/W1999824796","https://openalex.org/W2012599677","https://openalex.org/W2050834445","https://openalex.org/W2097089247","https://openalex.org/W2104848109","https://openalex.org/W2114188922","https://openalex.org/W2115305054","https://openalex.org/W2135046866","https://openalex.org/W2150102617","https://openalex.org/W2167547465","https://openalex.org/W2426031434","https://openalex.org/W2570764145","https://openalex.org/W4285719527","https://openalex.org/W4388257666","https://openalex.org/W6634277557"],"related_works":["https://openalex.org/W2056314584","https://openalex.org/W1492505081","https://openalex.org/W1986633584","https://openalex.org/W2976807053","https://openalex.org/W184546935","https://openalex.org/W2909115059","https://openalex.org/W2943886396","https://openalex.org/W2949671220","https://openalex.org/W42414577","https://openalex.org/W3206407025"],"abstract_inverted_index":{"In":[0,74],"this":[1,75],"paper":[2,76],"we":[3,77],"propose":[4],"a":[5,72,82,92,101],"non-greedy":[6],"active":[7,29,55,138,150],"learning":[8,30,56,139],"method":[9],"for":[10,149],"text":[11,126,131,151],"categorization":[12,127,152],"using":[13],"least-squares":[14],"support":[15],"vector":[16],"machines":[17],"(LSSVM).":[18],"Our":[19,125],"work":[20],"is":[21,47,147],"based":[22],"on":[23,129],"transductive":[24],"experimental":[25],"design":[26],"(TED),":[27],"an":[28,109],"formulation":[31],"that":[32,91,135],"effectively":[33],"explores":[34],"the":[35,44,79,115,136,142],"information":[36],"of":[37,53,94,103],"unlabeled":[38],"data.":[39],"Despite":[40],"its":[41,88],"appealing":[42],"properties,":[43],"optimization":[45,84,116],"problem":[46,80,85],"however":[48],"NP-hard":[49],"and":[50,86,146],"thus--like":[51],"most":[52],"other":[54],"methods--a":[57],"greedy":[58,144],"sequential":[59,143],"strategy":[60],"to":[61,70,112,121],"select":[62],"one":[63],"data":[64,95],"example":[65],"after":[66],"another":[67],"was":[68],"suggested":[69],"find":[71],"suboptimum.":[73],"formulate":[78],"into":[81],"continuous":[83],"prove":[87],"convexity,":[89],"meaning":[90],"set":[93],"examples":[96],"can":[97],"be":[98,122],"selected":[99],"with":[100],"guarantee":[102],"global":[104],"optimum.":[105],"We":[106],"also":[107],"develop":[108],"iterative":[110],"algorithm":[111,140],"efficiently":[113],"solve":[114],"problem,":[117],"which":[118],"turns":[119],"out":[120],"very":[123],"easy-to-implement.":[124],"experiments":[128],"two":[130],"corpora":[132],"empirically":[133],"demonstrated":[134],"new":[137],"outperforms":[141],"algorithm,":[145],"promising":[148],"applications.":[153]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}