{"id":"https://openalex.org/W2403359187","doi":"https://doi.org/10.3233/978-1-60750-972-1-85","title":"On the time complexity of regularized least square","display_name":"On the time complexity of regularized least square","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2403359187","doi":"https://doi.org/10.3233/978-1-60750-972-1-85","mag":"2403359187"},"language":"en","primary_location":{"id":"doi:10.3233/978-1-60750-972-1-85","is_oa":false,"landing_page_url":"https://doi.org/10.3233/978-1-60750-972-1-85","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"type":"book-chapter","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/A5022658803","display_name":"Marco Gori","orcid":"https://orcid.org/0000-0001-6337-5430"},"institutions":[{"id":"https://openalex.org/I102064193","display_name":"University of Siena","ror":"https://ror.org/01tevnk56","country_code":"IT","type":"education","lineage":["https://openalex.org/I102064193"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Gori Marco","raw_affiliation_strings":["University of Siena, Siena, Italy"],"affiliations":[{"raw_affiliation_string":"University of Siena, Siena, Italy","institution_ids":["https://openalex.org/I102064193"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5022658803"],"corresponding_institution_ids":["https://openalex.org/I102064193"],"apc_list":null,"apc_paid":null,"fwci":0.3943,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.78502879,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"85","last_page":"96"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9670000076293945,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9670000076293945,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9535999894142151,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9376999735832214,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/square","display_name":"Square (algebra)","score":0.6043829321861267},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4595429301261902},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43105390667915344},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09482574462890625}],"concepts":[{"id":"https://openalex.org/C135692309","wikidata":"https://www.wikidata.org/wiki/Q111124","display_name":"Square (algebra)","level":2,"score":0.6043829321861267},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4595429301261902},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43105390667915344},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09482574462890625}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3233/978-1-60750-972-1-85","is_oa":false,"landing_page_url":"https://doi.org/10.3233/978-1-60750-972-1-85","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},{"id":"mag:2403359187","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/wirn/wirn2011.html#Gori11","pdf_url":null,"source":{"id":"https://openalex.org/S4306420399","display_name":"Italian Workshop on Neural Nets","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Italian Workshop on Neural Nets","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027"],"abstract_inverted_index":{"In":[0,135],"the":[1,7,10,42,49,52,63,101],"general":[2],"framework":[3],"of":[4,9,22,32,36,44,54,65,156],"kernel":[5,102],"machines,":[6],"adoption":[8],"hinge":[11],"loss":[12,56,158],"has":[13,69],"become":[14],"more":[15],"popular":[16],"than":[17,124],"square":[18,55,119,157],"loss,":[19],"also":[20],"because":[21],"computational":[23],"reasons.":[24],"Since":[25],"learning":[26,73,155],"reduces":[27],"to":[28,48,142],"a":[29,110,115],"linear":[30,94],"system":[31],"equations,":[33],"in":[34,97,109],"case":[35],"very":[37],"large":[38,77,164],"tasks":[39],"for":[40,76,93,163,168],"which":[41,154,169],"number":[43,64],"examples":[45],"is":[46,58,62,74,82,113,121,160],"proportional":[47],"input":[50,165],"dimension,":[51],"solution":[53],"regularization":[57,159],"O(&amp;ell;3),":[59],"where":[60,100],"&amp;ell;":[61],"examples,":[66],"and":[67,87,132],"it":[68],"been":[70],"claimed":[71],"that":[72,92,112,149],"unaffordable":[75],"scale":[78],"problems.":[79],"However,":[80],"this":[81,136],"only":[83],"an":[84],"upper":[85],"bound,":[86],"in-depth":[88],"experimental":[89,145],"analyses":[90],"indicate":[91],"kernels":[95],"(or":[96],"other":[98],"cases":[99],"matrix":[103],"will":[104],"be":[105],"sparse":[106],"or":[107],"decomposed":[108],"way":[111],"known":[114],"priori),":[116],"regularized":[117],"least":[118],"(RLS)":[120],"substantially":[122],"faster":[123],"support":[125,143],"vector":[126],"machine":[127],"(SVM)":[128],"both":[129],"at":[130],"training":[131],"test":[133],"times.":[134],"paper,":[137],"we":[138],"give":[139],"theoretical":[140],"results":[141],"those":[144],"findings":[146],"by":[147],"proving":[148],"there":[150],"are":[151],"conditions":[152],"under":[153],"&amp;Theta;(&amp;ell;)":[161],"even":[162],"dimensions":[166],"d":[167,170],"&amp;sime;":[171],"&amp;ell;.":[172]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2025-12-28T23:10:05.387466","created_date":"2016-06-24T00:00:00"}
