{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/124272"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/124272","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"A comparison of community search with community detection","abstract":"Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-09-16 without embargo terms","abstract_html":"Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-09-16 without embargo terms","abstract_has_math":false,"creators":["Kamath Pailodi, Vidya"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Chacko, George"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2024,"date_issued":"2024-05","date_published":"2024-05","updated_at":"2026-07-22T22:25:00Z","subjects":["Networks","Clustering","Community Detection","Community Search","Scientometrics"],"languages":["en","eng"],"rights":["Copyright 2024 Vidya Kamath Pailodi"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/2142/124272","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Chacko, George"]},{"key":"dc:creator","label":"Author","values":["Kamath Pailodi, Vidya"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2024-05","2024-04-25"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Networks","Clustering","Community Detection","Community Search","Scientometrics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en","eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2024 Vidya Kamath Pailodi"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://hdl.handle.net/2142/124272"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-09-16 without embargo terms","The student, Vidya Kamath Pailodi, accepted the attached license on 2024-04-12 at 18:34.","The student, Vidya Kamath Pailodi, submitted this Thesis for approval on 2024-04-12 at 19:08.","This Thesis was approved for publication on 2024-04-25 at 14:00.","DSpace SAF Submission Ingestion Package generated from Vireo submission #20390 on 2024-09-16 at 00:34:07","Clustering is a widely used technique to study the topological features of complex real-world networks. Community detection is a commonly used method that uses a top-down graph partitioning approach to often find disjoint subsets. These methods often produce a large fraction of singleton clusters, and the clusters do not typically form well-connected communities. They also face the resolution limit problem, which fails to identify communities of smaller sizes. Moreover, many of these methods cannot handle large networks. Recently, many studies have discussed the advantages of an efficient bottom-up approach called \"Community Search\", which extracts a community around a particular node of interest. In this thesis, we compare the Iterative K-Core (IKC) community detection algorithm and the Community Search k-core (CSK) method based on the principle of the minimum degree of a node in a cluster. A comparative study is conducted to discuss the advantages of the CSK method in addressing the limitations of community detection by applying these methods to a large scientific network of 14 million documents in exosome research, namely, the Curated Exosome Network (CEN). Our results demonstrate that the CSK extracts larger clusters than the IKC method for a given query node and are well-connected. CSK extracts more number of distinct clusters than IKC, and the extracted clusters typically overlap. Moreover, CSK allows a node to be part of multiple communities. Cluster quality metrics such as conductance, connectivity, and modularity showed correlations with CSK cluster sizes, which were not observed for IKC clusters. Finally, preliminary observations suggest that clustering based on topological features correlates with thematic similarity. Our observations suggest that CSK can be advantageous in generating cohesive clusters of varying sizes and cluster qualities, and helpful in exploring the topological structure surrounding a seed node in a complex real-world network."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["A comparison of community search with community detection"]}]}],"canonical_facts":{"dc:contributor":["Chacko, George"],"dc:creator":["Kamath Pailodi, Vidya"],"dc:date":["2024-05","2024-04-25"],"dc:description":["Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-09-16 without embargo terms","The student, Vidya Kamath Pailodi, accepted the attached license on 2024-04-12 at 18:34.","The student, Vidya Kamath Pailodi, submitted this Thesis for approval on 2024-04-12 at 19:08.","This Thesis was approved for publication on 2024-04-25 at 14:00.","DSpace SAF Submission Ingestion Package generated from Vireo submission #20390 on 2024-09-16 at 00:34:07","Clustering is a widely used technique to study the topological features of complex real-world networks. Community detection is a commonly used method that uses a top-down graph partitioning approach to often find disjoint subsets. These methods often produce a large fraction of singleton clusters, and the clusters do not typically form well-connected communities. They also face the resolution limit problem, which fails to identify communities of smaller sizes. Moreover, many of these methods cannot handle large networks. Recently, many studies have discussed the advantages of an efficient bottom-up approach called \"Community Search\", which extracts a community around a particular node of interest. In this thesis, we compare the Iterative K-Core (IKC) community detection algorithm and the Community Search k-core (CSK) method based on the principle of the minimum degree of a node in a cluster. A comparative study is conducted to discuss the advantages of the CSK method in addressing the limitations of community detection by applying these methods to a large scientific network of 14 million documents in exosome research, namely, the Curated Exosome Network (CEN). Our results demonstrate that the CSK extracts larger clusters than the IKC method for a given query node and are well-connected. CSK extracts more number of distinct clusters than IKC, and the extracted clusters typically overlap. Moreover, CSK allows a node to be part of multiple communities. Cluster quality metrics such as conductance, connectivity, and modularity showed correlations with CSK cluster sizes, which were not observed for IKC clusters. Finally, preliminary observations suggest that clustering based on topological features correlates with thematic similarity. Our observations suggest that CSK can be advantageous in generating cohesive clusters of varying sizes and cluster qualities, and helpful in exploring the topological structure surrounding a seed node in a complex real-world network."],"dc:format":["application/pdf"],"dc:identifier":["https://hdl.handle.net/2142/124272"],"dc:language":["en","eng"],"dc:rights":["Copyright 2024 Vidya Kamath Pailodi"],"dc:subject":["Networks","Clustering","Community Detection","Community Search","Scientometrics"],"dc:title":["A comparison of community search with community detection"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:00Z"}