K-Means Clustering in WSN with Koheneon SOM and Conscience Function
Bibliographic record
Abstract
Wireless Sensor Networks (WSNs) are broadly utilized in the recent years to monitor dynamic environments which vary in a rapid way over time. The most used technique is the clustering one, such as Kohenon Self Organizing Map (KSOM) and K means. This paper introduces a hybrid clustering technique that represents the use of K means clustering algorithm with the KSOM with conscience function of Neural Networks and applies it on a certain WSN in order to measure and evaluate its performance in terms of both energy and lifetime criteria. The application of this algorithm in a WSN is performed using the MATLAB software program. Results demonstrate that the application of K-means clustering algorithm with KSOM algorithm enhanced the performance of the WSN which depends on using KSOM algorithm only in which it offers an enhancement of 11.11% and 3.33% in terms of network average lifetime and consumed energy, respectively. The comparison among the current work and a previous one demonstrated the effectiveness of the proposed approach in this work in terms of reducing the energy consumption.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".