Matches in SemOpenAlex for { <https://semopenalex.org/work/W2825935947> ?p ?o ?g. }
- W2825935947 abstract "Euclidean minimum spanning tree algorithms run typically with quadratic computational complexity, which is not practical for large scale high dimensional datasets. In this paper, we propose a new two-level approximate Euclidean minimum spanning tree algorithm for high dimensional data. In the first level, we perform outlier detection for a given data set to identify a small amount of boundary points and run standard Prim’s algorithm on the reduced dataset. In the second level, we conduct a k-nearest neighbors search to complete an approximate Euclidean Minimum Spanning Tree construction process. Experimental results on sample data sets demonstrate the efficiency of the proposed method while keeping high approximate precision." @default.
- W2825935947 created "2018-07-19" @default.
- W2825935947 creator A5008844169 @default.
- W2825935947 creator A5031706715 @default.
- W2825935947 creator A5044865378 @default.
- W2825935947 date "2018-01-01" @default.
- W2825935947 modified "2023-09-22" @default.
- W2825935947 title "A Fast Two-Level Approximate Euclidean Minimum Spanning Tree Algorithm for High-Dimensional Data" @default.
- W2825935947 cites W108464071 @default.
- W2825935947 cites W126266486 @default.
- W2825935947 cites W1584412742 @default.
- W2825935947 cites W1664309637 @default.
- W2825935947 cites W1965680834 @default.
- W2825935947 cites W1972969203 @default.
- W2825935947 cites W1973662756 @default.
- W2825935947 cites W1986332411 @default.
- W2825935947 cites W1992843866 @default.
- W2825935947 cites W1994655805 @default.
- W2825935947 cites W1995042400 @default.
- W2825935947 cites W2017927472 @default.
- W2825935947 cites W2018359542 @default.
- W2825935947 cites W2034887891 @default.
- W2825935947 cites W2041559880 @default.
- W2825935947 cites W2067298033 @default.
- W2825935947 cites W2084642062 @default.
- W2825935947 cites W2102999520 @default.
- W2825935947 cites W2109343068 @default.
- W2825935947 cites W2110784166 @default.
- W2825935947 cites W2117839996 @default.
- W2825935947 cites W2127284416 @default.
- W2825935947 cites W2132192618 @default.
- W2825935947 cites W2135915282 @default.
- W2825935947 cites W2141585940 @default.
- W2825935947 cites W2158319614 @default.
- W2825935947 cites W2169528473 @default.
- W2825935947 cites W2171394996 @default.
- W2825935947 cites W2541335910 @default.
- W2825935947 cites W2911302472 @default.
- W2825935947 cites W4254182148 @default.
- W2825935947 doi "https://doi.org/10.1007/978-3-319-96133-0_21" @default.
- W2825935947 hasPublicationYear "2018" @default.
- W2825935947 type Work @default.
- W2825935947 sameAs 2825935947 @default.
- W2825935947 citedByCount "1" @default.
- W2825935947 countsByYear W28259359472020 @default.
- W2825935947 crossrefType "book-chapter" @default.
- W2825935947 hasAuthorship W2825935947A5008844169 @default.
- W2825935947 hasAuthorship W2825935947A5031706715 @default.
- W2825935947 hasAuthorship W2825935947A5044865378 @default.
- W2825935947 hasConcept C100560664 @default.
- W2825935947 hasConcept C113174947 @default.
- W2825935947 hasConcept C11413529 @default.
- W2825935947 hasConcept C114614502 @default.
- W2825935947 hasConcept C120174047 @default.
- W2825935947 hasConcept C129782007 @default.
- W2825935947 hasConcept C134306372 @default.
- W2825935947 hasConcept C13743678 @default.
- W2825935947 hasConcept C145685049 @default.
- W2825935947 hasConcept C154945302 @default.
- W2825935947 hasConcept C163797641 @default.
- W2825935947 hasConcept C1649724 @default.
- W2825935947 hasConcept C197855036 @default.
- W2825935947 hasConcept C202750272 @default.
- W2825935947 hasConcept C2524010 @default.
- W2825935947 hasConcept C33923547 @default.
- W2825935947 hasConcept C41008148 @default.
- W2825935947 hasConcept C62354387 @default.
- W2825935947 hasConcept C63645285 @default.
- W2825935947 hasConcept C64331007 @default.
- W2825935947 hasConcept C65949645 @default.
- W2825935947 hasConcept C79337645 @default.
- W2825935947 hasConceptScore W2825935947C100560664 @default.
- W2825935947 hasConceptScore W2825935947C113174947 @default.
- W2825935947 hasConceptScore W2825935947C11413529 @default.
- W2825935947 hasConceptScore W2825935947C114614502 @default.
- W2825935947 hasConceptScore W2825935947C120174047 @default.
- W2825935947 hasConceptScore W2825935947C129782007 @default.
- W2825935947 hasConceptScore W2825935947C134306372 @default.
- W2825935947 hasConceptScore W2825935947C13743678 @default.
- W2825935947 hasConceptScore W2825935947C145685049 @default.
- W2825935947 hasConceptScore W2825935947C154945302 @default.
- W2825935947 hasConceptScore W2825935947C163797641 @default.
- W2825935947 hasConceptScore W2825935947C1649724 @default.
- W2825935947 hasConceptScore W2825935947C197855036 @default.
- W2825935947 hasConceptScore W2825935947C202750272 @default.
- W2825935947 hasConceptScore W2825935947C2524010 @default.
- W2825935947 hasConceptScore W2825935947C33923547 @default.
- W2825935947 hasConceptScore W2825935947C41008148 @default.
- W2825935947 hasConceptScore W2825935947C62354387 @default.
- W2825935947 hasConceptScore W2825935947C63645285 @default.
- W2825935947 hasConceptScore W2825935947C64331007 @default.
- W2825935947 hasConceptScore W2825935947C65949645 @default.
- W2825935947 hasConceptScore W2825935947C79337645 @default.
- W2825935947 hasLocation W28259359471 @default.
- W2825935947 hasOpenAccess W2825935947 @default.
- W2825935947 hasPrimaryLocation W28259359471 @default.
- W2825935947 hasRelatedWork W1491195793 @default.
- W2825935947 hasRelatedWork W1567663444 @default.
- W2825935947 hasRelatedWork W1935379866 @default.
- W2825935947 hasRelatedWork W1965702747 @default.