Daniel W Stashuk
Biographic Data
| ID | 10054842 |
|---|---|
| NAME | Daniel W Stashuk |
| GIVEN NAMES | Daniel W |
| FAMILY NAME | Stashuk |
| SIGNATURE | STASHUK D W |
| AFFILIATIONS | University of Waterloo |
| ORCID | 0000-0002-8072-8135 |
| VERIFIED | Yes |
| TOTAL WORKS | 1 |
| TOTAL CITATIONS | 0 |
| AUTHOR COUNT | 1 |
| EDITOR COUNT | 0 |
| FIRST PUBLICATION YEAR | 2020 |
| LATEST PUBLICATION YEAR | 2020 |
| H-INDEX | 0 |
Discovering Density-Based Clustering Structures Using Neighborhood Distance Entropy Consistency
Traditional clustering algorithms model the clustering problem as an optimization task, in which the objective is defined based on minimizing specific metrics. These algorithms are limited to find clusters with convex polytopes. In contrast, density-based clustering algorithms aim at overcoming this limitation and try to partition data objects into meaningful groups that have relatively high density separated by low-density regions. This work des…
No prominent works on this page.
Discovering Density-Based Clustering Structures Using Neighborhood Distance Entropy Consistency
Traditional clustering algorithms model the clustering problem as an optimization task, in which the objective is defined based on minimizing specific metrics. These algorithms are limited to find clusters with convex polytopes. In contrast, density-based clustering algorithms aim at overcoming this limitation and try to partition data objects into meaningful groups that have relatively high density separated by low-density regions. This work des…
Advanced Clustering Algorithms Research (1 work) · Algorithm (1 work) · Artificial Intelligence (1 work) · Cluster analysis (1 work) · Computer Science (1 work) · Correlation clustering (1 work) · CURE data clustering algorithm (1 work) · Data mining (1 work) · DBSCAN (1 work) · Determining the number of clusters in a data set (1 work)