An Efficient Method for Computing All Reducts
スポンサーリンク
概要
- 論文の詳細を見る
In the process of data mining of decision table using Rough Sets methodology, the main computational effort is associated with the determination of the reducts. Computing all reducts is a combinatorial NP-hard computational problem. Therefore the only way to achieve its faster execution is by providing an algorithm, with a better constant factor, which may solve this problem in reasonable time for real-life data sets. The purpose of this presentation is to propose two new efficient algorithms to compute reducts in information systems. The proposed algorithms are based on the proposition of reduct and the relation between the reduct and discernibility matrix. Experiments have been conducted on some real world domains in execution time. The results show it improves the execution time when compared with the other methods. In real application, we can combine the two proposed algorithms.
- 社団法人 人工知能学会の論文
- 2004-11-01
著者
-
ISHII Naohiro
Department of Intelligence and Computer Science, Nagoya Institute of Technology
-
Ishii Naohiro
Department Of Intelligence And Computer Science Nagoya Institute Of Technology
-
Ishii Naohiro
The Faculty Of Engineering Nagoya Institute Of Technology
-
BAO Yongguang
Aichi Information System
-
DU Xiaoyong
School of Information, Renmin University of China
-
DENG Mingrong
School of Management, Zhejiang University, China
-
Du Xiaoyong
School Of Information Renmin University Of China
-
Deng Mingrong
School Of Management Zhejiang University China
-
Bao Yongguang
Department Of Intelligence And Computer Science Nagoya Institute Of Technology
-
Ishii Naohiro
Department Of Electrical Engineering And Computer Science Nagoya Institute Of Technology
関連論文
- Neural Network Based Photometric Stereo with a Nearby Rotational Moving Light Source
- Moving Point Light Source Photometric Stereo
- Photometric Stereo for Specular Surface Shape Based on Neural Network (Special Issue on Neurocomputing)
- Shape Recovery of Glossy Surface from Shading Image and its Directional Derivatives
- The Completeness of Order-Sorted Term Rewriting Systems Is Preserved by Currying
- An Energy-Efficient Initialization Protocol for Wireless Sensor Networks with No Collision Detection
- Termination of Order-Sorted Rewriting with Non-minimal Signatures
- Accuracy of the Minimum Time Estimate for Programs on Heterogeneous Machines
- A Lookahead Heuristic for Heterogeneous Multiprocessor Scheduling with Communication Costs (Special Issue on Parallel and Distributed Supercomputing)
- An Improved Increase over the Minimum Execution Time of a Parallel Program
- An Efficient Method for Computing All Reducts
- A Hybrid Method of Feature Subset Selection
- Improving Performance of the k-Nearest Neighbor Classifier by Combining Feature Selection with Feature Weighting
- Speeding up String Searching Algorithms for Nonuniform Texts
- On Relationships between Decomposable Programs and Rule Commutative Programs
- Efficient Evaluation of One-directional Cycle-recursive Formulas
- A Performance Measure for the Scheduling of Typed Task Systems with Communication Costs
- Decomposable Programs Revised
- Determining Feature Weight of Pattern Classification by Using Rough Genetic Algorithm and Fuzzy Similarity Measure
- Fast On-line String Searching
- Reliability of a Mobile Communication System with Network Congestion
- Optimizing Linear Recursive Formulas by Detaching Isolated Variables