Clustering Multidimensional Spatial Datasets by Ragavan Anpalaki (4 results)
- Softcover
Seller: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contact seller5-star sellerCondition: New
£ 34.09
Free ShippingShips within U.S.A.Quantity: Over 20 available
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
- Softcover
Seller: PBShop.store UK, Fairford, GLOS, United KingdomPBShop.store UK
Contact seller5-star sellerCondition: New
£ 31.21
£ 4.16 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
- Softcover
Seller: California Books, Miami, FL, U.S.A.California Books
Contact seller4-star sellerCondition: New
£ 38.92
Free ShippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
- Print on Demand
Seller: CitiRetail, Stevenage, United KingdomCitiRetail
Contact seller5-star sellerCondition: New
£ 34.99
£ 37.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: new. Paperback. This book presents a systematic statistical approach to clustering and density estimation of multidimensional real-life spatial datasets, utilizing density-based clustering methods, DBSCAN, and its extension, OPTICS. It compares their clustering performance to that of the traditional centroi…d-based K-means clustering algorithm, the hierarchical BIRCH clustering algorithm, and the hybrid two-step clustering algorithm (a combination of hierarchical and K-means), evaluating the quality of clusters generated by the five clustering approaches through four internal quality validation indices and the DBCV validation index. This book primarily provides a detailed description of the key concepts and steps involved in applying the DBSCAN and OPTICS algorithms to cluster multidimensional real-life spatial datasets, interpreting the results, analyzing them critically, and comparing the results with those of three other popular clustering methods. The dbscan R package, used for clustering with DBSCAN and OPTICS algorithms, utilizes a space-partitioning data structure called a K-d tree to perform fast K-distance search and fixed-radius nearest neighbor search, including all neighbors within a fixed radius, thereby identifying clusters efficiently. This approach is a widely adopted, robust platform for identifying arbitrary-shaped clusters in large spatial datasets. This book provides a detailed description of the K-distance concept and its application in determining the optimal value for the radius input parameter through K-distance plots. BIRCH within the stream R package was used to efficiently cluster and identify densely populated regions in multidimensional spatial datasets, delivering the best possible clustering results with minimal input/output cost. This book provides a detailed description of the five clustering algorithms used, complemented by procedures for estimating and choosing input parameters, inference of results, and computing, supported by dimension reduction techniques t-SNE using the tsne R package and principal component analysis through factor analysis in SPSS for extracting components in 2 and 3 dimensions for visual enhancement. It also describes the dimension reduction process in detail and compares the results from the two dimension reduction techniques. This book will be particularly beneficial to those wishing to employ these density-based techniques in research or applications across statistics, data mining and analysis, clinical research, social science, market segmentation, consumer analysis, and many other disciplines. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
