A DATA CLUSTERING ALGORITHM WITH TOLERANCE RELATION
In this paper, w e present a data clustering method based on tolerance relation. The connectivity relation between objects, which is formed from tolerance sets, is a kind of equivalent relation of space partitions into several pairwise disjoint sets, called equivalent classes. Each cl ass contains o...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Dalat University
2013-06-01
|
| Series: | Tạp chí Khoa học Đại học Đà Lạt |
| Subjects: | |
| Online Access: | https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/248 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832557696055771136 |
|---|---|
| author | Nguyễn Văn Phúc Trần Tuấn Minh |
| author_facet | Nguyễn Văn Phúc Trần Tuấn Minh |
| author_sort | Nguyễn Văn Phúc |
| collection | DOAJ |
| description | In this paper, w e present a data clustering method based on tolerance relation. The connectivity relation between objects, which is formed from tolerance sets, is a kind of equivalent relation of space partitions into several pairwise disjoint sets, called equivalent classes. Each cl ass contains objects which are considered equivalent only if they are connected. This is the basic idea of proposed clustering algorithm. Our method can discover clusters of arbitrary shapes even if they are not in a high density. |
| format | Article |
| id | doaj-art-439cebb699eb4409aa9704d93753cfe4 |
| institution | Kabale University |
| issn | 0866-787X |
| language | English |
| publishDate | 2013-06-01 |
| publisher | Dalat University |
| record_format | Article |
| series | Tạp chí Khoa học Đại học Đà Lạt |
| spelling | doaj-art-439cebb699eb4409aa9704d93753cfe42025-02-03T03:12:13ZengDalat UniversityTạp chí Khoa học Đại học Đà Lạt0866-787X2013-06-013210.37569/DalatUniversity.3.2.248(2013)A DATA CLUSTERING ALGORITHM WITH TOLERANCE RELATIONNguyễn Văn Phúc0Trần Tuấn Minh1Faculty of Information Technology, Dalat UniversityFaculty of Information Technology, Dalat UniversityIn this paper, w e present a data clustering method based on tolerance relation. The connectivity relation between objects, which is formed from tolerance sets, is a kind of equivalent relation of space partitions into several pairwise disjoint sets, called equivalent classes. Each cl ass contains objects which are considered equivalent only if they are connected. This is the basic idea of proposed clustering algorithm. Our method can discover clusters of arbitrary shapes even if they are not in a high density.https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/248ClusteringSpatial DatabasesTolerance RelationTolerance Set. |
| spellingShingle | Nguyễn Văn Phúc Trần Tuấn Minh A DATA CLUSTERING ALGORITHM WITH TOLERANCE RELATION Tạp chí Khoa học Đại học Đà Lạt Clustering Spatial Databases Tolerance Relation Tolerance Set. |
| title | A DATA CLUSTERING ALGORITHM WITH TOLERANCE RELATION |
| title_full | A DATA CLUSTERING ALGORITHM WITH TOLERANCE RELATION |
| title_fullStr | A DATA CLUSTERING ALGORITHM WITH TOLERANCE RELATION |
| title_full_unstemmed | A DATA CLUSTERING ALGORITHM WITH TOLERANCE RELATION |
| title_short | A DATA CLUSTERING ALGORITHM WITH TOLERANCE RELATION |
| title_sort | data clustering algorithm with tolerance relation |
| topic | Clustering Spatial Databases Tolerance Relation Tolerance Set. |
| url | https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/248 |
| work_keys_str_mv | AT nguyenvanphuc adataclusteringalgorithmwithtolerancerelation AT trantuanminh adataclusteringalgorithmwithtolerancerelation AT nguyenvanphuc dataclusteringalgorithmwithtolerancerelation AT trantuanminh dataclusteringalgorithmwithtolerancerelation |