469 search results - page 64 / 94 » Survey of graph database models |
121
click to vote
DASFAA
2007
IEEE
15 years 6 months ago
2007
IEEE
Subspace clustering (also called projected clustering) addresses the problem that different sets of attributes may be relevant for different clusters in high dimensional feature sp...
336
click to vote
CPM
2011
Springer
14 years 3 months ago
2011
Springer
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
In this work we present a novel method to model instance-level constraints within a clustering algorithm. Thereby, both similarity and dissimilarity constraints can be used coeval...
106
click to vote
SSDBM
2010
IEEE
14 years 9 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
WEBDB
2009
Springer
15 years 6 months ago
2009
Springer
We study the problem of schema evolution in the RDF data model. RDF and the RDFS schema language are W3C standards for flexibly modeling and sharing data on the web. Although sch...