Sciweavers

237 search results - page 35 / 48
» Mining Frequent Itemsets Using Re-Usable Data Structure
Sort
View
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 7 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
ASUNAM
2009
IEEE
14 years 2 months ago
Modeling a Store's Product Space as a Social Network
A market basket is a set of products that form a single retail transaction. This purchase data of products can shed important light on how product(s) might influence sales of oth...
Troy Raeder, Nitesh V. Chawla
SP
2008
IEEE
159views Security Privacy» more  SP 2008»
13 years 7 months ago
Inferring neuronal network connectivity from spike data: A temporal data mining approach
Abstract. Understanding the functioning of a neural system in terms of its underlying circuitry is an important problem in neuroscience. Recent developments in electrophysiology an...
Debprakash Patnaik, P. S. Sastry, K. P. Unnikrishn...
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
AI
2003
Springer
14 years 28 days ago
Efficient Mining of Indirect Associations Using HI-Mine
Discovering association rules is one of the important tasks in data mining. While most of the existing algorithms are developed for efficient mining of frequent patterns, it has be...
Qian Wan, Aijun An