Viewpoint-Based Kernel Fuzzy Clustering With Weight Information Granules
Bibliographic record
Abstract
Domain knowledge can be introduced into fuzzy clustering with the aid of information granules, embodied by the concept of viewpoints. For such kind of fuzzy clustering methods, the strategy of acquisition of viewpoints has not been fully developed. Furthermore a way of determining the related information granules deserves more attention. Having these problems in mind, in this study, the density Viewpoint-based Weighted Kernel Fuzzy Clustering (VWKFC) algorithm is proposed. First, the kernel-based hypersphere density initialization (KHDI) algorithm is presented as a certain prerequisite, in which the kernel distance is utilized instead of the Euclidean distance. Besides, a novel density radius is put forward. Second, the concept of the weight information granule is established, which incorporates two parts. The feature weight matrix is provided, where different weights are assigned to different features to reduce the influence of unrelated features. Meanwhile a sample weight is assigned to each data point, thus the influence of noise and outliers on clustering can be reduced to a certain extent. Third, the data point with the highest local density obtained by KHDI is regarded as the density viewpoint. Then we combine kernel mechanism, density viewpoints, weight information granules and a maximum entropy regularization to design the VWKFC algorithm, and prove its convergence. Experimental results validate that VWKFC is superior over eight related clustering algorithms with regard to five evaluation indexes, especially when processing high-dimensional data. It has been shown that VWKFC makes the selection of initialized cluster centers and viewpoints more reasonable, and obtains better clustering results, and achieves higher convergence speed.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".