On the public citation graph
A Partitive Rough Clustering Algorithm
0 signed · 32 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/11590316_113openalex-snapshot
Outliers in Rough k-Means Clustering
inferredcites →https://doi.org/10.1007/3-540-45813-1_30openalex-snapshot
Rough Clustering: An Alternative to Find Meaningful Clusters by Using the Reducts from a Dataset
inferredcites →https://doi.org/10.1016/j.patcog.2006.02.002openalex-snapshot
Some refinements of rough -means clustering
inferredcites →https://doi.org/10.1016/j.patrec.2004.05.007openalex-snapshot
An evolutionary rough partitive clustering
inferredcites →https://doi.org/10.1023/b:jiis.0000029668.88665.1aopenalex-snapshot
Interval Set Clustering of Web Users with Rough K-Means
inferredcites →https://doi.org/10.1109/3477.678624openalex-snapshot
Some new indexes of cluster validity
inferredcites →https://doi.org/10.1109/tpami.1979.4766909openalex-snapshot
A Cluster Separation Measure
inferredcites →https://doi.org/10.5860/choice.28-4558openalex-snapshot
Finding groups in data: an introduction to cluster analysis
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/int.20483openalex-snapshot
A class of dynamic rough partitive algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-11740-9_50openalex-snapshot
Analysis of User-Weighted π Rough k-Means
inferred← citeshttps://doi.org/10.1007/978-3-540-72530-5_2openalex-snapshot
Data Clustering Algorithms for Information Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-85064-9_13openalex-snapshot
Evolutionary Rough k-Medoid Clustering
inferred← citeshttps://doi.org/10.1007/978-981-10-3274-5_10openalex-snapshot
Soft Clustering Based Missing Value Imputation
inferred← citeshttps://doi.org/10.1007/978-981-13-8950-4_18openalex-snapshot
Graded Possibilistic Meta Clustering
inferred← citeshttps://doi.org/10.1007/s00500-019-04199-6openalex-snapshot
Missing value imputation using unsupervised machine learning techniques
inferred← citeshttps://doi.org/10.1007/s00521-019-04535-9openalex-snapshot
A Novel Fuzzy Rough Clustering Parameter-based missing value imputation
inferred← citeshttps://doi.org/10.1016/j.ijar.2012.10.003openalex-snapshot
Soft clustering – Fuzzy and rough approaches and their extensions and derivatives
inferred← citeshttps://doi.org/10.1016/j.ijar.2014.05.004openalex-snapshot
A modified rough c-means clustering algorithm based on hybrid imbalanced measure of distance and density
inferred← citeshttps://doi.org/10.1016/j.ins.2014.02.073openalex-snapshot
Rough clustering utilizing the principle of indifference
inferred← citeshttps://doi.org/10.1016/j.ins.2017.03.001openalex-snapshot
Informational Paradigm, management of uncertainty and theoretical formalisms in the clustering framework: A review
inferred← citeshttps://doi.org/10.1016/j.patrec.2014.11.003openalex-snapshot
Is there any need for rough clustering?
inferred← citeshttps://doi.org/10.1080/00207160.2015.1124099openalex-snapshot
Improved roughk-means clustering algorithm based on weighted distance measure with Gaussian function
inferred← citeshttps://doi.org/10.1109/bigdata.2015.7364027openalex-snapshot
Finding community structure via rough K-means in social network
inferred← citeshttps://doi.org/10.1371/journal.pone.0091856openalex-snapshot
Detecting Overlapping Protein Complexes by Rough-Fuzzy Clustering in Protein-Protein Interaction Networks
inferred← citeshttps://doi.org/10.4018/978-1-4666-2518-1.ch012openalex-snapshot
Data Clustering Algorithms Using Rough Sets
inferred← citeshttps://doi.org/10.5120/8924-2996openalex-snapshot
Rough Set Approach in Machine Learning: A Review
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.