41,209 research outputs found
Covering rough sets based on neighborhoods: An approach without using neighborhoods
Rough set theory, a mathematical tool to deal with inexact or uncertain
knowledge in information systems, has originally described the indiscernibility
of elements by equivalence relations. Covering rough sets are a natural
extension of classical rough sets by relaxing the partitions arising from
equivalence relations to coverings. Recently, some topological concepts such as
neighborhood have been applied to covering rough sets. In this paper, we
further investigate the covering rough sets based on neighborhoods by
approximation operations. We show that the upper approximation based on
neighborhoods can be defined equivalently without using neighborhoods. To
analyze the coverings themselves, we introduce unary and composition operations
on coverings. A notion of homomorphismis provided to relate two covering
approximation spaces. We also examine the properties of approximations
preserved by the operations and homomorphisms, respectively.Comment: 13 pages; to appear in International Journal of Approximate Reasonin
Fuzzy stability analysis of regenerative chatter in milling
During machining, unstable self-excited vibrations known as regenerative chatter can occur, causing excessive tool wear or failure, and a poor surface finish on the machined workpiece. Consequently it is desirable to predict, and hence avoid the onset of this instability. Regenerative chatter is a function of empirical cutting coefficients, and the structural dynamics of the machine-tool system. There can be significant uncertainties in the underlying parameters, so the predicted stability limits do not necessarily agree with those found in practice. In the present study, fuzzy arithmetic techniques are applied to the chatter stability problem. It is first shown that techniques based upon interval arithmetic are not suitable for this problem due to the issue of recursiveness. An implementation of fuzzy arithmetic is then developed based upon the work of Hanss and Klimke. The arithmetic is then applied to two techniques for predicting milling chatter stability: the classical approach of Altintas, and the time-finite element method of Mann. It is shown that for some cases careful programming can reduce the computational effort to acceptable levels. The problem of milling chatter uncertainty is then considered within the framework of Ben-Haim's information-gap theory. It is shown that the presented approach can be used to solve process design problems with robustness to the uncertain parameters. The fuzzy stability bounds are then compared to previously published data, to investigate how uncertainty propagation techniques can offer more insight into the accuracy of chatter predictions
Generation of Explicit Knowledge from Empirical Data through Pruning of Trainable Neural Networks
This paper presents a generalized technology of extraction of explicit
knowledge from data. The main ideas are 1) maximal reduction of network
complexity (not only removal of neurons or synapses, but removal all the
unnecessary elements and signals and reduction of the complexity of elements),
2) using of adjustable and flexible pruning process (the pruning sequence
shouldn't be predetermined - the user should have a possibility to prune
network on his own way in order to achieve a desired network structure for the
purpose of extraction of rules of desired type and form), and 3) extraction of
rules not in predetermined but any desired form. Some considerations and notes
about network architecture and training process and applicability of currently
developed pruning techniques and rule extraction algorithms are discussed. This
technology, being developed by us for more than 10 years, allowed us to create
dozens of knowledge-based expert systems. In this paper we present a
generalized three-step technology of extraction of explicit knowledge from
empirical data.Comment: 9 pages, The talk was given at the IJCNN '99 (Washington DC, July
1999
- …