A combination of genetic algorithm‐based fuzzy C‐means with a convex hull‐based regression for real‐time fuzzy switching regression analysis: application to industrial intelligent data analysis
Bibliographic record
Abstract
Abstract Processing an increasing volume of data, especially in industrial and manufacturing domains, calls for advanced tools of data analysis. Knowledge discovery is a process of analyzing data from different perspectives and summarizing the results into some useful and transparent findings. To address such challenges, a thorough extension and generalization of well‐known techniques such as regression analysis becomes essential and highly advantageous. In this paper, we extend the concept of regression models so that they can handle hybrid data coming from various sources which quite often exhibit diverse levels of data quality. The major objective of this study is to develop a sound vehicle of a hybrid data analysis, which helps in reducing the computing time, especially in cases of real‐time data processing. We propose an efficient real‐time fuzzy switching regression analysis based on a genetic algorithm‐based fuzzy C‐means associated with a convex hull‐based fuzzy regression approach. The method enables us to deal with situations when one has to deal with heterogeneous data which were derived from various database sources (distributed databases). In the proposed design, we emphasize a pivotal role of the convex hull approach, which is essential to alleviate the limitations of linear programming when being used in modeling of real‐time systems. © 2013 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.
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.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| 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".