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 11 of 11 for “"overlapping clustering"”.
-
Overlapping clustering
… tools become a necessity for interpretation. Clustering algorithms, which aim to find interesting groupings within collections of data, are one such tool. Each algorithm incorporates into its design an inherent definition of “interesting” intended to capture nonrandom data groupings likely to …
-
Non-Redundant Overlapping Clustering: Algorithms and Applications
Given a dataset, traditional clustering algorithms often only provide a single partitioning or a single view of the dataset. On complex tasks, many different clusterings of a dataset exist, thus alternative clusterings which are of high quality and different from given trivial clusterings are asked …
-
Efficient inference algorithms for some probabilistic graphical models
… graphical models, we focus on the problem of overlapping clustering, where a data point is allowed to belong to multiple clusters. We present an overlapping clustering algo- rithm based on multiplicative mixture models. We analyze a general setting where each component of the multiplicative …
-
Overlapping community detection in massive social networks
… communities. In this thesis, we propose scalable overlapping community detection algorithms that effectively identify high quality overlapping communities in various real-world networks. We first develop an efficient overlapping community detection algorithm using a seed set expansion approach. …
-
Biological Networks: Modeling and Structural Analysis
… functional modules through the use of graph clustering techniques. The application of earlier graph clustering techniques to proteomic networks does not yield good results due to the high error rates present, and the small-world and power-law properties of these networks. We discuss the …
-
Chronic Pain as a Continuum: Autoencoder and Unsupervised Learning Methods for Archetype Clustering and Identifying Co-existing Chronic Pain Mechanisms
… hidden features, Autoencoder was used. Using an overlapping clustering technique, the pain mechanisms were identified. The pain mechanisms were also quantified while elucidating overlaps, and the dominant CP mechanism was successfully pointed out with explainable element. The hamming loss of 0.43 …
-
Semi-supervised clustering: probabilistic models, algorithms and experiments
Clustering is one of the most common data mining tasks, used frequently for data categorization and analysis in both industry and academia. The focus of our research is on semi-supervised clustering, where we study how prior knowledge, gathered either from automated information sources or human …
-
Information-theoretic graph mining
… important tasks in graph mining, such as graph clustering, outlier detection, and link prediction. Many algorithms have been proposed in the literature to solve these tasks. However, normally these issues are solved separately, although they are closely related. Detecting and exploiting the …
-
Network inference with statistical guarantees
… In the first part, we are interested in overlapping community detection problem under the popular Mixed Membership Stochastic Blockmodel (MMSB). We firstly establish sufficient conditions for the symmetric non-negative matrix factorization optimization to have a unique solution under …
-
STRUCTURED LATENT FACTOR MODELS: IDENTIFIABILITY, ESTIMATION, INFERENCE AND PREDICTION
This work first introduces a novel estimation method, called $LOVE$, of the entries and structure of a loading matrix $A$ in a latent factor model $X=AZ+E$, for an observable random vector $X \in \mathbb{R}^p$, with correlated unobservable factors $Z\in\mathbb{R}^K$, with $K$ unknown, and …
-
COMMUNITY DETECTION IN COMPLEX NETWORKS AND APPLICATION TO DENSE WIRELESS SENSOR NETWORKS LOCALIZATION
… various approaches are developed to address both overlapping and non-overlapping community detection. The proposed approaches target small-size to very large-size networks in near linear time, which is important for very large, densely-connected networks. Performance of the proposed techniques are …