Articles liés à ANTIPOLE TREE INDEXING AND GRAPHGREPVF: DATA STRUCTURES...
ANTIPOLE TREE INDEXING AND GRAPHGREPVF: DATA STRUCTURES AND ALGORITHMS FOR OPTIMIZATION AND SEARCHING PROBLEMS IN METRIC SPACES AND GRAPHS - Couverture souple
Synopsis
There has been increasing interest in building search/index structures to perform similarity search over high-dimensional data, e.g., image databases, document collections, time-series databases, and genome databases. A similarity search problem involves a collection of objects (e.g., documents, images) which are characterized by a collection of relevant features and represented as points in a high-dimensional attribute space. The first part of this book will present a new hierarchical clustering algorithm called Antipole Clustering. The algorithm partitions the set of data objects in clusters such that each one has diameter approximately less than a given value. The algorithm returns a tree structure called Antipole Tree in which the leaves are the final clusters. The second part of this book will present, GraphGrepVF, an application-independent method for querying a database of graphs in order to find all the occurrences of a given subgraph. Many applications in industry, science and engineering share this problem, and increasing the size of the database requires efficient structure searching algorithms.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Présentation de l'éditeur
There has been increasing interest in building search/index structures to perform similarity search over high-dimensional data, e.g., image databases, document collections, time-series databases, and genome databases. A similarity search problem involves a collection of objects (e.g., documents, images) which are characterized by a collection of relevant features and represented as points in a high-dimensional attribute space. The first part of this book will present a new hierarchical clustering algorithm called Antipole Clustering. The algorithm partitions the set of data objects in clusters such that each one has diameter approximately less than a given value. The algorithm returns a tree structure called Antipole Tree in which the leaves are the final clusters. The second part of this book will present, GraphGrepVF, an application-independent method for querying a database of graphs in order to find all the occurrences of a given subgraph. Many applications in industry, science and engineering share this problem, and increasing the size of the database requires efficient structure searching algorithms.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 48,50
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisRésultats de recherche pour ANTIPOLE TREE INDEXING AND GRAPHGREPVF: DATA STRUCTURES...
Image fournie par le vendeur
ANTIPOLE TREE INDEXING AND GRAPHGREPVF
Edité par
LAP LAMBERT Academic Publishing, 2010
ISBN 10 : 383836838X
ISBN 13 : 9783838368382
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Reforgiato Recupero DiegoDiego Reforgiato is a Researcher at the DIIT of the Univ. of Catania. The support for this fellowship has been given by PROVIDEO, a Marie Curie Grant that Dr. Reforgiato won in 2008. From 4/1/2005 to 5/1/2008. N° de réf. du vendeur 5417157
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
ANTIPOLE TREE INDEXING AND GRAPHGREPVF : DATA STRUCTURES AND ALGORITHMS FOR OPTIMIZATION AND SEARCHING PROBLEMS IN METRIC SPACES AND GRAPHS
Edité par
LAP LAMBERT Academic Publishing, 2010
ISBN 10 : 383836838X
ISBN 13 : 9783838368382
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - There has been increasing interest in building search/index structures to perform similarity search over high-dimensional data, e.g., image databases, document collections, time-series databases, and genome databases. A similarity search problem involves a collection of objects (e.g., documents, images) which are characterized by a collection of relevant features and represented as points in a high-dimensional attribute space. The first part of this book will present a new hierarchical clustering algorithm called Antipole Clustering. The algorithm partitions the set of data objects in clusters such that each one has diameter approximately less than a given value. The algorithm returns a tree structure called Antipole Tree in which the leaves are the final clusters. The second part of this book will present, GraphGrepVF, an application-independent method for querying a database of graphs in order to find all the occurrences of a given subgraph. Many applications in industry, science and engineering share this problem, and increasing the size of the database requires efficient structure searching algorithms. N° de réf. du vendeur 9783838368382
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
ANTIPOLE TREE INDEXING AND GRAPHGREPVF
Edité par
LAP LAMBERT Academic Publishing Jun 2010, 2010
ISBN 10 : 383836838X
ISBN 13 : 9783838368382
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -There has been increasing interest in building search/index structures to perform similarity search over high-dimensional data, e.g., image databases, document collections, time-series databases, and genome databases. A similarity search problem involves a collection of objects (e.g., documents, images) which are characterized by a collection of relevant features and represented as points in a high-dimensional attribute space. The first part of this book will present a new hierarchical clustering algorithm called Antipole Clustering. The algorithm partitions the set of data objects in clusters such that each one has diameter approximately less than a given value. The algorithm returns a tree structure called Antipole Tree in which the leaves are the final clusters. The second part of this book will present, GraphGrepVF, an application-independent method for querying a database of graphs in order to find all the occurrences of a given subgraph. Many applications in industry, science and engineering share this problem, and increasing the size of the database requires efficient structure searching algorithms. 156 pp. Englisch. N° de réf. du vendeur 9783838368382
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
ANTIPOLE TREE INDEXING AND GRAPHGREPVF
Edité par
LAP LAMBERT Academic Publishing Jun 2010, 2010
ISBN 10 : 383836838X
ISBN 13 : 9783838368382
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Neuware -There has been increasing interest in building search/index structures to perform similarity search over high-dimensional data, e.g., image databases, document collections, time-series databases, and genome databases. A similarity search problem involves a collection of objects (e.g., documents, images) which are characterized by a collection of relevant features and represented as points in a high-dimensional attribute space. The first part of this book will present a new hierarchical clustering algorithm called Antipole Clustering. The algorithm partitions the set of data objects in clusters such that each one has diameter approximately less than a given value. The algorithm returns a tree structure called Antipole Tree in which the leaves are the final clusters. The second part of this book will present, GraphGrepVF, an application-independent method for querying a database of graphs in order to find all the occurrences of a given subgraph. Many applications in industry, science and engineering share this problem, and increasing the size of the database requires efficient structure searching algorithms.Books on Demand GmbH, Überseering 33, 22297 Hamburg 156 pp. Englisch. N° de réf. du vendeur 9783838368382
Quantité disponible : 2 disponible(s)
Image d'archives
ANTIPOLE TREE INDEXING AND GRAPHGREPVF: DATA STRUCTURES AND ALGORITHMS FOR OPTIMIZATION AND SEARCHING PROBLEMS IN METRIC SPACES AND GRAPHS
Edité par
LAP LAMBERT Academic Publishing, 2010
ISBN 10 : 383836838X
ISBN 13 : 9783838368382
Ancien ou d'occasion
Paperback
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Paperback. Etat : Like New. Like New. book. N° de réf. du vendeur ERICA790383836838X6
Quantité disponible : 1 disponible(s)