RELARM: A rating model based on relative PCA attributes and k-means clustering
Following widely used in visual recognition concept of relative attributes, the article establishes definition of the relative PCA attributes for a class of objects defined by vectors of their parameters. A new rating model (RELARM) is built using relative PCA attribute ranking functions for rating object description and k-means clustering algorithm. Rating assignment of each rating object to a rating category is derived as a result of cluster centers projection on the specially selected rating vector. Empirical study has shown a high level of approximation to the existing S & P, Moody's and Fitch ratings.
Code (0)
등록된 구현이 없습니다.
Tasks
AttributeClusteringObjectSimilar Papers 제목 키워드 기반
Application of the Ranking Relative Principal Component Attributes Network Model (REL-PCANet) for the Inclusive Development Index Estimation
In 2018, at the World Economic Forum in Davos it was presented a new countries' economic performance metric named the Inclusive Development Index (IDI) composed of 12 indicators. The new metric implies that countries mig…
Learning-To-RankinitKmix -- A Novel Initial Partition Generation Algorithm for Clustering Mixed Data using k-means-based Clustering
Mixed datasets consist of both numeric and categorical attributes. Various k-means-based clustering algorithms have been developed for these datasets. Generally, these algorithms use random partition as a starting point,…
ClusteringClustering and Classification with Non-Existence Attributes: A Sentenced Discrepancy Measure Based Technique
For some or all of the data instances a number of independent-world clustering issues suffer from incomplete data characterization due to losing or absent attributes. Typical clustering approaches cannot be applied direc…
AttributeClusteringGeneral ClassificationImputationFairness in Clustering with Multiple Sensitive Attributes
A clustering may be considered as fair on pre-specified sensitive attributes if the proportions of sensitive attribute groups in each cluster reflect that in the dataset. In this paper, we consider the task of fair clust…
AttributeClusteringFairnessScalable Kernel K-Means Clustering with Nystrom Approximation: Relative-Error Bounds
Kernel $k$-means clustering can correctly identify and extract a far more varied collection of cluster structures than the linear $k$-means clustering algorithm. However, kernel $k$-means clustering is computationally ex…
Clustering