Zobrazeno 1 - 10
of 258
pro vyhledávání: '"Roberto J. Bayardo"'
Publikováno v:
Proceedings of the VLDB Endowment. 2:1426-1437
Classification and regression tree learning on massive datasets is a common data mining task at Google, yet many state of the art tree learning algorithms require training data to reside in memory on a single machine. While more scalable implementati
Publikováno v:
VLDB
We address the problem of providing privacy-preserving search over distributed access-controlled content. Indexed documents can be easily reconstructed from conventional (inverted) indexes used in search. The need to avoid breaches of access-control
Publikováno v:
Data Mining and Knowledge Discovery. 4:217-240
Constraint-based rule miners find all rules in a given data-set meeting user-specified constraints such as minimum support and confidence. We describe a new algorithm that directly exploits all user-specified constraints including minimum support, mi
Autor:
Roberto J. Bayardo
Publikováno v:
SIGMOD Conference
We present a pattern-mining algorithm that scales roughly linearly in the number of maximal patterns embedded in a database irrespective of the length of the longest pattern. In comparison, previous algorithms based on Apriori scale exponentially wit
Autor:
Roberto J. Bayardo, W. Bohrer, Amy Unruh, Marek Rusinkiewicz, Tomasz Ksiezyk, R. Shea, Abdelsalam Helal, Fowler J, Darrell Woelk, Vipul Kashyap, Mosfeq Rashid, Gale L. Martin, Andrzej Cichocki, C. Unnikrishnan, Marian H. Nodine, Richard S. Brice
Publikováno v:
ACM SIGMOD Record. 26:195-206
The goal of the InfoSleuth project at MCC is to exploit and synthesize new technologies into a unified system that retrieves and processes information in an ever-changing network of information sources. InfoSleuth has its roots in the Carnot project
Autor:
Daniel P. Miranker, Roberto J. Bayardo
Publikováno v:
Artificial Intelligence. 71:159-181
This paper presents and evaluates an optimal backtrack algorithm for solving tree-structured constraint satisfaction problems—a subset of constraint satisfaction problems which can be solved in linear time. Previous algorithms which solve these pro
Autor:
Roberto J. Bayardo, Biswanath Panda
Publikováno v:
Proceedings of the 2011 SIAM International Conference on Data Mining.
Publikováno v:
KDD
This paper explores an important and relatively unstudied quality measure of a sponsored search advertisement: bounce rate. The bounce rate of an ad can be informally defined as the fraction of users who click on the ad but almost immediately move on
Publikováno v:
WWW
Given a large collection of sparse vector data in a high dimensional space, we investigate the problem of finding all pairs of vectors whose similarity score (as determined by a function such as cosine distance) is above a given threshold. We propose