Sciweavers

1998 search results - page 242 / 400
» Basic Association Rules
Sort
View
123
Voted
KDD
2002
ACM
173views Data Mining» more  KDD 2002»
16 years 3 months ago
LumberJack: Intelligent Discovery and Analysis of Web User Traffic Composition
Web Usage Mining enables new understanding of user goals on the Web. This understanding has broad applications, and traditional mining techniques such as association rules have bee...
Ed Huai-hsin Chi, Adam Rosien, Jeffrey Heer
210
Voted
VLDB
2008
ACM
147views Database» more  VLDB 2008»
16 years 2 months ago
Providing k-anonymity in data mining
In this paper we present extended definitions of k-anonymity and use them to prove that a given data mining model does not violate the k-anonymity of the individuals represented in...
Arik Friedman, Ran Wolff, Assaf Schuster
ICSE
2004
IEEE-ACM
16 years 2 months ago
Mining Version Histories to Guide Software Changes
We apply data mining to version histories in order to guide programmers along related changes: "Programmers who changed these functions also changed...." Given a set of e...
Andreas Zeller, Peter Weißgerber, Stephan Di...
119
Voted
ASUNAM
2009
IEEE
15 years 9 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
126
Voted
TPHOL
2009
IEEE
15 years 9 months ago
Formalising FinFuns - Generating Code for Functions as Data from Isabelle/HOL
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
Andreas Lochbihler