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 20 of 34 for “"Semi-Supervised Clustering"”.
-
On Model-Based Semi-Supervised Clustering
We consider an extension of model-based clustering to the semi-supervised case, where some of the data are pre-labeled. We provide a derivation of the Bayesian Information Criterion (BIC) approximation to the Bayes factor in this setting. We then use the BIC to the select number of clusters and the …
-
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 …
-
Interactively Guiding Semi-Supervised Clustering via Attribute-based Explanations
Unsupervised image clustering is a challenging and often ill-posed problem. Existing image descriptors fail to capture the clustering criterion well, and more importantly, the criterion itself may depend on (unknown) user preferences. Semi-supervised approaches such as distance metric learning and …
-
Unsupervised and semi-supervised clustering with learnable cluster dependent kernels.
Despite the large number of existing clustering methods, clustering remains a challenging task especially when the structure of the data does not correspond to easily separable categories, and when clusters vary in size, density and shape. Existing kernel based approaches allow to adapt a specific …
-
AutoPYara: A Python/Java Framework for Automatic Yara Rule Generation Using Semi-Supervised Clustering
… generation through n-gram byte extraction and biclustering, creating rules with broad file coverage while maintaining low false positives through large, infrequent n-gram search. By extracting unique n-grams from a corpus of files and performing a joint co-cluster, AutoYara can extract rules with …
-
Data clustering with pairwise constraints
The classical unsupervised clustering is an ill-posed problem due to the absence of a unique clustering criteria. This issue can be addressed by introducing additional supervised information, usually casts in the form of pairwise constraints, to the clustering procedure. Depending on the sources, …
-
Utilização do problema das k-medianas como critério para o agrupamento de dados semi-supervisionado
Clustering is a powerful tool for automated analysis of data. It addresses the following general problem: given a set of entities, find subsets, or clusters, which are homogeneous and/or well separated. The biggest challenge of data clustering is to find a criterion to present good separation of …
-
MULTI-DIMENSIONAL PROFILING OF CYBER THREATS FOR LARGE-SCALE NETWORKS
… learning algorithms through deep learning and semi-supervised clustering, to enable the profiling of potential threats through network traffic analysis within large-scale networks. This research accomplishes these objectives by analyzing enterprise network data at the packet level using deep …
-
Some theoretical contributions to the evaluation and assessment of finite mixture models with applications
… models with applications to model-based unsupervised and semi-supervised clustering frameworks. The dissertation concludes with an application of finite mixture models to two-dimensional gel electrophoresis.</p>
-
Model-based Imputation of Below Detection Limit Missing Data and Group Selection in Bayesian Group Index Regression
… indices. We first proposed a novel variable clustering algorithm using a variant on the traditional PCA algorithm called Robust PCA. We compared this clustering method with other variable clustering methods from the literature using a simulation study. Finally, we extended the variable …
-
A Semi-Supervised Approach for Kernel-Based Temporal Clustering
Temporal clustering refers to the partitioning of a time series into multiple non-overlapping segments that belong to k temporal clusters, in such a way that segments in the same cluster are more similar to each other than to those in other clusters. Temporal clustering is a fundamental task in …
-
Computational improvements to clustering methods
… settings.We start with the extension of k-means clustering, kernel k-means, which allows for the clustering of non-spherical data. Computationally efficient methods are introduced, which are shown in simulations to outperform the standard method. Next, we focus on model-based clustering, where we …
-
Efficient Inference and Dominant-Set Based Clustering for Functional Data
… populations, we propose the dominant-set based unsupervised clustering method using the similarity matrix. (3) To learn the similarity matrix from various similarity metrics for functional data clustering, we propose the modularity guided and dominant-set based semi-supervised clustering method. …
-
Multimedia big data analysis and retrieval
… and the social web, is conducted. Next, a semi-supervised clustering method for large datasets of high-dimensional descriptor vectors is presented along with a comparative evaluation with other state of the art methods. The presentation of a social event detection method, from social …
-
Learnable similarity functions and their application to record linkage and clustering
… computations are particularly important in clustering and information integration applications, where pairwise distances play a central role in many algorithms. Typically, algorithms for these tasks rely on pre-defined similarity measures, such as edit distance or cosine similarity for …
-
Semi-supervised Information Fusion for Clustering, Classification and Detection Applications
… widely applied in many applications including clustering, classification, detection and etc. The major objective is to improve the performance using information derived from multiple sources as compared to using information obtained from any of the sources individually. In our previous work, we …
-
Aprendizagem semissupervisionada por meio de técnicas de Deep Learning e de Teoria da Informação
… of obtaining information about labels, has made semi-supervised learning one of the problems of practical importance in modern data analysis. In most cases, obtaining a dataset with enough examples to induce a classifier can be costly, as it is necessary to perform labeling of the data by an …
-
Feasibility of Melville Marginalia Authorship Differentiation
… and contrasting the two groups of marks. C-means clustering is performed on the feature spaces of both groups. Semi-supervised clustering is used to test if we can predict the clustering. We then use two forms of cluster validity, Davies-Bouldin Index and Silhouette, in order to v produce a …
-
Cross-dataset transcription-based quality control for tumour samples and pre-clinical models
… discovery and development.<br/>Using robust semi-supervised clustering, we identified 24 molecular subtypes in a gold-standard reference dataset (TCGA PanCancer Atlas). These molecular subtypes were characterised by gene expression, survival, mutations, gene set enrichment and cell type and …
-
Variational Approximations and Other Topics in Mixture Models
Mixture model-based clustering has become an increasingly popular data analysis technique since its introduction almost fifty years ago. Families of mixture models are said to arise when the component parameters, usually the component covariance matrices, are decomposed and a number of constraints …
Page 1 of 2