Determining Feature Weight of Pattern Classification by Using Rough Genetic Algorithm and Fuzzy Similarity Measure
スポンサーリンク
概要
- 論文の詳細を見る
The nearest neighbor (NN) methods solve classification problem by storing examples as points in a feature space, which requires some means of measuring distances between examples. However, it suffers from the existence of noisy attributes. One resolution is to modify the distance of similarity degree using attribute weights, which can not only decrease the influence of noisy attributes, but also subset relevant attributes. In this paper,a rough genetic algorithm (RGA) proposed by Lingras and Davies is applied to the classification problem under an undetermined environment, based on a fuzzy distance function by calculating attribute weights. The RGA can complement the existing tools developed in rough computing. Computational experiments are conducted on benchmark problems, downloaded from UCI machine learning databases. Experimental results,compared with a usual GA[1] and the C4.5 algorithms, verify the efficiency of the developed algorithm. Furthermore, the weights learned by the proposed learning method is applicable to not only fuzzy similarity functions but also any similarity functions. As an application, a new distance metric, weighted discretized value difference metric (WDVDM), is proposed. Experimental results show that the WDVDM improves the discretized value difference metric (DVDM).
- 日本知能情報ファジィ学会の論文
- 2002-06-15
著者
-
Ishii Naohiro
Department Of Intelligence And Computer Science Nagoya Institute Of Technology
-
Ding S
Department Of Intelligence And Computer Science Nagoya Institute Of Technology
-
Ding Shan
Department Of Physiology Faculty Of Medicine Kagoshima University
-
Ishii Naohiro
Department Of Electrical Engineering And Computer Science Nagoya Institute Of Technology
-
Ding Shan
Department of Intelligence and Computer Science, Nagoya Institute of Technology
関連論文
- 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
- Cloning and Expression of the Ca^ Channel α_ and β_ Subunits from Guinea Pig Heart^1
- 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