Sciweavers

388 search results - page 54 / 78
» Mining Frequent Itemsets Using Support Constraints
Sort
View
ICEIS
2009
IEEE
14 years 2 months ago
NARFO Algorithm: Mining Non-redundant and Generalized Association Rules Based on Fuzzy Ontologies
Traditional approaches for mining generalized association rules are based only on database contents, and focus on exact matches among items. However, in many applications, the use ...
Rafael Garcia Miani, Cristiane A. Yaguinuma, Maril...
CINQ
2004
Springer
131views Database» more  CINQ 2004»
14 years 28 days ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
JCP
2007
148views more  JCP 2007»
13 years 7 months ago
P3ARM-t: Privacy-Preserving Protocol for Association Rule Mining with t Collusion Resistance
— The ability to mine large volumes of distributed datasets enables more precise decision making. However, privacy concerns should be carefully addressed when mining datasets dis...
Iman Saleh, Mohamed Eltoweissy
ICDM
2010
IEEE
201views Data Mining» more  ICDM 2010»
13 years 5 months ago
Mining Closed Strict Episodes
Discovering patterns in a sequence is an important aspect of data mining. One popular choice of such patterns are episodes, patterns in sequential data describing events that often...
Nikolaj Tatti, Boris Cule
HPCC
2007
Springer
14 years 1 months ago
A Data Imputation Model in Sensor Databases
Data missing is a common problem in database query processing, which can cause bias or lead to inefficient analyses, and this problem happens more often in sensor databases. The re...
Nan Jiang