Sciweavers

2859 search results - page 367 / 572
» Querying Complex Structured Databases
Sort
View
254
Voted
ICDE
2004
IEEE
179views Database» more  ICDE 2004»
16 years 3 months ago
CrossMine: Efficient Classification Across Multiple Database Relations
Most of today's structured data is stored in relational databases. Such a database consists of multiple relations which are linked together conceptually via entity-relationsh...
Xiaoxin Yin, Jiawei Han, Jiong Yang, Philip S. Yu
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
16 years 2 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
AMFG
2007
IEEE
315views Biometrics» more  AMFG 2007»
15 years 8 months ago
Structured Ordinal Features for Appearance-Based Object Representation
In this paper, we propose a novel appearance-based representation, called Structured Ordinal Feature (SOF). SOF is a binary string encoded by combining eight ordinal blocks in a ci...
ShengCai Liao, Zhen Lei, Stan Z. Li, Xiaotong Yuan...
ILP
1998
Springer
15 years 6 months ago
Learning Structurally Indeterminate Clauses
This paper describes a new kind of language bias, S-structural indeterminate clauses, which takes into account the meaning of predicates that play a key role in the complexity of l...
Jean-Daniel Zucker, Jean-Gabriel Ganascia
SSD
2007
Springer
146views Database» more  SSD 2007»
15 years 8 months ago
Blind Evaluation of Nearest Neighbor Queries Using Space Transformation to Preserve Location Privacy
In this paper we propose a fundamental approach to perform the class of Nearest Neighbor (NN) queries, the core class of queries used in many of the location-based services, withou...
Ali Khoshgozaran, Cyrus Shahabi