Results 1  10
of
288
Mining maximal generalized frequent geographic patterns with knowledge constraints
 In ICDM
, 2006
"... bart.kuijpers @ uhasselt.be In frequent geographic pattern mining a large amount of patterns is well known a priori. This paper presents a novel approach for mining frequent geographic patterns without associations that are previously known as noninteresting. Geographic dependences are eliminated du ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
bart.kuijpers @ uhasselt.be In frequent geographic pattern mining a large amount of patterns is well known a priori. This paper presents a novel approach for mining frequent geographic patterns without associations that are previously known as noninteresting. Geographic dependences are eliminated
Mining the Data Cube for Improving its Scheme (Extended Abstract)
"... ) Stijn Dekeyser Bart Kuijpers Jan Paredaens Universiteit Antwerpen (UIA) Jef Wijsen y Vrije Universiteit Brussel (VUB) z Abstract The integration of data mining, data warehousing, and OLAP is an important research direction Han [4] uses the term OLAP mining in this respect. Data warehouse ..."
Abstract
 Add to MetaCart
) Stijn Dekeyser Bart Kuijpers Jan Paredaens Universiteit Antwerpen (UIA) Jef Wijsen y Vrije Universiteit Brussel (VUB) z Abstract The integration of data mining, data warehousing, and OLAP is an important research direction Han [4] uses the term OLAP mining in this respect. Data
Faculty of Technical Physics Group Physics of Nanostructures
, 1998
"... Characterisation of nonmagnetic and ferromagnetic tunnel junctions N.C.W. Kuijpers ..."
Abstract
 Add to MetaCart
Characterisation of nonmagnetic and ferromagnetic tunnel junctions N.C.W. Kuijpers
A model for enriching trajectories with semantic geographical information
 in ‘ACMGIS’, ACM
, 2007
"... The collection of moving object data is becoming more and more common, and therefore there is an increasing need for the efficient analysis and knowledge extraction of these data in different application domains. Trajectory data are normally available as sample points, and do not carry semantic info ..."
Abstract

Cited by 49 (8 self)
 Add to MetaCart
The collection of moving object data is becoming more and more common, and therefore there is an increasing need for the efficient analysis and knowledge extraction of these data in different application domains. Trajectory data are normally available as sample points, and do not carry semantic information, which is of fundamental importance for the comprehension of these data. Therefore, the analysis of trajectory data becomes expensive from a computational point of view and complex from a user’s perspective. Enriching trajectories with semantic geographical information may simplify queries, analysis, and mining of moving object data. In this paper we propose a data preprocessing model to add semantic information to trajectories in order to facilitate trajectory data analysis in different application domains. The model is generic enough to represent the important parts of trajectories that are relevant to the application, not being restricted to one specific application. We present an algorithm to compute the important parts and show that the query complexity for the semantic analysis of trajectories will be significantly reduced with the proposed model.
Firstorder queries on finite structures over the reals
"... We investigate properties of finite relational structures over the reals expressed by firstorder sentences whose predicates are the relations of the structure plus arbitrary polynomial inequalities, and whose quantifiers can range over the whole set of reals. In constraint programming terminology, ..."
Abstract

Cited by 33 (2 self)
 Add to MetaCart
We investigate properties of finite relational structures over the reals expressed by firstorder sentences whose predicates are the relations of the structure plus arbitrary polynomial inequalities, and whose quantifiers can range over the whole set of reals. In constraint programming terminology, this corresponds to Boolean real polynomial constraint queries on finite structures. The fact that quantifiers range over all reals seems crucial � however, we observe that each sentence in the firstorder theory of the reals can be evaluated by letting each quantifier range over only a finite set of real numbers without changing its truth value. Inspired by this observation, we then show that when all polynomials used are linear, each query can be expressed uniformly on all finite structures by a sentence of which the quantifiers range only over the finite domain of the structure. In other words, linear constraint programming on finite structures can be reduced to ordinary query evaluation as usual in finite model theory and databases. Moreover, if only "generic" queries are taken into consideration, we show that this can be reduced even further by proving that such
The polycentric urban region: towards a research agenda
 Urban Studies
, 2001
"... Polycentrism, basically denoting the existence of multiple centres in one area, seems to have become one of the de ning characteristics of the urban landscape in advanced econ ..."
Abstract

Cited by 32 (0 self)
 Add to MetaCart
Polycentrism, basically denoting the existence of multiple centres in one area, seems to have become one of the de ning characteristics of the urban landscape in advanced econ
Spatial Databases, The Final Frontier
, 1995
"... This paper is divided into two parts. In Section 1 we discuss five different geomatic data models. All of them are intentional, i.e. they give a finite representation of the mostly infinite and even nonenumerable 2 set of points of the spatial objects that are described by the database. In the Ras ..."
Abstract

Cited by 27 (1 self)
 Add to MetaCart
This paper is divided into two parts. In Section 1 we discuss five different geomatic data models. All of them are intentional, i.e. they give a finite representation of the mostly infinite and even nonenumerable 2 set of points of the spatial objects that are described by the database. In the Raster Model an object is given by a finite number of its points. These points are equally distributed following an easy geometric pattern, which is normally a square. In the Spaghetti Model an object is intentionally deduced from its contour, which is a polyline. The Peano Model also uses a finite number of objectpoints, but here these points are distributed nonuniformally, according to the form of the object. This distribution method is based on the wellknown Peano curve. In the Polynomial Model we use a calculus, extended with comparisons between polynomials. In the PLAModel, finally, only some kind of topological information is handled without dealing with the exact position and form of the spatial objects. In Section 2 we try to focus on the typical geomatic operations and we introduce different kinds of spatial queries. Therefore we generalize the wellknown concept of genericity of Chandra and Harel [Cha80]. A taxonomy of genericityclasses is given. We end with investigating two of these classes more deeply: the isometrygeneric queries and the topologygeneric queries. On many occasions we will introduce open problems, open areas or topics that have to be studied. We are convinced that a lot of research has to be done in the field of geomatic data types and geomatic operations and we hope that this text can motivate some of the young and intelligent researchers to pay more attention in the future to this unexplored forest that is irrigated by three main rivers: geo...
On Topological Elementary Equivalence of Spatial Databases
 In ICDT'97
, 1997
"... . We consider spatial databases and queries definable using firstorder logic and real polynomial inequalities. We are interested in topological queries: queries whose result only depends on the topological aspects of the spatial data. Two spatial databases are called topologically elementary equiva ..."
Abstract

Cited by 24 (4 self)
 Add to MetaCart
. We consider spatial databases and queries definable using firstorder logic and real polynomial inequalities. We are interested in topological queries: queries whose result only depends on the topological aspects of the spatial data. Two spatial databases are called topologically elementary equivalent if they cannot be distinguished by such topological firstorder queries. Our contribution is a natural and effective characterization of topological elementary equivalence of closed databases in the real plane. As far as topological elementary equivalence is concerned, it does not matter whether we use firstorder logic with full polynomial inequalities, or firstorder logic with simple order comparisons only. 1 Introduction and summary Spatial database systems [5, 12, 1, 9] are concerned with the representation and manipulation of data that have a geometrical or topological interpretation. In this paper, we are interested in planar spatial databases; the conceptual view of such a data...
Visual Computing
"... Germany) Information semantics and its implications for geographical analysis ..."
Abstract
 Add to MetaCart
Germany) Information semantics and its implications for geographical analysis
Results 1  10
of
288