On the public citation graph

Hybrid Bisect K-Means Clustering Algorithm

0 signed · 33 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/j.1538-7305.1948.tb01338.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1007/11590316_92openalex-snapshot
An Efficient Hybrid Hierarchical Agglomerative Clustering (HHAC) Technique for Partitioning Large Data Sets
inferredcites →https://doi.org/10.1007/3-540-45372-5_46openalex-snapshot
Centroid-Based Document Classification: Analysis and Experimental Results
inferredcites →https://doi.org/10.1007/s10618-005-0361-3openalex-snapshot
Hierarchical Clustering Algorithms for Document Datasets
inferredcites →https://doi.org/10.1016/0378-3758(89)90033-5openalex-snapshot
Algorithms for clustering data
inferredcites →https://doi.org/10.1016/j.patcog.2009.09.019openalex-snapshot
Two-level k-means clustering algorithm for k– τ relationship establishment and linear-time classification
inferredcites →https://doi.org/10.1016/s0031-3203(99)00076-xopenalex-snapshot
A theory of proximity based clustering: structure detection by optimization
inferredcites →https://doi.org/10.1081/e-elis4-120044470openalex-snapshot
Text REtrieval Conference (TREC)
inferredcites →https://doi.org/10.1108/eb046814openalex-snapshot
An algorithm for suffix stripping
inferredcites →https://doi.org/10.1109/tnn.2005.845141openalex-snapshot
Survey of Clustering Algorithms
inferredcites →https://doi.org/10.1145/312129.312186openalex-snapshot
Fast and effective text mining using linear-time document clustering
inferredcites →https://doi.org/10.4135/9781412973380.n22openalex-snapshot
An Introduction to Data Mining
inferredcites →https://doi.org/10.4324/9780080878096-12openalex-snapshot
Introduction to Data Mining

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-319-07692-8_46openalex-snapshot
Experimental Analysis of Firefly Algorithms for Divisive Clustering of Web Documents
inferred← citeshttps://doi.org/10.1007/978-3-319-12844-3_33openalex-snapshot
Nature Inspired Data Mining Algorithm for Document Clustering in Information Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-319-21024-7_20openalex-snapshot
Avalanche: A Hierarchical, Divisive Clustering Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-25939-0_2openalex-snapshot
Determining Number of Clusters Using Firefly Algorithm with Cluster Merging for Text Clustering
inferred← citeshttps://doi.org/10.1007/978-3-319-59773-7_27openalex-snapshot
A Survey of Machine Learning Methods for Big Data
inferred← citeshttps://doi.org/10.1007/978-3-642-41674-3_174openalex-snapshot
A Newton’s Universal Gravitation Inspired Firefly Algorithm for Document Clustering
inferred← citeshttps://doi.org/10.1007/978-981-13-1423-0_14openalex-snapshot
Searching Lead to Better Search Intension for Keyword
inferred← citeshttps://doi.org/10.1007/978-981-4585-18-7_30openalex-snapshot
Weight-Based Firefly Algorithm for Document Clustering
inferred← citeshttps://doi.org/10.1016/j.compind.2019.07.009openalex-snapshot
Time series grouping algorithm for load pattern recognition
inferred← citeshttps://doi.org/10.1080/03610926.2018.1504968openalex-snapshot
BMS: An improved Dunn index for Document Clustering validation
inferred← citeshttps://doi.org/10.1109/csci58124.2022.00121openalex-snapshot
New Version of Fast Automatic Determination of Cluster Numbers for High Dimensional Big Data
inferred← citeshttps://doi.org/10.1109/iadcc.2013.6514342openalex-snapshot
A novel algorithm for automatic document clustering
inferred← citeshttps://doi.org/10.1109/iwqos65803.2025.11143263openalex-snapshot
Diffusion-Type AIGC Request Scheduling with Inference Sharing
inferred← citeshttps://doi.org/10.1109/tcss.2020.3013878openalex-snapshot
Detecting Group Shilling Attacks in Online Recommender Systems Based on Bisecting K-Means Clustering
inferred← citeshttps://doi.org/10.11113/jt.v79.5408openalex-snapshot
FIREFLYCLUST: AN AUTOMATED HIERARCHICAL TEXT CLUSTERING APPROACH
inferred← citeshttps://doi.org/10.1145/2812809openalex-snapshot
Using Bisect K-Means Clustering Technique in the Analysis of Arabic Documents
inferred← citeshttps://doi.org/10.1145/3325424.3329661openalex-snapshot
Understanding the Predictability of Smartwatch Usage
inferred← citeshttps://doi.org/10.11591/ijeecs.v24.i3.pp1744-1758openalex-snapshot
Grey wolf optimization algorithm for hierarchical document clustering
inferred← citeshttps://doi.org/10.3390/app122412934openalex-snapshot
Clustering-Based Segmented Regression for Particulate Matter Sensor Calibration
inferred← citeshttps://doi.org/10.5815/ijmecs.2018.09.02openalex-snapshot
Developing an Efficient Text Pre-Processing Method with Sparse Generative Naive Bayes for Text Mining
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.