Sciweavers

98 search results - page 19 / 20
» Parallel Mining of Maximal Frequent Itemsets from Databases
Sort
View
PKDD
2010
Springer
124views Data Mining» more  PKDD 2010»
13 years 3 months ago
Summarising Data by Clustering Items
Abstract. For a book, the title and abstract provide a good first impression of what to expect from it. For a database, getting a first impression is not so straightforward. Whil...
Michael Mampaey, Jilles Vreeken
WWW
2004
ACM
14 years 6 months ago
On mining webclick streams for path traversal patterns
Mining user access patterns from a continuous stream of Web-clicks presents new challenges over traditional Web usage mining in a large static Web-click database. Modeling user ac...
Hua-Fu Li, Suh-Yin Lee, Man-Kwan Shan
DSS
2007
226views more  DSS 2007»
13 years 5 months ago
Dare to share: Protecting sensitive knowledge with data sanitization
chool of Business Research – FY 2007 Research Abstracts Dare to Share: Protecting Sensitive Knowledge with Data Sanitization Data sanitization is a process that is used to promot...
Ali Amiri
ICDE
2008
IEEE
154views Database» more  ICDE 2008»
14 years 6 months ago
Butterfly: Protecting Output Privacy in Stream Mining
Abstract-- Privacy preservation in data mining demands protecting both input and output privacy. The former refers to sanitizing the raw data itself before performing mining. The l...
Ting Wang, Ling Liu
FPL
2008
Springer
122views Hardware» more  FPL 2008»
13 years 7 months ago
Mining Association Rules with systolic trees
Association Rules Mining (ARM) algorithms are designed to find sets of frequently occurring items in large databases. ARM applications have found their way into a variety of field...
Song Sun, Joseph Zambreno