Results 41 to 50 of about 1,461,923 (295)
Large scale clustering of protein sequences with FORCE - a layout based heuristic for weighted cluster editing [PDF]
Wittkop T, Baumbach J, Lobo FP, Rahmann S. Large scale clustering of protein sequences with FORCE - a layout based heuristic for weighted cluster editing. BMC Bioinformatics.
Wittkop, Tobias +11 more
core +1 more source
Unsupervised segmentation of mitochondria using model-based spectral clustering [PDF]
Segmentation of mitochondria in microscopic images represents a significant challenge that is motivated by the wide morphological and structural variations that are characteristic for this category of membrane enclosed sub cellular organelles. To address
Ghita, Ovidiu +2 more
core +2 more sources
Compressive Spectral Clustering
Spectral clustering has become a popular technique due to its high performance in many contexts. It comprises three main steps: create a similarity graph between N objects to cluster, compute the first k eigenvectors of its Laplacian matrix to define a feature vector for each object, and run k-means on these features to separate objects into k classes.
Tremblay, Nicolas +3 more
openaire +6 more sources
Impact of regularization on spectral clustering [PDF]
37 ...
Joseph, Antony, Yu, Bin
openaire +7 more sources
Flow-Based Clustering and Spectral Clustering: A Comparison
We propose and study a novel graph clustering method for data with an intrinsic network structure. Similar to spectral clustering, we exploit an intrinsic network structure of data to construct Euclidean feature vectors. These feature vectors can then be fed into basic clustering methods such as k-means or Gaussian mixture model (GMM) based soft ...
Sarcheshmehpour, Y. +5 more
openaire +3 more sources
Patent clustering using spectral clustering.
Patent clustering using spectral clustering.
Inchae Park (8407338) +2 more
core +1 more source
KNN-SC: Novel Spectral Clustering Algorithm Using k-Nearest Neighbors
Spectral clustering is a well-known graph-theoretic clustering algorithm. Although spectral clustering has several desirable advantages (such as the capability of discovering non-convex clusters and applicability to any data type), it often leads to ...
Jeong-Hun Kim +4 more
doaj +1 more source
Transfer Spectral Clustering [PDF]
Transferring knowledge from auxiliary datasets has been proved useful in machine learning tasks. Its adoption in clustering however is still limited. Despite of its superior performance, spectral clustering has not yet been incorporated with knowledge transfer or transfer learning.
Wenhao Jiang, Fu-Lai Chung
openaire +2 more sources
Spectral clustering with imbalanced data [PDF]
Spectral clustering (SC) and graph-based semi-supervised learning (SSL) algorithms are sensitive to how graphs are constructed from data. In particular if the data has proximal and unbalanced clusters these algorithms can lead to poor performance on well-known graphs such as $k$-NN, full-RBF, $ε$-graphs. This is because the objectives such as Ratio-Cut
Jing Qian, Venkatesh Saligrama
openaire +3 more sources
Affinity Matrix Learning Via Nonnegative Matrix Factorization for Hyperspectral Imagery Clustering
In this article, we integrate the spatial-spectral information of hyperspectral image (HSI) samples into nonnegative matrix factorization (NMF) for affinity matrix learning to address the issue of HSI clustering.
Yao Qin +5 more
doaj +1 more source

