Routing Attribute Data Mining Based on Rough Set Theory

2008 ◽  
pp. 3033-3048 ◽  
Author(s):  
Yanbing Liu ◽  
Shixin Sun ◽  
Menghao Wang ◽  
Hong Tang
Keyword(s):  
Data Mining ◽  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Attribute Selection ◽  
Attribute Data ◽  
Data Mining Approach ◽  
New Information

QOSPF(Quality of Service Open Shortest Path First)based on QoS routing has been recognized as a missing piece in the evolution of QoS-based services in the Internet. Data mining has emerged as a tool for data analysis, discovery of new information, and autonomous decision-making. This paper focuses on routing algorithms and their applications for computing QoS routes in OSPF protocol. The proposed approach is based on a data mining approach using rough set theory, for which the attribute-value system about links of networks is created from network topology. Rough set theory of-fers a knowledge discovery approach to extracting routing-decisions from attribute set. The extracted rules can then be used to select significant routing-attributes and make routing-selections in routers. A case study is conducted to demonstrate that rough set theory is effective in finding the most significant attribute set. It is shown that the algo-rithm based on data mining and rough set offers a promising approach to the attribute-selection problem in internet routing.

Routing Attribute Data Mining Based on Rough Set Theory

2011 ◽  
pp. 322-337
Author(s):  
Yanbing Liu ◽  
Menghao Wang ◽  
Jong Tang
Keyword(s):  
Data Mining ◽  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Attribute Selection ◽  
Attribute Data ◽  
Data Mining Approach ◽  
New Information

QOSPF (Quality of Service Open Shortest Path First) based on QoS routing has been recognized as a missing piece in the evolution of QoS-based services on the Internet. Data mining has emerged as a tool for data analysis, discovery of new information, and autonomous decision making. This article focuses on routing algorithms and their applications for computing QoS routes in OSPF protocol. The proposed approach is based on a data mining approach using rough set theory, for which the attribute-value system about links of networks is created from network topology. Rough set theory offers a knowledge discovery approach toextracting routing decisions from attribute set. The extracted rules then can be used to select significant routing attributes and to make routing selections in routers. A case study is conducted in order to demonstrate that rough set theory is effective in finding the most significant attribute set. It is shown that the algorithm based on data mining and rough set offers a promising approach to the attribute selection problem in Internet routing.

Fuzzy Miner

2011 ◽  
pp. 299-321 ◽  
Author(s):  
Nikos Pelekis ◽  
Babis Theodoulidis ◽  
Ioannis Kopanakis ◽  
Yannis Theodoridis
Keyword(s):  
Data Mining ◽  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Attribute Selection ◽  
Internet Routing ◽  
Data Mining Approach ◽  
New Information

QOSP Quality of Service Open Shortest Path First based on QoS routing has been recognized as a missing piece in the evolution of QoS-based services in the Internet. Data mining has emerged as a tool for data analysis, discovery of new information, and autonomous decision-making. This paper focuses on routing algorithms and their appli-cations for computing QoS routes in OSPF protocol. The proposed approach is based on a data mining approach using rough set theory, for which the attribute-value system about links of networks is created from network topology. Rough set theory offers a knowledge discovery approach to extracting routing-decisions from attribute set. The extracted rules can then be used to select significant routing-attributes and make routing-selections in routers. A case study is conducted to demonstrate that rough set theory is effective in finding the most significant attribute set. It is shown that the algorithm based on data mining and rough set offers a promising approach to the attribute-selection prob-lem in internet routing.

Routing Attribute Data Mining Based on Rough Set Theory

2006 ◽  
Vol 2 (3) ◽  
pp. 27-41
Author(s):  
Yanbing Liu ◽  
Shixin Sun ◽  
Menghao Wang ◽  
Hong Tang
Keyword(s):  
Data Mining ◽  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Attribute Data

scholarly journals A combined data mining approach using rough set theory and case-based reasoning in medical datasets

2014 ◽  
Vol 3 (3) ◽  
pp. 285-294 ◽  
Author(s):  
Mohammad Taghi Rezvan ◽  
Ali Zeinal Hamadani ◽  
Babak Saffari ◽  
Ali Shalbafzadeh
Keyword(s):  
Data Mining ◽  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Case Based Reasoning ◽  
Data Mining Approach ◽  
Case Based ◽  
Combined Data

Rough Sets and Boolean Reasoning

2011 ◽  
pp. 38-69 ◽  
Author(s):  
Hung Son Nguyen
Keyword(s):  
Data Mining ◽  
Problem Solving ◽  
Set Theory ◽  
Rough Set ◽  
Rough Sets ◽  
Rough Set Theory ◽  
Decision Rules ◽  
Approximate Reasoning ◽  
Computational Time

This chapter presents the Boolean reasoning approach to problem solving and its applications in Rough sets. The Boolean reasoning approach has become a powerful tool for designing effective and accurate solutions for many problems in decision-making, approximate reasoning and optimization. In recent years, Boolean reasoning has become a recognized technique for developing many interesting concept approximation methods in rough set theory. This chapter presents a general framework for concept approximation by combining the classical Boolean reasoning method with many modern techniques in machine learning and data mining. This modified approach - called “the approximate Boolean reasoning” methodology - has been proposed as an even more powerful tool for problem solving in rough set theory and its applications in data mining. Through some most representative applications in many KDD problems including feature selection, feature extraction, data preprocessing, classification of decision rules and decision trees, association analysis, the author hopes to convince that the proposed approach not only maintains all the merits of its antecedent but also owns the possibility of balancing between quality of the designed solution and its computational time.

Sign in / Sign up

Export Citation Format

Share Document