{"id":"https://openalex.org/W2342907272","doi":null,"title":"Algorithms for the degree-constrained minimum spanning tree and the hierarchical clustering problems using the nearest-neighbor techniques","display_name":"Algorithms for the degree-constrained minimum spanning tree and the hierarchical clustering problems using the nearest-neighbor techniques","alternate_titles":[],"publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2342907272","mag":"2342907272"},"language":"en","primary_location":{"id":"pmh:oai:stars.library.ucf.edu:rtd-3183","doi":null,"is_oa":false,"landing_page_url":"https://stars.library.ucf.edu/rtd/2184","pdf_url":null,"source":{"id":"https://openalex.org/S7407148568","display_name":"STARS (University of Central Florida)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I106165777","host_organization_name":"University of Central Florida","host_organization_lineage":["https://openalex.org/I106165777"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Retrospective Theses and Dissertations","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W2342907272"],"child_works_count":0,"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/A5031627799","display_name":"Li-Jen Mao","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Li-Jen Mao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113770265","display_name":"Sheau-Dong Lang","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Sheau-Dong Lang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5108559244","display_name":"Narsingh Deo","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Narsingh Deo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5005000233650208,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5005000233650208,"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.46389999985694885,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.018799999728798866,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/degree-constrained-minimum-spanning-tree","display_name":"degree-constrained minimum spanning tree","score":0.9940000176429749},{"id":"https://openalex.org/keywords/agglomerative-hierarchical-clustering","display_name":"agglomerative clustering","score":0.9729999899864197},{"id":"https://openalex.org/keywords/nearest-neighbor-algorithm","display_name":"nearest neighbor algorithm","score":0.7360000014305115},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.6650000214576721},{"id":"https://openalex.org/keywords/approximate-algorithms","display_name":"approximate algorithms","score":0.890999972820282},{"id":"https://openalex.org/keywords/time-complexity-analysis","display_name":"time complexity analysis","score":0.6990000009536743}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6952545642852783},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.6888526082038879},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6486063599586487},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.606006920337677},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6045657992362976},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5366233587265015},{"id":"https://openalex.org/C92835128","wikidata":"https://www.wikidata.org/wiki/Q1277447","display_name":"Hierarchical clustering","level":3,"score":0.4690708816051483},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4509354531764984},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4306584298610687},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4304676353931427},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.3634917736053467},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36233943700790405},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.35997387766838074},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19382691383361816},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09368434548377991}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:stars.library.ucf.edu:rtd-3183","doi":null,"is_oa":false,"landing_page_url":"https://stars.library.ucf.edu/rtd/2184","pdf_url":null,"source":{"id":"https://openalex.org/S7407148568","display_name":"STARS (University of Central Florida)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I106165777","host_organization_name":"University of Central Florida","host_organization_lineage":["https://openalex.org/I106165777"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Retrospective Theses and Dissertations","raw_type":"text"},{"id":"mag:2342907272","doi":null,"is_oa":false,"landing_page_url":"https://stars.library.ucf.edu/rtd/2184/","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1746344237","https://openalex.org/W2120092569","https://openalex.org/W2354705371","https://openalex.org/W2736425480","https://openalex.org/W2158319614","https://openalex.org/W1563342931","https://openalex.org/W7096585335","https://openalex.org/W2060542967","https://openalex.org/W7037377716","https://openalex.org/W976798568"],"abstract_inverted_index":{"In":[0],"this":[1,81],"dissertation,":[2],"we":[3,176],"explore":[4],"the":[5,9,15,21,31,40,46,60,96,100,103,108,112,118,122,127,131,138,160,166,178,187,209,221,246],"properties":[6],"related":[7],"to":[8,34,270,290],"nearest":[10],"neighbor":[11],"(NN)":[12],"technique":[13,33],"in":[14,121,233],"contexts":[16],"of":[17,38,56,59,65,80,111,130,162,248,258,264,272,276,278,284,292],"clustering":[18,49,92,109,123],"methods":[19],"and":[20,45,62,87,102,136,146,169,266,286],"minimum":[22],"spanning":[23,172,206],"trees.":[24],"We":[25,51,68],"present":[26,70],"new":[27,89,180],"algorithms":[28,93,105,164,182],"that":[29,73,149,202,213,263,271,283,291],"apply":[30],"NN":[32,97],"solving":[35],"two":[36],"classes":[37],"problems:":[39],"Degree-Constrained":[41],"MST":[42],"problem":[43,168],"(d-MST)":[44],"hierarchical":[47,90],"agglomerative":[48,91],"problem.":[50],"perform":[52],"a":[53,230],"theoretical":[54,145],"analysis":[55],"time":[57,153,257],"complexity":[58],"sequential":[61],"parallel":[63,181],"implementations":[64],"our":[66,75],"algorithms.":[67],"also":[69],"empirical":[71,147],"results":[72,196],"validate":[74],"analysis.":[76],"The":[77,226,255,274],"main":[78],"contributions":[79],"research":[82],"are":[83],"as":[84,240,242],"follows:":[85],"(1)\u00a0Design":[86],"analyze":[88,137],"by":[94,116],"applying":[95],"techniques.":[98],"(a)\u00a0Design":[99],"Diam-SLINK":[101],"Radius-SLINK":[104],"which":[106],"improve":[107],"performance":[110],"single":[113,132],"link":[114,133],"method":[115],"avoiding":[117],"chaining":[119],"effect":[120],"results,":[124],"while":[125],"maintaining":[126],"good":[128],"time-efficiency":[129],"method.":[134],"(b)\u00a0Implement":[135],"O(":[139,155],"n)-space":[140],"RNN-CLINK":[141],"algorithm,":[142],"providing":[143],"both":[144],"evidence":[148],"demonstrates":[150],"average":[151],"running":[152],"is":[154,239,260,267,280,287],"n2":[156],"log":[157],"n).":[158],"(2)\u00a0Explore":[159],"implementation":[161],"approximate":[163],"for":[165,183],"d-MST":[167,184,218],"other":[170],"constrained":[171],"tree":[173,207],"problems.":[174],"Specifically,":[175],"developed":[177],"following":[179],"based":[185,197],"on":[186,198],"Tree-Construction":[188],"(TC)":[189],"approach:":[190],"(a)\u00a0The":[191],"TC-RNN":[192,203,227],"algorithm.":[193,254],"Our":[194],"experimental":[195],"extensive":[199],"testing":[200],"demonstrate":[201],"consistently":[204],"finds":[205,229],"with":[208],"lower":[210],"weight":[211],"than":[212,262,282],"obtained":[214],"from":[215],"an":[216],"existing":[217],"algorithm":[219,228],"using":[220],"iterative":[222],"refinement":[223],"(IR)":[224],"approach.":[225],"feasible":[231],"solution":[232],"most":[234],"cases":[235],"even":[236],"when":[237],"d":[238],"small":[241],"2,":[243],"but":[244],"at":[245],"expense":[247],"greater":[249],"execution":[250,256],"time.":[251],"(b)\u00a0The":[252],"TC-NNC":[253,259,279],"shorter":[261],"TC-RNN,":[265],"very":[268,288],"close":[269,289],"IR.":[273],"quality":[275],"solutions":[277],"better":[281],"IR":[285],"TC-RNN.":[293]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2342907272","counts_by_year":[],"updated_date":"2026-11-19T14:11:59.513116","created_date":"2016-06-24T00:00:00"}
