{"id":"https://openalex.org/W2550201222","doi":null,"title":"ANTIPOLE TREE INDEXING AND GRAPHGREPVF: DATA STRUCTURES AND ALGORITHMS FOR OPTIMIZATION AND SEARCHING PROBLEMS IN METRIC SPACES AND GRAPHS","display_name":"ANTIPOLE TREE INDEXING AND GRAPHGREPVF: DATA STRUCTURES AND ALGORITHMS FOR OPTIMIZATION AND SEARCHING PROBLEMS IN METRIC SPACES AND GRAPHS","publication_year":2010,"publication_date":"2010-06-04","ids":{"openalex":"https://openalex.org/W2550201222","mag":"2550201222"},"language":"en","primary_location":{"id":"mag:2550201222","doi":null,"is_oa":false,"landing_page_url":"https://www.amazon.com/ANTIPOLE-TREE-INDEXING-GRAPHGREPVF-OPTIMIZATION/dp/383836838X","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"book","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014673075","display_name":"Diego Reforgiato Recupero","orcid":"https://orcid.org/0000-0001-8646-6183","observed_orcids":["https://orcid.org/0000-0001-8646-6183"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Diego Reforgiato Recupero","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-8646-6183","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5014673075"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20100083,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.478300005197525,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.478300005197525,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.2791000008583069,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.0560000017285347,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hierarchical-clustering","display_name":"hierarchical clustering","score":0.8769999742507935},{"id":"https://openalex.org/keywords/similarity-search","display_name":"similarity search","score":0.7860000133514404},{"id":"https://openalex.org/keywords/high-dimensional-data","display_name":"high-dimensional data","score":0.8519999980926514},{"id":"https://openalex.org/keywords/graph-databases","display_name":"graph databases","score":0.6209999918937683},{"id":"https://openalex.org/keywords/metric-spaces","display_name":"metric spaces","score":0.7409999966621399},{"id":"https://openalex.org/keywords/data-indexing","display_name":"data indexing","score":0.3070000112056732}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6495162844657898},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.6238608360290527},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.620216429233551},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5200443267822266},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5131452679634094},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47838059067726135},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.4782639741897583},{"id":"https://openalex.org/C59276292","wikidata":"https://www.wikidata.org/wiki/Q580427","display_name":"Database index","level":3,"score":0.4634406864643097},{"id":"https://openalex.org/C92835128","wikidata":"https://www.wikidata.org/wiki/Q1277447","display_name":"Hierarchical clustering","level":3,"score":0.45449984073638916},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.43748340010643005},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.4310709834098816},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4118840992450714},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3691180944442749},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2885309159755707},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.28738486766815186},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18819981813430786},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.18073377013206482},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11905407905578613},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2550201222","doi":null,"is_oa":false,"landing_page_url":"https://www.amazon.com/ANTIPOLE-TREE-INDEXING-GRAPHGREPVF-OPTIMIZATION/dp/383836838X","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2127070656","https://openalex.org/W2162770522","https://openalex.org/W1497038060","https://openalex.org/W2168456130","https://openalex.org/W7200784557","https://openalex.org/W2397223983","https://openalex.org/W2108776199","https://openalex.org/W2507054779","https://openalex.org/W2001777280","https://openalex.org/W6908634350"],"abstract_inverted_index":{"There":[0],"has":[1,86],"been":[2],"increasing":[3,151],"interest":[4],"in":[5,51,80,103,129,142],"building":[6],"search/index":[7],"structures":[8],"to":[9,131],"perform":[10],"similarity":[11,27],"search":[12,28],"over":[13],"high-dimensional":[14,53],"data,":[15],"e.g.,":[16],"image":[17],"databases,":[18,22],"document":[19],"collections,":[20],"time-series":[21],"and":[23,47,145,150],"genome":[24],"databases.":[25],"A":[26],"problem":[29],"involves":[30],"a":[31,42,52,64,91,97,125,137],"collection":[32,43],"of":[33,44,59,77,114,127,136,154],"objects":[34,79],"(e.g.,":[35],"documents,":[36],"images)":[37],"which":[38,104],"are":[39,107],"characterized":[40],"by":[41],"relevant":[45],"features":[46],"represented":[48],"as":[49],"points":[50],"attribute":[54],"space.":[55],"The":[56,72,94,111],"first":[57],"part":[58,113],"this":[60,115,148],"book":[61,116],"will":[62,117],"present":[63],"new":[65],"hierarchical":[66],"clustering":[67],"algorithm":[68,73,95],"called":[69,100],"Antipole":[70,101],"Clustering.":[71],"partitions":[74],"the":[75,105,108,134,152,155],"set":[76],"data":[78],"clusters":[81],"such":[82],"that":[83],"each":[84],"one":[85],"diameter":[87],"approximately":[88],"less":[89],"than":[90],"given":[92,138],"value.":[93],"returns":[96],"tree":[98],"structure":[99,159],"Tree":[102],"leaves":[106],"final":[109],"clusters.":[110],"second":[112],"present,":[118],"GraphGrepVF,":[119],"an":[120],"application-independent":[121],"method":[122],"for":[123],"querying":[124],"database":[126,156],"graphs":[128],"order":[130],"find":[132],"all":[133],"occurrences":[135],"subgraph.":[139],"Many":[140],"applications":[141],"industry,":[143],"science":[144],"engineering":[146],"share":[147],"problem,":[149],"size":[153],"requires":[157],"efficient":[158],"searching":[160],"algorithms.":[161]},"counts_by_year":[],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2016-11-30T00:00:00"}