Results 41 to 50 of about 2,690,463 (245)
ConDPC: Data Connectivity-Based Density Peak Clustering
Applied Sciences, 2022 As a relatively novel density-based clustering algorithm, Density peak clustering (DPC) has been widely studied in recent years. DPC sorts all points in descending order of local density and finds neighbors for each point in turn to assign all points to ...
Yujuan Zou, Zhijian Wang
doaj +1 more source
The utility of clusters and a Hungarian clustering algorithm
PLOS ONE, 2021 Implicit in the k–means algorithm is a way to assign a value, or utility, to a cluster of points. It works by taking the centroid of the points and the value of the cluster is the sum of distances from the centroid to each point in the cluster. The aim in this paper is to introduce an alternative way to assign a value to a cluster.
Alfred Kume, Stephen G. Walker
openaire +5 more sources
Accelerating Bayesian hierarchical clustering of time series data with a randomised algorithm [PDF]
, 2013 We live in an era of abundant data. This has necessitated the development of new and innovative statistical algorithms to get the most from experimental data.
Cooke, Emma J. +17 more
core +1 more source
An interior point algorithm for minimum sum-of-squares clustering [PDF]
, 2000 Copyright @ 2000 SIAM PublicationsAn exact algorithm is proposed for minimum sum-of-squares nonhierarchical clustering, i.e., for partitioning a given set of points from a Euclidean m-space into a given number of clusters in order to minimize the sum of ...
Du Merle, O +11 more
core +1 more source
Fair Algorithms for Clustering
CoRR, 2019 We study the problem of finding low-cost Fair Clusterings in data where each data point may belong to many protected groups. Our work significantly generalizes the seminal work of Chierichetti et.al. (NIPS 2017) as follows. - We allow the user to specify the parameters that define fair representation. More precisely, these parameters define the maximum
Suman Kalyan Bera +3 more
openaire +3 more sources
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
FEBS Letters, EarlyView.A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source
Analysis of influencing factors on excellent teachers' professional growth based on DB-Kmeans method
EURASIP Journal on Advances in Signal Processing, 2022 The Kmeans clustering algorithm is widely used for the advantages of simplicity and efficient operation. However, the lack of clustering centers in the algorithm usually causes incorrect category of some discrete points.
Xu Gao +3 more
doaj +1 more source
Structural insights and therapeutic targets in Acinetobacter baumannii capsule biosynthesis
FEBS Letters, EarlyView.Hypervirulent KL49 A. baumannii's capsular polysaccharide contains the nonulosonic acid 8‐epi‐Leg5,7Ac2, synthesized by epimerization via ElaA, ElaB, and ElaC. Crystal structures of ElaA, ElaB, and ElaC reveal their role in CMP‐Leg5,7Ac2 synthesis and regioselective C8 epimerization.
Woo Cheol Lee +7 more
wiley +1 more source
NS-DBSCAN: A Density-Based Clustering Algorithm in Network Space
ISPRS International Journal of Geo-Information, 2019 Spatial clustering analysis is an important spatial data mining technique. It divides objects into clusters according to their similarities in both location and attribute aspects.
Tianfu Wang +3 more
doaj +1 more source
Data Analysis of College Students’ Mental Health Based on Clustering Analysis Algorithm
Complexity, 2021 Mental health is an important basic condition for college students to become adults. Educators gradually attach importance to strengthening the mental health education of college students.
Yichen Chu, Xiaojian Yin
doaj +1 more source