Sciweavers

501 search results - page 39 / 101
» Rough Sets
Sort
View
LATIN
2010
Springer
14 years 2 months ago
Layered Working-Set Trees
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
FOCI
2007
IEEE
13 years 11 months ago
Conflict Analysis Based on Discernibility and Indiscernibility
Abstract-- The dual notions of discernibility and indiscernibility play an important role in intelligent data analysis. While discernibility focuses on the differences, the indisce...
Yiyu Yao, Yan Zhao
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
PRL
2006
121views more  PRL 2006»
13 years 7 months ago
Information-preserving hybrid data reduction based on fuzzy-rough techniques
Data reduction plays an important role in machine learning and pattern recognition with a high-dimensional data. In real-world applications data usually exists with hybrid formats...
Qinghua Hu, Daren Yu, Zongxia Xie
IJCNN
2000
IEEE
14 years 3 days ago
The Inefficiency of Batch Training for Large Training Sets
Multilayer perceptrons are often trained using error backpropagation (BP). BP training can be done in either a batch or continuous manner. Claims have frequently been made that bat...
D. Randall Wilson, Tony R. Martinez