Sciweavers

987 search results - page 31 / 198
» A new Informative Generic Base of Association Rules
Sort
View
GRC
2005
IEEE
14 years 1 months ago
Improved rule based rough set approach for target recognition
An incremental target recognition algorithm based on improved discernibility matrix in rough set theory is presented. We compare the new approach with our previous nonincremental a...
Yong Liu, Congfu Xu, Zhiyong Yan, Yunhe Pan
CIT
2004
Springer
14 years 28 days ago
Associativity Based Mobility-Adaptive K-Clustering in Mobile Ad-Hoc Networks
To solve the scalability issue of ad hoc network, a new cluster maintenance protocol is proposed. Clusters may change dynamically, reflecting the mobility of the underlying networ...
Chinnappan Jayakumar, Chenniappan Chellappan
DAWAK
2000
Springer
13 years 12 months ago
Mining Frequent Binary Expressions
In data mining, searching for frequent patterns is a common basic operation. It forms the basis of many interesting decision support processes. In this paper we present a new type ...
Toon Calders, Jan Paredaens
AI
2003
Springer
14 years 23 days ago
Efficient Mining of Indirect Associations Using HI-Mine
Discovering association rules is one of the important tasks in data mining. While most of the existing algorithms are developed for efficient mining of frequent patterns, it has be...
Qian Wan, Aijun An
JCIT
2007
107views more  JCIT 2007»
13 years 7 months ago
A New Approach to Computing Weighted Attributes Values in Incomplete Information Systems
The Rough Sets theory has been conceived to deal with inexact, uncertain or vague knowledge in Information systems. The article is devoted to propose notions including the general...
Tian Hong, Wang Xiukun, Henryk Rybinski