On the public citation graph
Parallel Density-Based Clustering of Complex Objects
0 signed · 60 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-540-45228-7_31openalex-snapshot
Similarity Search in Structured Data
inferredcites →https://doi.org/10.1109/dasfaa.2003.1192365openalex-snapshot
Effective similarity search on voxelized CAD objects
inferredcites →https://doi.org/10.1109/dasfaa.2003.1192391openalex-snapshot
Indexing high-dimensional data for content-based retrieval in large databases
inferredcites →https://doi.org/10.1109/icdm.2004.10082openalex-snapshot
Efficient Density-Based Clustering of Complex Objects
inferredcites →https://doi.org/10.1145/872757.872828openalex-snapshot
Using sets of feature vectors for similarity search on voxelized CAD objects
inferredcites →https://doi.org/10.5282/edoc.2840openalex-snapshot
New Techniques for Clustering Complex Objects
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.3054openalex-snapshot
Data Parallel density‐based genetic clustering on CUDA Architecture
inferred← citeshttps://doi.org/10.1007/978-3-319-00969-8_78openalex-snapshot
Data Preprocessing with GPU for DBSCAN Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-59162-9_49openalex-snapshot
Distributed DBSCAN Algorithm – Concept and Experimental Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-319-93040-4_34openalex-snapshot
A New Local Density for Density Peak Clustering
inferred← citeshttps://doi.org/10.1007/978-3-642-34859-4_41openalex-snapshot
GPU Accelerated Genetic Clustering
inferred← citeshttps://doi.org/10.1007/978-3-642-41671-2_98openalex-snapshot
A Survey on Density-Based Clustering Algorithms
inferred← citeshttps://doi.org/10.1007/978-981-10-8476-8_9openalex-snapshot
A Fast DBSCAN Algorithm with Spark Implementation
inferred← citeshttps://doi.org/10.1007/978-981-13-0292-3_3openalex-snapshot
Performance Evaluation of a Distributed Clustering Approach for Spatial Datasets
inferred← citeshttps://doi.org/10.1007/s10115-014-0797-0openalex-snapshot
Anytime density-based clustering of complex data
inferred← citeshttps://doi.org/10.1007/s10618-018-0562-1openalex-snapshot
Anytime parallel density-based clustering
inferred← citeshttps://doi.org/10.1007/s11390-024-2700-0openalex-snapshot
A Survey and Experimental Review on Data Distribution Strategies for Parallel Spatial Clustering Algorithms
inferred← citeshttps://doi.org/10.1016/j.ins.2014.10.023openalex-snapshot
Fast density-based clustering through dataset partition using graphics processing units
inferred← citeshttps://doi.org/10.1016/j.ins.2021.06.044openalex-snapshot
Efficient implementation and parallelization of fuzzy density based clustering
inferred← citeshttps://doi.org/10.1016/j.patcog.2019.01.034openalex-snapshot
Grid-based DBSCAN: Indexing and inference
inferred← citeshttps://doi.org/10.1093/forestscience/56.3.301openalex-snapshot
Identifying the Presence of Assessment Errors in Forest Inventory Data by Data Mining
inferred← citeshttps://doi.org/10.1109/access.2024.3507193openalex-snapshot
Vectorized Highly Parallel Density-Based Clustering for Applications With Noise
inferred← citeshttps://doi.org/10.1109/apcip.2009.260openalex-snapshot
Density-Based Clustering of Massive Short Messages Using Domain Ontology
inferred← citeshttps://doi.org/10.1109/bigdata.2018.8622258openalex-snapshot
Parallel DBSCAN Algorithm Using a Data Partitioning Strategy with Spark Implementation
inferred← citeshttps://doi.org/10.1109/cluster.2019.8891020openalex-snapshot
μDBSCAN: An Exact Scalable DBSCAN Algorithm for Big Data Exploiting Spatial Locality
inferred← citeshttps://doi.org/10.1109/icalip.2016.7846664openalex-snapshot
Parallel clustering by fast search and find of density peaks
inferred← citeshttps://doi.org/10.1109/icasi.2017.7988545openalex-snapshot
Density-based clustering algorithm for GPGPU computing
inferred← citeshttps://doi.org/10.1109/icsmc.2012.6377860openalex-snapshot
Genetic algorithm for clustering accelerated by the CUDA platform
inferred← citeshttps://doi.org/10.1109/ipdps.2016.10openalex-snapshot
Exploiting Variant-Based Parallelism for Data Mining of Space Weather Phenomena
inferred← citeshttps://doi.org/10.1109/ipdpsw.2016.57openalex-snapshot
A Novel Scalable DBSCAN Algorithm with Spark
inferred← citeshttps://doi.org/10.1109/isspit.2011.6151532openalex-snapshot
Mining rare cases in post-operative pain by means of outlier detection
inferred← citeshttps://doi.org/10.1109/micai.2014.19openalex-snapshot
A Robust Density-Based Hierarchical Clustering Algorithm
inferred← citeshttps://doi.org/10.1109/mlbdbi58171.2022.00066openalex-snapshot
An improved density peaks clustering based on a new local density
inferred← citeshttps://doi.org/10.1109/sc.2012.9openalex-snapshot
A new scalable parallel DBSCAN algorithm using the disjoint-set data structure
inferred← citeshttps://doi.org/10.1109/tpami.2020.3023125openalex-snapshot
Incremental Density-Based Clustering on Multicore Processors
inferred← citeshttps://doi.org/10.1109/tpds.2017.2675421openalex-snapshot
Optimizing Parallel Clustering Throughput in Shared Memory
inferred← citeshttps://doi.org/10.1145/1645953.1646038openalex-snapshot
Density-based clustering using graphics processors
inferred← citeshttps://doi.org/10.1145/2503210.2503255openalex-snapshot
Scalable parallel OPTICS data clustering using graph algorithmic techniques
inferred← citeshttps://doi.org/10.1145/2675744.2675763openalex-snapshot
Parallelizing OPTICS for multicore systems
inferred← citeshttps://doi.org/10.1145/2684464.2684477openalex-snapshot
Parallelizing OPTICS for Commodity Clusters
inferred← citeshttps://doi.org/10.1145/3007748.3007773openalex-snapshot
Exact, Fast and Scalable Parallel DBSCAN for Commodity Platforms
inferred← citeshttps://doi.org/10.1145/3132847.3133112openalex-snapshot
A Communication Efficient Parallel DBSCAN Algorithm based on Parameter Server
inferred← citeshttps://doi.org/10.1145/3318464.3380582openalex-snapshot
Theoretically-Efficient and Practical Parallel DBSCAN
inferred← citeshttps://doi.org/10.1155/2015/579391openalex-snapshot
Cludoop: An Efficient Distributed Density-Based Clustering for Big Data Using Hadoop
inferred← citeshttps://doi.org/10.1177/0361198118796071openalex-snapshot
Dijkstra’s-DBSCAN: Fast, Accurate, and Routable Density Based Clustering of Traffic Incidents on Large Road Network
inferred← citeshttps://doi.org/10.17159/sajs.2016/20140340openalex-snapshot
High-speed detection of emergent market clustering via an unsupervised parallel genetic algorithm
inferred← citeshttps://doi.org/10.21786/bbrc/13.14/39openalex-snapshot
Improved Parallel DBSCAN Algorithm Based on Radix Sort
inferred← citeshttps://doi.org/10.34248/bsengineering.698741openalex-snapshot
Kümeleme Algoritmalarında Kullanılan Farklı Yöntemlere Genel Bakış
inferred← citeshttps://doi.org/10.36227/techrxiv.171085046.60925150/v1openalex-snapshot
Vectorized Highly Parallel Density-based Clustering for Applications with Noise
inferred← citeshttps://doi.org/10.36227/techrxiv.171085046.60925150/v2openalex-snapshot
Vectorized Highly Parallel Density-based Clustering for Applications with Noise
inferred← citeshttps://doi.org/10.5282/edoc.17533openalex-snapshot
Density-based algorithms for active and anytime clustering
inferred← citeshttps://doi.org/10.5282/edoc.6611openalex-snapshot
Efficient and Effective Similarity Search on Complex Objects
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.