{"id":"https://openalex.org/W2117910490","doi":"https://doi.org/10.1109/ijcnn.2008.4634377","title":"Extending the Growing Hierarchal SOM for clustering documents in graphs domain","display_name":"Extending the Growing Hierarchal SOM for clustering documents in graphs domain","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W2117910490","doi":"https://doi.org/10.1109/ijcnn.2008.4634377","mag":"2117910490"},"language":"en","primary_location":{"id":"doi:10.1109/ijcnn.2008.4634377","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2008.4634377","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence)","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/A5111893973","display_name":"Mahmoud F. Hussin","orcid":"https://orcid.org/0000-0003-3810-7148"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mahmoud F. Hussin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5097458745","display_name":"Mahmoud R. Farra","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mahmoud R. Farra","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5113483913","display_name":"Yasser El-Sonbaty","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yasser El-Sonbaty","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5111893973"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.572,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.78745824,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"4028","last_page":"4035"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10320","display_name":"Neural Networks and Applications","score":0.9936000108718872,"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/T10320","display_name":"Neural Networks and Applications","score":0.9936000108718872,"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/T10057","display_name":"Face and Expression Recognition","score":0.9850999712944031,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.974399983882904,"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/cluster-analysis","display_name":"Cluster analysis","score":0.84088534116745},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7301720380783081},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5816305875778198},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5747535228729248},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5501120090484619},{"id":"https://openalex.org/keywords/document-clustering","display_name":"Document clustering","score":0.5127304792404175},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.45756298303604126},{"id":"https://openalex.org/keywords/vector-space-model","display_name":"Vector space model","score":0.4278295040130615},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3895914554595947},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.3553503155708313},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2375115156173706},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16562920808792114}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.84088534116745},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7301720380783081},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5816305875778198},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5747535228729248},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5501120090484619},{"id":"https://openalex.org/C177937566","wikidata":"https://www.wikidata.org/wiki/Q4223102","display_name":"Document clustering","level":3,"score":0.5127304792404175},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.45756298303604126},{"id":"https://openalex.org/C89686163","wikidata":"https://www.wikidata.org/wiki/Q1187982","display_name":"Vector space model","level":2,"score":0.4278295040130615},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3895914554595947},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.3553503155708313},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2375115156173706},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16562920808792114},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ijcnn.2008.4634377","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2008.4634377","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W74108380","https://openalex.org/W1502706994","https://openalex.org/W1521439890","https://openalex.org/W1541777050","https://openalex.org/W1557693712","https://openalex.org/W1651093245","https://openalex.org/W1936135814","https://openalex.org/W1984765322","https://openalex.org/W2000982728","https://openalex.org/W2006522572","https://openalex.org/W2014351296","https://openalex.org/W2029818998","https://openalex.org/W2060215248","https://openalex.org/W2065699343","https://openalex.org/W2095454928","https://openalex.org/W2128277676","https://openalex.org/W2137763598","https://openalex.org/W4245176872"],"related_works":["https://openalex.org/W2019737068","https://openalex.org/W2899601636","https://openalex.org/W4254379378","https://openalex.org/W3015674157","https://openalex.org/W4206655101","https://openalex.org/W1500125366","https://openalex.org/W4237592971","https://openalex.org/W2387982377","https://openalex.org/W2551770406","https://openalex.org/W2137763598"],"abstract_inverted_index":{"The":[0,30,130],"growing":[1,96],"hierarchal":[2],"self-organizing":[3],"map":[4],"(GHSOM)":[5],"is":[6,17,48],"the":[7,12,35,42,63,68,73,80,106,115,134],"most":[8],"efficient":[9],"model":[10,39,56],"among":[11],"variants":[13,44],"of":[14,37,45,75,109,133,142],"SOM.":[15],"It":[16],"used":[18],"successfully":[19],"in":[20,24,67,140],"document":[21,120],"clustering":[22,128,143],"and":[23,40,84],"various":[25],"pattern":[26],"recognition":[27],"applications":[28],"effectively.":[29],"main":[31],"constraint":[32],"that":[33,49],"limits":[34],"implementation":[36],"this":[38,59],"all":[41],"other":[43],"SOM":[46,98],"models":[47],"they":[50],"work":[51,66,104],"only":[52],"with":[53,105],"vector":[54,110],"space":[55],"(VSM).":[57],"In":[58],"paper,":[60],"we":[61,78],"extend":[62],"GHSOM":[64],"to":[65,71,103,146],"graph":[69,107],"domain":[70],"enhance":[72],"quality":[74,144],"clusters.":[76],"Specifically,":[77],"represent":[79],"documents":[81,88],"by":[82,89],"graphs":[83],"then":[85],"cluster":[86],"those":[87],"using":[90,122],"a":[91],"new":[92],"algorithm":[93],"G-GHSOM:":[94],"graph-based":[95],"merarchal":[97],"after":[99],"modifying":[100],"its":[101],"operations":[102],"instead":[108],"space.":[111],"We":[112],"have":[113],"tested":[114],"G-GHSOM":[116,136],"on":[117],"two":[118],"different":[119,124],"collections":[121],"three":[123],"measures":[125],"for":[126],"evaluating":[127],"quality.":[129],"experimental":[131],"results":[132],"proposed":[135],"show":[137],"an":[138],"improvement":[139],"terms":[141],"compared":[145],"classical":[147],"GHSOM.":[148]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}