Sciweavers

584 search results - page 78 / 117
» Perspectives on Transactional Memory
Sort
View
FIMI
2003
123views Data Mining» more  FIMI 2003»
13 years 9 months ago
Apriori, A Depth First Implementation
We will discuss , the depth first implementation of APRIORI as devised in 1999 (see [8]). Given a database, this algorithm builds a trie in memory that contains all frequent item...
Walter A. Kosters, Wim Pijls
IDA
2007
Springer
13 years 7 months ago
Approximate mining of frequent patterns on streams
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...
Claudio Silvestri, Salvatore Orlando
CIS
2005
Springer
14 years 1 months ago
A New Conceptual Framework Within Information Privacy: Meta Privacy
When considering information security and privacy issues most of the attention has previously focussed on data protection and the privacy of personally identifiable information (PI...
Geoff Skinner, Song Han, Elizabeth Chang
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
13 years 11 months ago
Scalable Parallel Data Mining for Association Rules
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
Eui-Hong Han, George Karypis, Vipin Kumar
ITCC
2005
IEEE
14 years 1 months ago
Impact of Java Compressed Heap on Mobile/Wireless Communication
M-commerce has shown up as e-commerce in mobile and wireless communication, and now deals with on-line banking, stock trading, auctions, transactions, and mobile media. M-commerce...
Mayumi Kato, Chia-Tien Dan Lo