On the public citation graph

Reduct and attribute order

https://doi.org/10.1007/bf02944745
0 signed · 16 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.1007/978-94-015-7975-9_21openalex-snapshot
The Discernibility Matrices and Functions in Information Systems
inferredcites →https://doi.org/10.1007/bf01001956openalex-snapshot
Rough sets
inferredcites →https://doi.org/10.1007/bf02943234openalex-snapshot
Reduction algorithms based on discernibility matrix: The ordered attributes method

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11548669_17openalex-snapshot
The Second Attribute
inferred← citeshttps://doi.org/10.1007/11908029_61openalex-snapshot
A Model of Machine Learning Based on User Preference of Attributes
inferred← citeshttps://doi.org/10.1007/978-3-540-85064-9_15openalex-snapshot
A Model of User-Oriented Reduct Construction for Machine Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-16339-5_69openalex-snapshot
A New Attribute Reduction Algorithm Based on Classification Closeness Function
inferred← citeshttps://doi.org/10.1007/978-3-642-34679-8_10openalex-snapshot
A Model of User-Oriented Reduct Construction Based on Minimal Set Cover
inferred← citeshttps://doi.org/10.1007/s11390-006-0383-3openalex-snapshot
Second Attribute Algorithm Based on Tree Expression
inferred← citeshttps://doi.org/10.1007/s11390-007-9037-3openalex-snapshot
Tree Expressions for Information Systems
inferred← citeshttps://doi.org/10.1016/j.ins.2006.06.003openalex-snapshot
Rudiments of rough sets
inferred← citeshttps://doi.org/10.1016/j.ins.2008.11.020openalex-snapshot
Discernibility matrix simplification for constructing attribute reducts
inferred← citeshttps://doi.org/10.1093/comjnl/bxm012openalex-snapshot
User-Oriented Feature Selection for Machine Learning
inferred← citeshttps://doi.org/10.1145/2677855.2677939openalex-snapshot
Reduct Computation Through Ranking for Efficient Feature Extraction
inferred← citeshttps://doi.org/10.3724/sp.j.1087.2008.02443openalex-snapshot
Attribute reduction algorithm based on tolerance relation under attribute order
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.267.92openalex-snapshot
A Quick Algorithm for Attribute Reduction Based on Divide and Conquer Method
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.