A Quick Reduction Algorithm Based on Important Index

Xin Ying Chen; Guan Yu Li

doi:10.4028/www.scientific.net/AMM.701-702.13

Paper Titles

Preface and Conference Organization

Research of the Method for Traffic Generating Based on Genetic Algorithm
p.3

A Novel Weighted Distance KNN Algorithm Based on Instances Condensing
p.8

A Quick Reduction Algorithm Based on Important Index
p.13

A Special Multiobjective Evolutionary Algorithm for Solving Complicated Nonlinear Equations Systems
p.18

Algorithm Improvement of Two-Way Merge Sort Based on OpenMP
p.24

Driver Fatigue Detection Algorithm Research Based on the Characteristics of Eyes
p.30

Explore Traditional Chinese Medicine Prescription Compatibility Based on Local Partial Least Squares
p.36

Fuzzy Analytic Hierarchy Process Method for Civil Aviation Airport Security Information Management
p.40

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 701-702A Quick Reduction Algorithm Based on Important...

A Quick Reduction Algorithm Based on Important Index

Abstract:

This paper tries to find a more feasible method to achieve core and reduction. Against concepts "distinguishable relation of attribute set" and "distinguishable unit set of attribute set", it defines a concept "important index", and proposes an effective and quick approach for important index. After drawn out the involved theory and equivalent proposition, also presents algorithms for core and reduction upon the important index. The heuristic reduction algorithm adopts the bottom-up design, and gets reduction based on the heuristic information "important index of attribute set". The complexity of the algorithm in space is O(m), and the complexity in time is O(mn²). The theoretical analysis and results show that the ways proposed here simplify the relevant operations and are suitable to deal with the huge volume of data.