Sciweavers

306 search results - page 13 / 62
» Mining tree queries in a graph
Sort
View
IPL
2010
71views more  IPL 2010»
13 years 6 months ago
New common ancestor problems in trees and directed acyclic graphs
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
Johannes Fischer, Daniel H. Huson
PKDD
2007
Springer
107views Data Mining» more  PKDD 2007»
14 years 2 months ago
An Empirical Comparison of Exact Nearest Neighbour Algorithms
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
Ashraf M. Kibriya, Eibe Frank
CIKM
2009
Springer
13 years 12 months ago
Efficient processing of group-oriented connection queries in a large graph
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
James Cheng, Yiping Ke, Wilfred Ng
PSD
2004
Springer
186views Database» more  PSD 2004»
14 years 1 months ago
Privacy Preserving and Data Mining in an On-Line Statistical Database of Additive Type
In an on-line statistical database, the query-answering system should prevent answers to statistical queries from leading to disclosure of confidential data. On the other hand, a s...
Francesco M. Malvestuto, Mauro Mezzini
ICDE
2008
IEEE
153views Database» more  ICDE 2008»
14 years 9 months ago
Mining Views: Database Views for Data Mining
We present a system towards the integration of data mining into relational databases. To this end, a relational database model is proposed, based on the so called virtual mining vi...
Élisa Fromont, Adriana Prado, Bart Goethals...