Sciweavers

306 search results - page 24 / 62
» Mining tree queries in a graph
Sort
View
ICDM
2009
IEEE
124views Data Mining» more  ICDM 2009»
13 years 5 months ago
A Practical Differentially Private Random Decision Tree Classifier
In this paper, we study the problem of constructing private classifiers using decision trees, within the framework of differential privacy. We first construct privacy-preserving ID...
Geetha Jagannathan, Krishnan Pillaipakkamnatt, Reb...
ICDM
2009
IEEE
211views Data Mining» more  ICDM 2009»
14 years 2 months ago
Discovering Organizational Structure in Dynamic Social Network
—Applying the concept of organizational structure to social network analysis may well represent the power of members and the scope of their power in a social network. In this pap...
Jiangtao Qiu, Zhangxi Lin, Changjie Tang, Shaojie ...
DAWAK
2003
Springer
14 years 1 months ago
Computing SQL Queries with Boolean Aggregates
We introduce a new method for optimization of SQL queries with nested subqueries. The method is based on the idea of Boolean aggregates, aggregates that compute the conjunction or ...
Antonio Badia
ESOP
2009
Springer
13 years 11 months ago
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Hao Yuan, Patrick Th. Eugster
CIKM
2008
Springer
13 years 10 months ago
Learning latent semantic relations from clickthrough data for query suggestion
For a given query raised by a specific user, the Query Suggestion technique aims to recommend relevant queries which potentially suit the information needs of that user. Due to th...
Hao Ma, Haixuan Yang, Irwin King, Michael R. Lyu