Sciweavers

174 search results - page 27 / 35
» Probabilistic frequent itemset mining in uncertain databases
Sort
View
DAWAK
2006
Springer
13 years 9 months ago
COBRA: Closed Sequential Pattern Mining Using Bi-phase Reduction Approach
Sequential pattern mining aims to find frequent patterns (guarded by a minimum support) in a database of sequences. As the support decreases the number of sequential patterns will...
Kuo-Yu Huang, Chia-Hui Chang, Jiun-Hung Tung, Chen...
DEXA
2004
Springer
153views Database» more  DEXA 2004»
14 years 1 months ago
A New Approach of Eliminating Redundant Association Rules
Two important constraints of association rule mining algorithm are support and confidence. However, such constraints-based algorithms generally produce a large number of redundant ...
Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith
PAKDD
2009
ACM
103views Data Mining» more  PAKDD 2009»
14 years 2 months ago
Hot Item Detection in Uncertain Data
Abstract. An object o of a database D is called a hot item, if there is a sufficiently large population of other objects in D that are similar to o. In other words, hot items are ...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...
TKDE
2010
274views more  TKDE 2010»
13 years 6 months ago
Ranked Query Processing in Uncertain Databases
—Recently, many new applications, such as sensor data monitoring and mobile device tracking, raise up the issue of uncertain data management. Compared to “certain” data, the ...
Xiang Lian, Lei Chen 0002
MLDM
2007
Springer
14 years 1 months ago
Mining Frequent Trajectories of Moving Objects for Location Prediction
Advances in wireless and mobile technology flood us with amounts of moving object data that preclude all means of manual data processing. The volume of data gathered from position...
Mikolaj Morzy