1913 search results - page 280 / 383 » Using Data Mining in MURA Graphic Problems |
158
click to vote
PODS
2006
ACM
16 years 3 months ago
2006
ACM
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 ...
113
Voted
ICDE
2007
IEEE
15 years 9 months ago
2007
IEEE
In frequent geographic pattern mining a large amount of patterns can be non-novel and non-interesting. This problem has been addressed recently, and background knowledge is used t...
158
Voted
PETRA
2009
ACM
15 years 10 months ago
2009
ACM
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
120
Voted
KDD
2009
ACM
16 years 4 months ago
2009
ACM
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...
141
Voted
KDD
2009
ACM
16 years 4 months ago
2009
ACM
We describe a recommender system in the domain of grocery shopping. While recommender systems have been widely studied, this is mostly in relation to leisure products (e.g. movies...