{"id":"https://openalex.org/W2129485481","doi":null,"title":"Making efficient learning algorithms with exponentially many features","display_name":"Making efficient learning algorithms with exponentially many features","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2129485481","mag":"2129485481"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.102.7427","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.7427","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.unl.edu/~sscott/students/qtao.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5100707872","display_name":"Qingping Tao","orcid":"https://orcid.org/0000-0003-2773-2896","observed_orcids":["https://orcid.org/0000-0003-2773-2896"]},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Qingping Tao","raw_affiliation_strings":["The University of Nebraska-Lincoln"],"raw_orcid":"https://orcid.org/0000-0003-2773-2896","affiliations":[{"raw_affiliation_string":"The University of Nebraska-Lincoln","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002697978","display_name":"Stephen Scott","orcid":"https://orcid.org/0000-0001-5227-6875","observed_orcids":["https://orcid.org/0000-0001-5227-6875"]},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stephen Scott","raw_affiliation_strings":["The University of Nebraska-Lincoln"],"raw_orcid":"https://orcid.org/0000-0001-5227-6875","affiliations":[{"raw_affiliation_string":"The University of Nebraska-Lincoln","institution_ids":["https://openalex.org/I114395901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I114395901"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9429000020027161,"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.9429000020027161,"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/T10320","display_name":"Neural Networks and Applications","score":0.020600000396370888,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.007699999958276749,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/high-dimensional-feature-space","display_name":"high-dimensional feature space","score":0.7680000066757202},{"id":"https://openalex.org/keywords/winnow-algorithm","display_name":"Winnow algorithm","score":0.7860000133514404},{"id":"https://openalex.org/keywords/perceptron","display_name":"perceptron","score":0.9150000214576721},{"id":"https://openalex.org/keywords/dnf-learning","display_name":"DNF learning","score":0.7429999709129333},{"id":"https://openalex.org/keywords/markov-chain-monte-carlo","display_name":"Markov chain Monte Carlo","score":0.925000011920929},{"id":"https://openalex.org/keywords/monte-carlo-sampling","display_name":"Monte Carlo sampling","score":0.6629999876022339},{"id":"https://openalex.org/keywords/kernel-methods","display_name":"kernel methods","score":0.5600000023841858},{"id":"https://openalex.org/keywords/feature-grouping","display_name":"feature grouping","score":0.5950000286102295}],"concepts":[{"id":"https://openalex.org/C111350023","wikidata":"https://www.wikidata.org/wiki/Q1191869","display_name":"Markov chain Monte Carlo","level":3,"score":0.667935848236084},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.5321411490440369},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5181073546409607},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5168202519416809},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5073036551475525},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4968149960041046},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4682394564151764},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.46174150705337524},{"id":"https://openalex.org/C203313322","wikidata":"https://www.wikidata.org/wiki/Q5158394","display_name":"Concept class","level":2,"score":0.44336527585983276},{"id":"https://openalex.org/C176248197","wikidata":"https://www.wikidata.org/wiki/Q458526","display_name":"Probably approximately correct learning","level":4,"score":0.43959206342697144},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42614084482192993},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3913423418998718},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3618806004524231},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.338998019695282},{"id":"https://openalex.org/C50292564","wikidata":"https://www.wikidata.org/wiki/Q2462783","display_name":"Computational learning theory","level":3,"score":0.2984418570995331},{"id":"https://openalex.org/C8038995","wikidata":"https://www.wikidata.org/wiki/Q1152135","display_name":"Unsupervised learning","level":2,"score":0.23121240735054016},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.16404211521148682},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.1197730302810669},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.102.7427","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.7427","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.unl.edu/~sscott/students/qtao.pdf","raw_type":"text"},{"id":"pmh:oai:digitalcommons.unl.edu:dissertations-10377","doi":null,"is_oa":false,"landing_page_url":"https://digitalcommons.unl.edu/dissertations/AAI3159564","pdf_url":null,"source":{"id":"https://openalex.org/S4306400577","display_name":"Lincoln (University of Nebraska)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I114395901","host_organization_name":"University of Nebraska\u2013Lincoln","host_organization_lineage":["https://openalex.org/I114395901"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ETD collection for University of Nebraska-Lincoln","raw_type":"text"},{"id":"mag:2129485481","doi":null,"is_oa":false,"landing_page_url":"https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.102.7427&rep=rep1&type=pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W260562682","https://openalex.org/W1496828798","https://openalex.org/W1537662695","https://openalex.org/W1540386283","https://openalex.org/W1544144649","https://openalex.org/W1547172162","https://openalex.org/W1554039773","https://openalex.org/W1556251288","https://openalex.org/W1560724230","https://openalex.org/W1563088657","https://openalex.org/W1565709818","https://openalex.org/W1576520375","https://openalex.org/W1588516554","https://openalex.org/W1593460366","https://openalex.org/W1601368642","https://openalex.org/W1607251184","https://openalex.org/W1675272512","https://openalex.org/W1752868210","https://openalex.org/W1946852907","https://openalex.org/W2002901911","https://openalex.org/W2020999234","https://openalex.org/W2031979166","https://openalex.org/W2032210760","https://openalex.org/W2040870580","https://openalex.org/W2056760934","https://openalex.org/W2064680241","https://openalex.org/W2078579128","https://openalex.org/W2084165935","https://openalex.org/W2084812512","https://openalex.org/W2085112704","https://openalex.org/W2085799886","https://openalex.org/W2091829858","https://openalex.org/W2093825590","https://openalex.org/W2094500233","https://openalex.org/W2108745803","https://openalex.org/W2109868644","https://openalex.org/W2110119381","https://openalex.org/W2115066119","https://openalex.org/W2115826669","https://openalex.org/W2116133729","https://openalex.org/W2118131514","https://openalex.org/W2118697091","https://openalex.org/W2125313737","https://openalex.org/W2129113961","https://openalex.org/W2132786922","https://openalex.org/W2135453151","https://openalex.org/W2136595724","https://openalex.org/W2137361561","https://openalex.org/W2148603752","https://openalex.org/W2154318594","https://openalex.org/W2155561932","https://openalex.org/W2160767446","https://openalex.org/W2163474322"],"related_works":["https://openalex.org/W7100146286","https://openalex.org/W7095182828","https://openalex.org/W2118131514","https://openalex.org/W43111499","https://openalex.org/W2137361561","https://openalex.org/W7095283974","https://openalex.org/W2002901911","https://openalex.org/W1994046901","https://openalex.org/W7096085920","https://openalex.org/W153936475"],"abstract_inverted_index":{"Expanding":[0],"the":[1,14,21,35,109,136,163,212,238,302],"learning":[2,26,74,78],"problems'":[3],"input":[4],"spaces":[5,9],"to":[6,70,88,106,112,237,251,293,308],"high-dimensional":[7],"feature":[8,239],"can":[10,219],"increase":[11],"expressiveness":[12],"of":[13,23,37,129,156,158],"hypothesis":[15],"class":[16],"and":[17,31,61,67,75,184,218,225,253,272,277,279,301,316],"thus":[18],"may":[19],"improve":[20,295],"performance":[22],"linear":[24],"threshold-based":[25],"algorithms":[27,43,283],"such":[28],"as":[29,104,197,216],"Perceptron":[30],"Winnow.":[32,107],"However,":[33],"since":[34,187],"number":[36],"features":[38],"is":[39,168,249],"dramatically":[40],"increased,":[41],"these":[42,65],"will":[44],"not":[45],"run":[46],"efficiently":[47],"unless":[48],"special":[49],"techniques":[50,54,66,153],"are":[51,114],"used.":[52],"Such":[53],"include":[55],"Monte":[56,120],"Carlo":[57,121],"approaches,":[58],"grouping":[59,208],"strategies":[60],"kernels.":[62],"We":[63,124,146,199,244,288],"investigated":[64],"applied":[68,307],"them":[69],"two":[71,291],"problems:":[72],"DNF":[73,81,92],"generalized":[76,90],"multiple-instance":[77],"(GMIL).":[79],"For":[80,162],"learning,":[82],"we":[83,230],"used":[84,241],"a":[85,117,194,201,206,232,256],"new":[86,207],"approach":[87],"learn":[89],"(non-Boolean)":[91],"formulas,":[93],"which":[94,133,180,210],"uses":[95,189],"all":[96,190],"(exponentially":[97],"many)":[98],"possible":[99,191],"terms":[100,155],"over":[101,275],"n":[102],"attributes":[103],"inputs":[105],"Then":[108,229],"weighted":[110,159],"sums":[111],"Winnow":[113],"approximated":[115],"using":[116,141],"Markov":[118,143],"chain":[119,144],"(MCMC)":[122],"method.":[123],"proposed":[125,200,231,290],"an":[126],"optimized":[127],"version":[128],"this":[130,247],"basic":[131],"algorithm,":[132],"produces":[134],"exactly":[135,235],"same":[137,213],"classifications":[138],"while":[139],"often":[140],"fewer":[142],"simulations.":[145],"also":[147,289],"empirically":[148],"evaluated":[149],"four":[150],"MCMC":[151],"sampling":[152],"in":[154,193,227,268],"accuracy":[157],"sum":[160],"estimates.":[161],"GMIL":[164,178],"problem,":[165],"our":[166],"work":[167],"based":[169],"on":[170,284],"Scott":[171],"et":[172],"al.'s":[173],"algorithm":[174,203],"GMIL-1":[175,217,276],"for":[176,262],"their":[177],"model,":[179],"has":[181,211],"exponential":[182],"time":[183,224,273],"space":[185,196],"complexity":[186,274],"it":[188],"boxes":[192],"discretized":[195],"features.":[198],"Winnow-based":[202],"GMIL-2":[204,300],"with":[205],"strategy,":[209],"generalization":[214,270,297],"ability":[215],"save":[220],"more":[221],"than":[222],"98%":[223],"memory":[226],"practice.":[228],"kernel":[233,248,265],"that":[234,246],"corresponds":[236],"mapping":[240],"by":[242],"GMIL-1.":[243],"showed":[245,266],"#P-complete":[250],"compute,":[252],"then":[254],"gave":[255],"fully":[257],"polynomial":[258],"randomized":[259],"approximation":[260],"scheme":[261],"it.":[263],"Our":[264],"improvements":[267],"both":[269],"error":[271],"GMIL-2,":[278],"outperformed":[280],"other":[281],"MIL":[282],"benchmark":[285],"data":[286],"sets.":[287],"extensions":[292],"further":[294],"its":[296],"abilities.":[298],"Both":[299],"kernels":[303],"have":[304],"been":[305],"successfully":[306],"several":[309],"applications:":[310],"drug":[311],"discovery,":[312],"content-based":[313],"image":[314],"retrieval":[315],"biological":[317],"sequence":[318],"analysis.":[319]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-11-11T12:16:26.678958","created_date":"2016-06-24T00:00:00"}