Sciweavers

1116 search results - page 156 / 224
» Domination Mining and Querying
Sort
View
SIGMOD
2004
ACM
162views Database» more  SIGMOD 2004»
14 years 10 months ago
Graph Indexing: A Frequent Structure-based Approach
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is...
Xifeng Yan, Philip S. Yu, Jiawei Han
KDD
2000
ACM
153views Data Mining» more  KDD 2000»
14 years 1 months ago
The generalized Bayesian committee machine
In this paper we introduce the Generalized Bayesian Committee Machine (GBCM) for applications with large data sets. In particular, the GBCM can be used in the context of kernel ba...
Volker Tresp
KDD
2006
ACM
132views Data Mining» more  KDD 2006»
14 years 10 months ago
Utility-based anonymization using local recoding
Privacy becomes a more and more serious concern in applications involving microdata. Recently, efficient anonymization has attracted much research work. Most of the previous metho...
Jian Xu, Wei Wang 0009, Jian Pei, Xiaoyuan Wang, B...
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
12 years 15 days ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
SIGIR
2008
ACM
13 years 10 months ago
Towards breaking the quality curse.: a web-querying approach to web people search
Searching for people on the Web is one of the most common query types to the web search engines today. However, when a person name is queried, the returned webpages often contain ...
Dmitri V. Kalashnikov, Rabia Nuray-Turan, Sharad M...