On the public citation graph
Speeding-Up Hierarchical Agglomerative Clustering in Presence of Expensive Metrics
0 signed · 29 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/bfb0015445openalex-snapshot
The first subquadratic algorithm for complete linkage clustering
inferredcites →https://doi.org/10.1016/s0304-3975(01)00239-0openalex-snapshot
Optimal algorithms for complete linkage clustering in d dimensions
inferredcites →https://doi.org/10.1023/b:mach.0000033114.18632.e0openalex-snapshot
Optimal Time Bounds for Approximate Clustering
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11564126_11openalex-snapshot
Agglomerative Hierarchical Clustering with Constraints: Theoretical and Empirical Results
inferred← citeshttps://doi.org/10.1007/978-3-319-04657-0_11openalex-snapshot
SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1007/978-3-642-13529-3_7openalex-snapshot
Distance Based Fast Hierarchical Clustering Method for Large Datasets
inferred← citeshttps://doi.org/10.1007/s10506-014-9154-6openalex-snapshot
Anonymity preserving sequential pattern mining
inferred← citeshttps://doi.org/10.1007/s10569-019-9884-6openalex-snapshot
Relaxed triangle inequality for the orbital similarity criterion by Southworth and Hawkins and its variants
inferred← citeshttps://doi.org/10.1007/s10618-008-0103-4openalex-snapshot
Using instance-level constraints in agglomerative hierarchical clustering: theoretical and empirical results
inferred← citeshttps://doi.org/10.1007/s10844-017-0472-5openalex-snapshot
One-pass MapReduce-based clustering method for mixed large scale data
inferred← citeshttps://doi.org/10.1016/j.ins.2011.07.007openalex-snapshot
Mining temporal patterns in popularity of web items
inferred← citeshttps://doi.org/10.1016/j.is.2010.09.005openalex-snapshot
Metric and trigonometric pruning for clustering of uncertain data in 2D geometric space
inferred← citeshttps://doi.org/10.1016/j.patcog.2011.04.027openalex-snapshot
A distance based clustering method for arbitrary shaped clusters in large datasets
inferred← citeshttps://doi.org/10.1080/13658810601169881openalex-snapshot
Evolution of clusters in dynamic point patterns: with a case study of Ants' simulation
inferred← citeshttps://doi.org/10.1109/icacci.2017.8125807openalex-snapshot
Dynamic data placement and tool assignment for big-data orchestrated bioinformatics workflows
inferred← citeshttps://doi.org/10.1109/iccet.2009.69openalex-snapshot
Mathematical Document Retrieval for Problem Solving
inferred← citeshttps://doi.org/10.1109/icdm.2006.37openalex-snapshot
COALA: A Novel Approach for the Extraction of an Alternate Clustering of High Quality and High Dissimilarity
inferred← citeshttps://doi.org/10.1109/icdm.2006.63openalex-snapshot
Efficient Clustering of Uncertain Data
inferred← citeshttps://doi.org/10.1109/icprime.2013.6496461openalex-snapshot
Estimating incremental dimensional algorithm with sequence data set
inferred← citeshttps://doi.org/10.21203/rs.3.rs-967255/v1openalex-snapshot
Towards Causal Analysis of Genetic Factors for Colorectal Cancer
inferred← citeshttps://doi.org/10.32657/10356/47471openalex-snapshot
Semantic-based retrieval for mathematical knowledge
inferred← citeshttps://doi.org/10.3745/kipstd.2008.15-d.4.485openalex-snapshot
Clustering of Web Objects with Similar Popularity Trends
inferred← citeshttps://doi.org/10.5840/swjphil197910229openalex-snapshot
The Inscrutability of Reference
inferred← citeshttps://doi.org/10.7155/jgaa.00338openalex-snapshot
Practical SAHN Clustering for Very Large Data Sets and Expensive Distance Metrics
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.