Sciweavers

374 search results - page 33 / 75
» New Algorithms for Fast Discovery of Association Rules
Sort
View
SIPS
2007
IEEE
15 years 4 months ago
A New Video Compression Scheme Combining Conditional Replenishment and Address Event Representation
A novel video compression scheme is presented in this paper. This algorithm is implemented based on a conditional replenishment Address Event Representation (AER) imager, where im...
Harry. L. Hu, Amine Bermak, Dominique Martinez
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
15 years 10 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
EUSFLAT
2007
103views Fuzzy Logic» more  EUSFLAT 2007»
14 years 11 months ago
Measuring Variation Strength in Gradual Dependencies
In this paper we extend a previous definition of gradual dependence as a special kind of (crisp) association rule, in order to measure not only the existence of a tendency, but i...
Carlos Molina, José-María Serrano, D...
ITCC
2000
IEEE
15 years 2 months ago
Towards Knowledge Discovery from WWW Log Data
As the result of interactions between visitors and a web site, an http log file contains very rich knowledge about users on-site behaviors, which, if fully exploited, can better c...
Feng Tao, Fionn Murtagh
JCIT
2007
107views more  JCIT 2007»
14 years 9 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