GeoZ: a Region-Based Visualization of Clustering Algorithms
نویسندگان
چکیده
Abstract The spatial display of clustered data using machine learning (ML) as regions (bordered areas) is currently unfeasible. This problem commonly encountered in various research fields that utilize clustering algorithms their workflow. We present this study an approach utilizing ML algorithm models can be trained to any specific dataset produce decision boundaries. These boundaries are overlaid onto the geographic coordinate system (GCS) generate regions. proposed implemented Python Package Index (PyPI) a geovisualization library called zones (GeoZ). efficiency GeoZ was tested groundwater wells State California. experimented with 13 different determine best model predicts existing regional distribution (subbasins). support vector (SVM) produced relatively high accuracy score and fulfilled required criteria better than other models. Consequently, SVM optimized parameters open-source library. However, it important note limitations application may arise from nature algorithm, well volume, discontinuity, data. have attempted address these through suggestions solutions.
منابع مشابه
A Comparative Study of Some Clustering Algorithms on Shape Data
Recently, some statistical studies have been done using the shape data. One of these studies is clustering shape data, which is the main topic of this paper. We are going to study some clustering algorithms on shape data and then introduce the best algorithm based on accuracy, speed, and scalability criteria. In addition, we propose a method for representing the shape data that facilitates and ...
متن کاملTowards a GeoZ Toolkit
The use of Geometric Logic as the foundation of a speciication language called GeoZ is proposed elsewhere 4]. In this note we explore GeoZ from the perspective of practitioners, who are familiar with the existing Z notation, by explaining the issues that arise and the essential role of schema entailment in the GeoZ reformulation of Z's mathematical toolkit.
متن کاملA Clustering Algorithm Based on Information Visualization
This p aper st udies a clustering algorithm b ased on i nformation visulization. In th is alg orithm, through a nonlinear ma pping (NLP), s ome hig h-dimensional and complicated f eature data i s transformed into low-dimensi onal feature d ata, such as o ne, two and three dim ensionality. I ts mai n aim is that the geometry i mage in high-dimensional s pace is ma pped in to one, two a nd three ...
متن کاملGeometric visualization of clusters obtained from fuzzy clustering algorithms
Fuzzy-clustering methods, such as fuzzy k-means and Expectation Maximization, allow an object to be assigned to multiple clusters with different degrees of membership. However, the memberships that result from fuzzy-clustering algorithms are difficult to be analyzed and visualized. The memberships, usually converted to 0-1 values, are visualized using parallel coordinates or different color sha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of geovisualization and spatial analysis
سال: 2023
ISSN: ['2509-8810', '2509-8829']
DOI: https://doi.org/10.1007/s41651-023-00146-0