Sciweavers

58 search results - page 11 / 12
» Mining Closed Itemsets in Data Stream Using Formal Concept A...
Sort
View
FM
2001
Springer
108views Formal Methods» more  FM 2001»
13 years 10 months ago
Improvements in BDD-Based Reachability Analysis of Timed Automata
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
Dirk Beyer
PODS
2010
ACM
215views Database» more  PODS 2010»
13 years 10 months ago
An optimal algorithm for the distinct elements problem
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
ICTAI
2007
IEEE
13 years 11 months ago
Establishing Logical Rules from Empirical Data
We review a method of generating logical rules, or axioms, from empirical data. This method, using closed set properties of formal concept analysis, has been previously described ...
John L. Pfaltz
PKDD
2010
Springer
153views Data Mining» more  PKDD 2010»
13 years 3 months ago
A Robustness Measure of Association Rules
Abstract. We propose a formal definition of the robustness of association rules for interestingness measures. It is a central concept in the evaluation of the rules and has only be...
Yannick Le Bras, Patrick Meyer, Philippe Lenca, St...
WSDM
2012
ACM
300views Data Mining» more  WSDM 2012»
12 years 1 months ago
Adding semantics to microblog posts
Microblogs have become an important source of information for the purpose of marketing, intelligence, and reputation management. Streams of microblogs are of great value because o...
Edgar Meij, Wouter Weerkamp, Maarten de Rijke