{"id":"https://openalex.org/W2094048407","doi":"https://doi.org/10.1109/ijcnn.2007.4370972","title":"Selection of the Suitable Neighborhood Size for the ISOMAP Algorithm","display_name":"Selection of the Suitable Neighborhood Size for the ISOMAP Algorithm","publication_year":2007,"publication_date":"2007-08-01","ids":{"openalex":"https://openalex.org/W2094048407","doi":"https://doi.org/10.1109/ijcnn.2007.4370972","mag":"2094048407"},"language":"en","primary_location":{"id":"doi:10.1109/ijcnn.2007.4370972","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2007.4370972","pdf_url":null,"source":{"id":"https://openalex.org/S4210195743","display_name":"IEEE International Conference on Neural Networks/IEEE ... International Conference on Neural Networks","issn_l":"1098-7576","issn":["1098-7576","1558-3902"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 International Joint Conference on Neural Networks","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/A5101959798","display_name":"Chao Shao","orcid":null},"institutions":[{"id":"https://openalex.org/I7726996","display_name":"Henan University of Economic and Law","ror":"https://ror.org/000jtc944","country_code":"CN","type":"education","lineage":["https://openalex.org/I7726996"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Chao Shao","raw_affiliation_strings":["Department of Computer Science, Henan University of Finance and Economics, Zhengzhou, Henan, China","Henan University of Finance and Economics, Zhengzhou"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Henan University of Finance and Economics, Zhengzhou, Henan, China","institution_ids":["https://openalex.org/I7726996"]},{"raw_affiliation_string":"Henan University of Finance and Economics, Zhengzhou","institution_ids":["https://openalex.org/I7726996"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110189868","display_name":"Houkuan Huang","orcid":null},"institutions":[{"id":"https://openalex.org/I21193070","display_name":"Beijing Jiaotong University","ror":"https://ror.org/01yj56c84","country_code":"CN","type":"education","lineage":["https://openalex.org/I21193070"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Houkuan Huang","raw_affiliation_strings":["School of Computer & Information Technology, Beijing Jiaotong University, Beijing, China","School of Computer & Information Technology, Beijing Jiaotong University, Beijing 100044, China. email: hkhuang@bjtu.edu.cn"],"affiliations":[{"raw_affiliation_string":"School of Computer & Information Technology, Beijing Jiaotong University, Beijing, China","institution_ids":["https://openalex.org/I21193070"]},{"raw_affiliation_string":"School of Computer & Information Technology, Beijing Jiaotong University, Beijing 100044, China. email: hkhuang@bjtu.edu.cn","institution_ids":["https://openalex.org/I21193070"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089680132","display_name":"Chunhong Wan","orcid":null},"institutions":[{"id":"https://openalex.org/I7726996","display_name":"Henan University of Economic and Law","ror":"https://ror.org/000jtc944","country_code":"CN","type":"education","lineage":["https://openalex.org/I7726996"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chunhong Wan","raw_affiliation_strings":["Department of Computer Science, Henan University of Finance and Economics, Zhengzhou, Henan, China","Henan University of Finance and Economics, Zhengzhou"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Henan University of Finance and Economics, Zhengzhou, Henan, China","institution_ids":["https://openalex.org/I7726996"]},{"raw_affiliation_string":"Henan University of Finance and Economics, Zhengzhou","institution_ids":["https://openalex.org/I7726996"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101959798"],"corresponding_institution_ids":["https://openalex.org/I7726996"],"apc_list":null,"apc_paid":null,"fwci":4.0333,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.94824962,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"6","issue":null,"first_page":"300","last_page":"305"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9891999959945679,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9891999959945679,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9790999889373779,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9745000004768372,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/isomap","display_name":"Isomap","score":0.907351016998291},{"id":"https://openalex.org/keywords/geodesic","display_name":"Geodesic","score":0.7979176640510559},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.552015483379364},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5199112296104431},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5133113265037537},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5122324824333191},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5114273428916931},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5084251761436462},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.507675290107727},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4446563720703125},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2900913655757904},{"id":"https://openalex.org/keywords/dimensionality-reduction","display_name":"Dimensionality reduction","score":0.27507761120796204},{"id":"https://openalex.org/keywords/nonlinear-dimensionality-reduction","display_name":"Nonlinear dimensionality reduction","score":0.2545739412307739},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20359724760055542}],"concepts":[{"id":"https://openalex.org/C2778626561","wikidata":"https://www.wikidata.org/wiki/Q6086067","display_name":"Isomap","level":4,"score":0.907351016998291},{"id":"https://openalex.org/C165818556","wikidata":"https://www.wikidata.org/wiki/Q213488","display_name":"Geodesic","level":2,"score":0.7979176640510559},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.552015483379364},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5199112296104431},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5133113265037537},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5122324824333191},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5114273428916931},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5084251761436462},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.507675290107727},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4446563720703125},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2900913655757904},{"id":"https://openalex.org/C70518039","wikidata":"https://www.wikidata.org/wiki/Q16000077","display_name":"Dimensionality reduction","level":2,"score":0.27507761120796204},{"id":"https://openalex.org/C151876577","wikidata":"https://www.wikidata.org/wiki/Q7049464","display_name":"Nonlinear dimensionality reduction","level":3,"score":0.2545739412307739},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20359724760055542},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ijcnn.2007.4370972","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2007.4370972","pdf_url":null,"source":{"id":"https://openalex.org/S4210195743","display_name":"IEEE International Conference on Neural Networks/IEEE ... International Conference on Neural Networks","issn_l":"1098-7576","issn":["1098-7576","1558-3902"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 International Joint Conference on Neural Networks","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.8199999928474426,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W44224154","https://openalex.org/W65738273","https://openalex.org/W223156261","https://openalex.org/W1512834934","https://openalex.org/W1532469653","https://openalex.org/W2001141328","https://openalex.org/W2034694694","https://openalex.org/W2053186076","https://openalex.org/W2079257256","https://openalex.org/W2093402979","https://openalex.org/W2097308346","https://openalex.org/W2101938621","https://openalex.org/W2106588364","https://openalex.org/W2126415191","https://openalex.org/W2129795301","https://openalex.org/W2145265950","https://openalex.org/W2148394752","https://openalex.org/W2156287497","https://openalex.org/W2158307450","https://openalex.org/W2587415392","https://openalex.org/W2611736676","https://openalex.org/W2799061466","https://openalex.org/W4231311245","https://openalex.org/W4244494905","https://openalex.org/W4250305371","https://openalex.org/W4255692800","https://openalex.org/W4285719527","https://openalex.org/W6601772921","https://openalex.org/W6630587947","https://openalex.org/W6631844121","https://openalex.org/W6681314672","https://openalex.org/W6737242217","https://openalex.org/W7014191107","https://openalex.org/W7034449035"],"related_works":["https://openalex.org/W1986092654","https://openalex.org/W4235003028","https://openalex.org/W2148415967","https://openalex.org/W3204435187","https://openalex.org/W2166963679","https://openalex.org/W3209137076","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015"],"abstract_inverted_index":{"The":[0],"success":[1],"of":[2,127,134],"ISOMAP":[3],"depends":[4],"greatly":[5],"on":[6,69],"selecting":[7],"a":[8,99,107],"suitable":[9,103,108],"neighborhood":[10,24,34,82,100,109],"size;":[11],"however,":[12],"it's":[13],"an":[14,60,93],"open":[15],"problem":[16],"how":[17],"to":[18,84,96],"do":[19],"this":[20,70],"efficiently.":[21],"When":[22],"the":[23,33,38,49,73,79,86,117,121,125,128,135],"size":[25,101,110],"is":[26,102],"unsuitable,":[27],"shortcut":[28],"edges":[29],"can":[30,111,137],"emerge":[31],"in":[32,72],"graph":[35,83],"and":[36,90],"shorten":[37],"involved":[39],"shortest":[40],"path":[41],"lengths":[42],"greatly,":[43],"which":[44,106],"makes":[45],"them":[46,66],"not":[47],"approximate":[48,85],"corresponding":[50,87],"geodesic":[51,88],"distances":[52],"anymore,":[53],"that":[54],"is,":[55],"there":[56],"doesn't":[57],"exist":[58],"such":[59],"approximately":[61],"monotonically":[62],"increasing":[63],"relationship":[64],"between":[65],"anymore.":[67],"Based":[68],"observation,":[71],"paper,":[74],"we":[75],"use":[76],"costs":[77],"over":[78],"minimal":[80],"connected":[81],"distances,":[89],"then":[91],"present":[92],"efficient":[94],"method":[95,119],"judge":[97],"whether":[98],"beforehand,":[104],"by":[105,132,143],"be":[112,139],"selected":[113],"more":[114,141],"efficiently":[115],"than":[116],"straightforward":[118],"with":[120],"residual":[122],"variance.":[123],"Besides,":[124],"correctness":[126],"intrinsic":[129],"dimensionality,":[130],"estimated":[131],"ISOMAP,":[133],"data":[136],"also":[138],"judged":[140],"easily":[142],"our":[144],"method.":[145]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}