On the public citation graph
A reduction algorithm meeting users’ requirements
0 signed · 54 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/3-540-48912-6_39openalex-snapshot
Sustainability Knowledge Mining from Human Development Database
inferredcites →https://doi.org/10.1007/3-540-58495-1_35openalex-snapshot
Dynamic reducts as a tool for extracting laws from decisions tables
inferredcites →https://doi.org/10.1007/978-1-4615-5025-9_14openalex-snapshot
The Use of Rough Sets and Fuzzy Sets in MCDM
inferredcites →https://doi.org/10.1007/978-3-7908-1883-3openalex-snapshot
Rough Sets in Knowledge Discovery 2
inferredcites →https://doi.org/10.1007/978-3-7908-1883-3_24openalex-snapshot
Genetic Algorithms in Decomposition and Classification Problems
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/bf00114117openalex-snapshot
A General Framework for Induction and a Study of Selective Induction
inferredcites →https://doi.org/10.1007/bf00993473openalex-snapshot
Technical note: Bias and the quantification of stability
inferredcites →https://doi.org/10.1007/bf02943234openalex-snapshot
Reduction algorithms based on discernibility matrix: The ordered attributes method
inferredcites →https://doi.org/10.1007/bf02948848openalex-snapshot
Investigation on AQ11, ID3 and the principle of discernibility matrix
inferredcites →https://doi.org/10.1007/bfb0014141openalex-snapshot
SLIQ: A fast scalable classifier for data mining
inferredcites →https://doi.org/10.1016/0004-3702(85)90005-0openalex-snapshot
Machine learning: An artificial intelligence approach
inferredcites →https://doi.org/10.1016/0004-3702(88)90002-1openalex-snapshot
Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
inferredcites →https://doi.org/10.1016/b978-1-55860-307-3.50034-4openalex-snapshot
Decision Theoretic Subsampling for Induction on Large Databases
inferredcites →https://doi.org/10.1016/s0377-2217(00)00167-3openalex-snapshot
Rough sets theory for multicriteria decision analysis
inferredcites →https://doi.org/10.1016/s0377-2217(98)00127-1openalex-snapshot
Rough approximation of a preference relation by dominance relations
inferredcites →https://doi.org/10.1109/iis.1997.645199openalex-snapshot
Bias and the probability of generalization
inferredcites →https://doi.org/10.1201/9781003209737openalex-snapshot
Encyclopedia of Computer Science and Technology
inferredcites →https://doi.org/10.1613/jair.120openalex-snapshot
Cost-Sensitive Classification: Empirical Evaluation of a Hybrid Genetic Decision Tree Induction Algorithm
inferredcites →https://doi.org/10.5860/choice.49-3305openalex-snapshot
Data mining: concepts and techniques
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11795131_43openalex-snapshot
On Reduct Construction Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-11740-9_49openalex-snapshot
An Addition Strategy for Reduct Construction
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-540-87563-5_6openalex-snapshot
On Reduct Construction Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-88425-5_25openalex-snapshot
Solving the Attribute Reduction Problem with Ant Colony Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-05253-8_70openalex-snapshot
Research on a Novel Data Mining Method Based on the Rough Sets and Neural Network
inferred← citeshttps://doi.org/10.1007/978-3-642-18302-7_13openalex-snapshot
Solving the Attribute Reduction Problem with Ant Colony Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-24425-4_46openalex-snapshot
Application of Rough Set Theory for Evaluating Polysaccharides Extraction
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/978-981-15-1100-4_7openalex-snapshot
Multi-reduct Rough Set Classifier for Computer-Aided Diagnosis in Medical Data
inferred← citeshttps://doi.org/10.1007/s10115-012-0589-3openalex-snapshot
Discernibility matrix simplification with new attribute dependency functions for incomplete information systems
inferred← citeshttps://doi.org/10.1016/j.ins.2007.06.031openalex-snapshot
Data analysis based on discernibility and indiscernibility
inferred← citeshttps://doi.org/10.1016/j.ins.2008.11.020openalex-snapshot
Discernibility matrix simplification for constructing attribute reducts
inferred← citeshttps://doi.org/10.1016/j.ins.2009.08.020openalex-snapshot
Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model
inferred← citeshttps://doi.org/10.1016/j.ins.2011.07.010openalex-snapshot
Test-cost-sensitive attribute reduction
inferred← citeshttps://doi.org/10.1016/j.ins.2012.04.004openalex-snapshot
Extended rough set-based attribute reduction in inconsistent incomplete decision systems
inferred← citeshttps://doi.org/10.1016/j.knosys.2011.06.007openalex-snapshot
A dynamic attribute reduction algorithm based on 0-1 integer programming
inferred← citeshttps://doi.org/10.1016/j.knosys.2015.03.022openalex-snapshot
Multi-view attribute reduction model for traffic bottleneck analysis
inferred← citeshttps://doi.org/10.1080/10798587.2013.828907openalex-snapshot
A Weighted Dynamic Information Systems Reduction Method
inferred← citeshttps://doi.org/10.1093/comjnl/bxm012openalex-snapshot
User-Oriented Feature Selection for Machine Learning
inferred← citeshttps://doi.org/10.1109/ccpr.2008.94openalex-snapshot
An Approach to the Transformer Faults Diagnosing Based on Rough Set and Artificial Immune System
inferred← citeshttps://doi.org/10.1109/coginf.2009.5250759openalex-snapshot
Analyzing skill sets with or-relation tables in knowledge spaces
inferred← citeshttps://doi.org/10.1109/coginf.2011.6016129openalex-snapshot
Sequential three-way decisions with probabilistic rough sets
inferred← citeshttps://doi.org/10.1109/grc.2009.5255004openalex-snapshot
A novel optimization mothed of parameters based on combined NN and GA
inferred← citeshttps://doi.org/10.1109/itaic.2014.7065033openalex-snapshot
Attributes reduction model with user preferences
inferred← citeshttps://doi.org/10.1109/pdcat.2005.93openalex-snapshot
Attribute value reduction in variable precision rough set
inferred← citeshttps://doi.org/10.1109/wcica.2004.1342316openalex-snapshot
An improved algorithm of decision tree based on attribute entropy
inferred← citeshttps://doi.org/10.1117/12.651108openalex-snapshot
A data mining algorithm based on the rough sets theory and BP neural network
inferred← citeshttps://doi.org/10.1142/s0129054114500117openalex-snapshot
DYNAMIC REDUCTS GENERATION USING CASCADING HASHES
inferred← citeshttps://doi.org/10.3233/ida-160807openalex-snapshot
A new algorithm for computing reducts based on the binary discernibility matrix
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.644-650.1590openalex-snapshot
Research on Relative Reducts of Rough Set Model in Consistent and Inconsistent Decision Tables
inferred← citeshttps://doi.org/10.48550/arxiv.1303.3319openalex-snapshot
A new type of judgement theorems for attribute characters in information system
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.