Grid Clustering Algorithm with Simple Leaping Search Technique
Data mining is a critical data analysis technique for extracting hidden information from large databases for business or industrial applications. As the size of organizational databases increase, finding information and knowledge efficiently is essential. In the past, numerous clustering algorithms...
Gespeichert in:
| Veröffentlicht in: | 2012 International Symposium on Computer, Consumer and Control S. 938 - 941 |
|---|---|
| Hauptverfasser: | , |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
IEEE
01.06.2012
|
| Schlagworte: | |
| ISBN: | 9781467307673, 146730767X |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Data mining is a critical data analysis technique for extracting hidden information from large databases for business or industrial applications. As the size of organizational databases increase, finding information and knowledge efficiently is essential. In the past, numerous clustering algorithms based on grid-clustering schemes have been proposed. This study proposes, simple-leaping search (SLS), a new grid-based clustering algorithm that partitions the space by the number of grids. It then sequentially searches odd columns of all grids according to the minimal point set at each grid. Based on whether the grid is useful or useless, different neighbor grids are searched. Experimental results show that the SLS clustering algorithm performs better than other clustering algorithms such as DBSCAN, IDBSCAN and GOD-CS. |
|---|---|
| AbstractList | Data mining is a critical data analysis technique for extracting hidden information from large databases for business or industrial applications. As the size of organizational databases increase, finding information and knowledge efficiently is essential. In the past, numerous clustering algorithms based on grid-clustering schemes have been proposed. This study proposes, simple-leaping search (SLS), a new grid-based clustering algorithm that partitions the space by the number of grids. It then sequentially searches odd columns of all grids according to the minimal point set at each grid. Based on whether the grid is useful or useless, different neighbor grids are searched. Experimental results show that the SLS clustering algorithm performs better than other clustering algorithms such as DBSCAN, IDBSCAN and GOD-CS. |
| Author | Tsai, Cheng-Fa Zhang, Jun-Hao |
| Author_xml | – sequence: 1 givenname: Cheng-Fa surname: Tsai fullname: Tsai, Cheng-Fa email: cftsai@mail.npust.edu.tw organization: Dept. of Manage. Inf. Syst., Nat. Pingtung Univ. of Sci. & Technol., Pingtung, Taiwan – sequence: 2 givenname: Jun-Hao surname: Zhang fullname: Zhang, Jun-Hao email: e63072001@yahoo.com.tw organization: Dept. of Manage. Inf. Syst., Nat. Pingtung Univ. of Sci. & Technol., Pingtung, Taiwan |
| BookMark | eNotjM1KxDAYRSMqqGOXrtzkBTrmS9L8bISh6DhQcNHuhzT9Mg20ndp2EN_e8WdzL-ceuHfkajgOSMgDsDUAs0-7UuRrzoCvuZQXJLHaMK1sJlWWweUvg1RanEctbkgyz7FmXGmlGNe35Hk7xYbm3WlecIrDgW66w3GKS9vTz3PSMvZjh7RAN_7YEt3kW1qhb4f4ccJ7ch1cN2Py3ytSvb5U-VtavG93-aZIo2VLGhqBXBlvnBRGqsaBQgYeTLCZaBRo9E568Nr6OsiGh5CBtM7VPjhvDIgVefy7jYi4H6fYu-lrrzg3nCvxDZfUS88 |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/IS3C.2012.244 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE/IET Electronic Library (IEL) (UW System Shared) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE/IET Electronic Library (IEL) (UW System Shared) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 9780769546551 0769546552 |
| EndPage | 941 |
| ExternalDocumentID | 6228226 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IF 6IK 6IL 6IN AAJGR AAWTH ADFMO ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK IEGSK IERZE OCL RIE RIL |
| ID | FETCH-LOGICAL-i90t-fd3e268c8a43846da16e01c18f953d617eca4c1c79cbf4d2ff5149aabcfac8813 |
| IEDL.DBID | RIE |
| ISBN | 9781467307673 146730767X |
| IngestDate | Thu May 29 05:57:38 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i90t-fd3e268c8a43846da16e01c18f953d617eca4c1c79cbf4d2ff5149aabcfac8813 |
| PageCount | 4 |
| ParticipantIDs | ieee_primary_6228226 |
| PublicationCentury | 2000 |
| PublicationDate | 2012-June |
| PublicationDateYYYYMMDD | 2012-06-01 |
| PublicationDate_xml | – month: 06 year: 2012 text: 2012-June |
| PublicationDecade | 2010 |
| PublicationTitle | 2012 International Symposium on Computer, Consumer and Control |
| PublicationTitleAbbrev | is3c |
| PublicationYear | 2012 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssib026766027 ssj0000750298 |
| Score | 1.4996692 |
| Snippet | Data mining is a critical data analysis technique for extracting hidden information from large databases for business or industrial applications. As the size... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 938 |
| SubjectTerms | Algorithm design and analysis Clustering algorithms data clustering Data mining large database Noise Partitioning algorithms Spatial databases |
| Title | Grid Clustering Algorithm with Simple Leaping Search Technique |
| URI | https://ieeexplore.ieee.org/document/6228226 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwIxEG2AePCkBozf6cGjC9t26cfFxBBRE0JI4MCNdKetrkEw6-Lvt91dICZevLU9tZ1pZ9K-9wahW6dTGxvJI22kjhLiwN-DTEXC2MSBBAWm1JkdifFYzudq0kB3Oy6MtbYEn9luaJZ_-WYNm_BU1uM0gB55EzWF4BVXa-s7lAvO41rR8r3-oKNKllwu7t1YcDHfSjzVfbbX3Oy9TNkgAL1o18e7X5VWykAzPPrfFI9RZ8_Yw5NdLDpBDbtqo_unPDN4sNwEMQQ_jB-Wr-s8K94-cHh-xdMsSAPjkdWBNIUr5DGebVVdO2g2fJwNnqO6XkKUqbiInGGWcglSJ8xnFUYTbmMCRDrVZ8ZnKhZ0AgSEgoDOo875ZElpnYLTICVhp6i1Wq_sGcLapUC0Ezp1JpH-kHvL8aQfE8O5oKDOUTssffFZKWIs6lVf_D18iQ7DzlYAqyvUKvKNvUYH8F1kX_lNacYfpcKauA |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEG4QTfSkBoxve_DowrZb-riYGCJCXAkJe-BGSh-6BsGsi7_fdneBmHjx1vbUdqadSft93wBwa-XMhJrTQGouA4KscvdgJAKmDbGKK6F0oTMbs-GQTyZiVAN3Gy6MMaYAn5mWbxZ_-XqpVv6prE2xBz3SHbDbIQSHJVtr7T2YMkrDStPyvfqiw4IXbC7qHJlRNlmLPFX9aKu62R6Mo66HeuGWi3i_aq0UoaZ3-L9JHoHmlrMHR5todAxqZtEA909ZqmF3vvJyCG4YPsxfl1mav31A_wALx6kXB4axkZ42BUvsMUzWuq5NkPQek24_qComBKkI88DqyGDKFZckcnmFloiaECnErehE2uUqRkmikGJCeXwettalS0LKmbJScY6iE1BfLBfmFEBpZwpJy-TMasLdMXe2o6QTIk0pw0qcgYZf-vSz1MSYVqs-_3v4Buz3k5d4Gg-GzxfgwO9yCbe6BPU8W5krsKe-8_Qruy5M-gPoZZ3_ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2012+International+Symposium+on+Computer%2C+Consumer+and+Control&rft.atitle=Grid+Clustering+Algorithm+with+Simple+Leaping+Search+Technique&rft.au=Tsai%2C+Cheng-Fa&rft.au=Zhang%2C+Jun-Hao&rft.date=2012-06-01&rft.pub=IEEE&rft.isbn=9781467307673&rft.spage=938&rft.epage=941&rft_id=info:doi/10.1109%2FIS3C.2012.244&rft.externalDocID=6228226 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781467307673/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781467307673/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781467307673/sc.gif&client=summon&freeimage=true |

