Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 12 of 12 for “"K-core decomposition"”.
-
Computing (1+ϵ)-Approximate Degeneracy in Sublinear Time
… degeneracy of a graph is a subproblem of the k-core decomposition problem. In this paper, we present a (1 + ϵ)-approximate solution to the degeneracy problem which runs in O(n log n) time on a graph with n nodes, sublinear in the input size for dense graphs, by sampling a small number of …
-
Distributed graph decomposition algorithms on Apache Spark
… large real-life networks. Two such very popular decompositions, k-core and k-truss of a graph give very useful insight about the graph vertex and edges respectively. These decompositions have been applied to solve protein functions reasoning on protein-protein networks, fraud detection and …
-
Dominance-based knowledge discovery from large-scale attributed data
… It demonstrates this versatility across three core tasks, beginning with a skyline-based dissimilarity approach for high-dimensional image descriptors that captures intrinsic variation and utilizes hashing-based indexing for scalability. Second, it introduces DomiCom, a dimension-agnostic …
-
Scalable Core Decomposition in Large Networks
Core decomposition is a foundational operation in graph and hypergraph analytics, and serves as a fundamental tool for exploring the hierarchical structure of complex networks. With applications spanning community detection, bioinformatics, and social network analysis, efficient algorithms for core …
-
Reti complesse e analisi del segnale elettroencefalografico
… the existence of a distinctive functional core (sub-network) using an unbiased reconstruction of network topology. Brain signals from a public and freely available EEG dataset were analyzed using a phase synchronization based measure, minimum spanning tree and k-core decomposition. The …
-
Scalable Parallel Algorithms for Massive Scale-free Graphs
… Source Shortest Path, Connected Components, K-Core decomposition, Triangle Counting, and Page Rank. Our experimental study of these algorithms demonstrates excellent scalability on supercomputers, clusters with non-volatile memory, and shared memory systems. Our study includes multiple …
-
IDLE: A Novel Approach to Improving Overlapping Community Detection in Complex Networks
… in networks. Research suggests that the main core identified by k-core decomposition techniques are the most influential spreaders. In my approach, I use these k-cores as candidate seeds for local community detection. Following a well-defined seed selection process, IDLE builds and prunes …
-
High Performance Large Graph Analytics by Enhancing Locality
… novel algorithms for three graph problems: k-core decomposition, maximal clique enumeration and triangle listing. We have implemented the algorithms. The results show that these algorithms provide significant improvement in performance and also scale well.
-
Pattern Discovery for Adverse Event Evaluation and Inference
… to identify serious AEs and the use of the k-core decomposition algorithm for extracting a network of potentially important nodes. We propose algorithms for selecting appropriate values for k focusing on sensitivity and specificity. Additionally, we show the use of concepts from network …
-
Machine learning on graphs: algorithms and applications
… scales. The proposed framework is based on the k-core decomposition which is capable of uncovering several topological and hierarchical properties of graphs. Specifically, the k-core decomposition builds a hierarchy of nested subgraphs, each having stronger connectedness properties compared to the …
-
UNDERSTANDING AND MANAGING COMPLEX DATASETS
… particular, it provides a novel technique for k-core decomposition and maintenance. The solution has been implemented on top of akka and tested on various real and synthetic datasets. Results show that it efficiently exploits as much as possible the existing topology of the graph achieving …
-
Μεγιστοποίηση επιρροής σε δυναμικά κοινωνικά δίκτυα και γράφους, πλήρως και μερικώς παρατηρούμενα
Influence maximization in dynamic social networks is a critical problem in the study of socialgraphs, with applications in marketing, information diffusion, and public policy. This dissertation analyzes influence maximization in dynamic social networks, considering both fully and partially …