Sciweavers

1665 search results - page 141 / 333
» Data Mining for Web Personalization
Sort
View
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
16 years 6 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos
GI
2008
Springer
15 years 7 months ago
A Novel Conceptual Model for Accessing Distributed Data and Applications, as well as Devices
: As data and services are increasingly distributed in the network, rather than stored in a fixed location, one can imagine a scenario in which the Personal Computer, intended as a...
Lucia Terrenghi, Thomas Lang
WISE
2010
Springer
15 years 4 months ago
Neighborhood-Restricted Mining and Weighted Application of Association Rules for Recommenders
Abstract. Association rule mining algorithms such as Apriori were originally developed to automatically detect patterns in sales transactions and were later on also successfully ap...
Fatih Gedikli, Dietmar Jannach
SIGMOD
2008
ACM
144views Database» more  SIGMOD 2008»
16 years 6 months ago
Mining significant graph patterns by leap search
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...
Xifeng Yan, Hong Cheng, Jiawei Han, Philip S. Yu
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 6 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye