Nothing Special   »   [go: up one dir, main page]

Kisfaludi-Bak et al., 2023 - Google Patents

A quadtree, a steiner spanner, and approximate nearest neighbours in hyperbolic space

Kisfaludi-Bak et al., 2023

View PDF
Document ID
2888506124630665496
Author
Kisfaludi-Bak S
van Wordragen G
Publication year
Publication venue
arXiv preprint arXiv:2305.01356

External Links

Snippet

We propose a data structure in $ d $-dimensional hyperbolic space that can be considered a natural counterpart to quadtrees in Euclidean spaces. Based on this data structure we propose a so-called L-order for hyperbolic point sets, which is an extension of the Z-order …
Continue reading at arxiv.org (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G06F17/30961—Trees
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30312—Storage and indexing structures; Management thereof
    • G06F17/30321—Indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G06F17/30958—Graphs; Linked lists
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30587—Details of specialised database models
    • G06F17/30589—Hierarchical databases, e.g. IMS, LDAP data stores, Lotus Notes
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F17/30705—Clustering or classification
    • G06F17/3071—Clustering or classification including class or cluster creation or modification
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F17/30613—Indexing
    • G06F17/30619—Indexing indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30994—Browsing or visualization
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/62—Methods or arrangements for recognition using electronic means
    • G06K9/6217—Design or setup of recognition systems and techniques; Extraction of features in feature space; Clustering techniques; Blind source separation
    • G06K9/6232—Extracting features by transforming the feature space, e.g. multidimensional scaling; Mappings, e.g. subspace methods
    • G06K9/6251—Extracting features by transforming the feature space, e.g. multidimensional scaling; Mappings, e.g. subspace methods based on a criterion of topology preservation, e.g. multidimensional scaling, self-organising maps

Similar Documents

Publication Publication Date Title
Snoeyink Point location
Tran et al. On filter size in graph convolutional networks
Munch A user’s guide to topological data analysis
Har-Peled A replacement for Voronoi diagrams of near linear size
Deng et al. A new algorithm for fast mining frequent itemsets using N-lists
Chen et al. On the hyperbolicity of small-world and treelike random graphs
Alon et al. Crossing patterns of semi-algebraic sets
Yao Computational geometry
Goldstein et al. Conditional lower bounds for space/time tradeoffs
Koutra et al. Individual and collective graph mining: principles, algorithms, and applications
Ostrovsky et al. Polynomial time approximation schemes for geometric k-clustering
Pezzotti et al. Multiscale visualization and exploration of large bipartite graphs
Irion et al. Applied and computational harmonic analysis on graphs and networks
Yang et al. DBSCAN-MS: distributed density-based clustering in metric spaces
Fredslund-Hansen et al. Truly subquadratic exact distance oracles with constant query time for planar graphs
Bhore et al. Online spanners in metric spaces
Przykucki et al. Shotgun reconstruction in the hypercube
Filtser et al. Low treewidth embeddings of planar and minor-free metrics
Kisfaludi-Bak et al. A quadtree, a steiner spanner, and approximate nearest neighbours in hyperbolic space
Kaplan et al. Spanners and reachability oracles for directed transmission graphs
Ryu et al. An Effective Clustering Method over CF $^+ $+ Tree Using Multiple Range Queries
Murtagh et al. Fast, linear time, m-adic hierarchical clustering for search and retrieval using the Baire metric, with linkages to generalized ultrametrics, hashing, formal concept analysis, and precision of data measurement
Chitturi Upper bounds for sorting permutations with a transposition tree
CN108198084A (en) A kind of complex network is overlapped community discovery method
Wang et al. A note on graph-based nearest neighbor search