Sciweavers

697 search results - page 15 / 140
» Approximation of Information Granule Sets
Sort
View
79
Voted
AAAI
2006
15 years 1 months ago
Efficient Active Fusion for Decision-Making via VOI Approximation
Active fusion is a process that purposively selects the most informative information from multiple sources as well as combines these information for achieving a reliable result ef...
Wenhui Liao, Qiang Ji
DAWAK
2008
Springer
15 years 1 months ago
Efficient Approximate Mining of Frequent Patterns over Transactional Data Streams
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
Willie Ng, Manoranjan Dash
ICALP
2009
Springer
15 years 6 months ago
Approximating Decision Trees with Multiway Branches
We consider the problem of constructing decision trees for entity identification from a given table. The input is a table containing information about a set of entities over a fi...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
IDA
2007
Springer
14 years 11 months ago
Approximate mining of frequent patterns on streams
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...
Claudio Silvestri, Salvatore Orlando
FUIN
2002
108views more  FUIN 2002»
14 years 11 months ago
Approximate Entropy Reducts
We use information entropy measure to extend the rough set based notion of a reduct. We introduce the Approximate Entropy Reduction Principle (AERP). It states that any simplificat...
Dominik Slezak