Sciweavers

234 search results - page 41 / 47
» DBMiner: a system for data mining in relational databases an...
Sort
View
WWW
2011
ACM
13 years 2 months ago
Truthy: mapping the spread of astroturf in microblog streams
Online social media are complementing and in some cases replacing person-to-person social interaction and redefining the diffusion of information. In particular, microblogs have ...
Jacob Ratkiewicz, Michael Conover, Mark Meiss, Bru...
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
13 years 12 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
PETRA
2009
ACM
14 years 2 months ago
Towards faster activity search using embedding-based subsequence matching
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...
Panagiotis Papapetrou, Paul Doliotis, Vassilis Ath...
KDD
1994
ACM
96views Data Mining» more  KDD 1994»
13 years 11 months ago
DICE: A Discovery Environment Integrating Inductive Bias
: Most of Knowledge Discovery in Database (KDD) systems are integrating efficient Machine Learning techniques. In fact issues in Machine Learning and KDD are very close allowing fo...
Jean-Daniel Zucker, Vincent Corruble, J. Thomas, G...
KDD
2009
ACM
152views Data Mining» more  KDD 2009»
14 years 8 months ago
TANGENT: a novel, 'Surprise me', recommendation algorithm
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 ...
Kensuke Onuma, Hanghang Tong, Christos Faloutsos