{"id":"https://openalex.org/W2154240701","doi":"https://doi.org/10.1109/ijcnn.2004.1380922","title":"A new momentum minimization decomposition method for support vector machines","display_name":"A new momentum minimization decomposition method for support vector machines","publication_year":2005,"publication_date":"2005-01-31","ids":{"openalex":"https://openalex.org/W2154240701","doi":"https://doi.org/10.1109/ijcnn.2004.1380922","mag":"2154240701"},"language":"en","primary_location":{"id":"doi:10.1109/ijcnn.2004.1380922","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2004.1380922","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/conference_contribution/A_new_momentum_minimization_decomposition_method_for_support_vector_machines/27184356","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087639822","display_name":"Daniel Lai","orcid":"https://orcid.org/0000-0003-3459-7709"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"D. Lai","raw_affiliation_strings":["Department of Electrical and Computer Systems Engineering, Monash University, Clayton, VIC, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Systems Engineering, Monash University, Clayton, VIC, Australia","institution_ids":["https://openalex.org/I56590836"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110239392","display_name":"N. Mani","orcid":null},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"N. Mani","raw_affiliation_strings":["Department of Electrical and Computer Systems Engineering, Monash University, Clayton, VIC, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Systems Engineering, Monash University, Clayton, VIC, Australia","institution_ids":["https://openalex.org/I56590836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080554686","display_name":"Marimuthu Palaniswami","orcid":"https://orcid.org/0000-0002-3635-4252"},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"The University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"M. Palaniswami","raw_affiliation_strings":["Department of Electrical and Electronic Engineering, University of Melbourne, VIC, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronic Engineering, University of Melbourne, VIC, Australia","institution_ids":["https://openalex.org/I165779595"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.27231281,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":null,"first_page":"2001","last_page":"2006"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12535","display_name":"Machine Learning and Data Classification","score":0.9993000030517578,"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/T12535","display_name":"Machine Learning and Data Classification","score":0.9993000030517578,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9991000294685364,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9961000084877014,"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/support-vector-machine","display_name":"Support vector machine","score":0.563473641872406},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.532087504863739},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5041185617446899},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5028216242790222},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.48757404088974},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4848824441432953},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4838889539241791},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.48133882880210876},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42837491631507874},{"id":"https://openalex.org/keywords/classifier","display_name":"Classifier (UML)","score":0.4240500032901764},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.41251328587532043},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3168312907218933}],"concepts":[{"id":"https://openalex.org/C12267149","wikidata":"https://www.wikidata.org/wiki/Q282453","display_name":"Support vector machine","level":2,"score":0.563473641872406},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.532087504863739},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5041185617446899},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5028216242790222},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.48757404088974},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4848824441432953},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4838889539241791},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.48133882880210876},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42837491631507874},{"id":"https://openalex.org/C95623464","wikidata":"https://www.wikidata.org/wiki/Q1096149","display_name":"Classifier (UML)","level":2,"score":0.4240500032901764},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.41251328587532043},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3168312907218933},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/ijcnn.2004.1380922","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2004.1380922","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541)","raw_type":"proceedings-article"},{"id":"pmh:oai:eprints.vu.edu.au:6162","is_oa":false,"landing_page_url":"https://vuir.vu.edu.au/6162/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400215","display_name":"Victoria University Research Repository (Victoria University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I41156924","host_organization_name":"Victoria University of Wellington","host_organization_lineage":["https://openalex.org/I41156924"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Book Section"},{"id":"pmh:oai:figshare.com:article/27184356","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/A_new_momentum_minimization_decomposition_method_for_support_vector_machines/27184356","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference contribution"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/27184356","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/A_new_momentum_minimization_decomposition_method_for_support_vector_machines/27184356","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference contribution"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W291003596","https://openalex.org/W1512098439","https://openalex.org/W1543810117","https://openalex.org/W1574862351","https://openalex.org/W1604938182","https://openalex.org/W1827591527","https://openalex.org/W1964357740","https://openalex.org/W2084812512","https://openalex.org/W2110899801","https://openalex.org/W3144619878","https://openalex.org/W4230674625","https://openalex.org/W4297926604","https://openalex.org/W6630527977","https://openalex.org/W6634328381"],"related_works":["https://openalex.org/W3103325625","https://openalex.org/W2090763504","https://openalex.org/W1486898455","https://openalex.org/W148178222","https://openalex.org/W3090727460","https://openalex.org/W2041905724","https://openalex.org/W2047986527","https://openalex.org/W2104657898","https://openalex.org/W4306313719","https://openalex.org/W1948992892"],"abstract_inverted_index":{"The":[0],"support":[1],"vector":[2],"machine":[3],"classifier":[4,8],"is":[5,15,26,55],"a":[6,74,84,103],"binary":[7],"applied":[9],"to":[10,58,64,87,107,113],"classify":[11],"large":[12],"datasets,":[13],"which":[14],"ideal":[16],"for":[17],"the":[18,29,34,41,49,59,62,66,89,92,96,125,128],"application":[19],"of":[20,31,33,43,52,61,76,91,127],"decomposition":[21,35],"methods":[22],"when":[23],"processing":[24],"memory":[25],"limited.":[27],"However,":[28],"rates":[30],"convergence":[32],"method":[36,86,101],"are":[37],"largely":[38],"dependent":[39],"on":[40],"sequence":[42,51],"decomposed":[44],"problems":[45,54],"solved.":[46],"Unfortunately,":[47],"choosing":[48],"optimal":[50,111],"sub":[53],"difficult":[56],"due":[57],"inability":[60],"algorithm":[63],"consider":[65],"entire":[67],"variable":[68],"space":[69],"at":[70],"once.":[71],"We":[72,115],"propose":[73],"measure":[75],"iteration":[77],"that":[78,117],"we":[79],"call":[80],"momentum":[81,90],"and":[82],"derive":[83],"prediction":[85,100],"minimize":[88],"updated":[93],"iterates":[94],"hitting":[95],"boundary":[97],"constraints.":[98],"Our":[99],"uses":[102],"rough":[104,119],"heuristic":[105,120],"set":[106,121],"choose":[108],"an":[109],"approximately":[110],"subproblem":[112],"solve.":[114],"show":[116],"this":[118],"could":[122],"greatly":[123],"improve":[124],"speed":[126],"popular":[129],"sequential":[130],"minimal":[131],"optimization":[132],"algorithm.":[133]},"counts_by_year":[],"updated_date":"2026-09-02T18:50:13.731487","created_date":"2025-10-10T00:00:00"}