Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Mashaan Alshammari"'
Publikováno v:
MethodsX, Vol 11, Iss , Pp 102315- (2023)
Graph convolutional networks (GCNs) were a great step towards extending deep learning to graphs. GCN uses the graph G and the feature matrix X as inputs. However, in most cases the graph G is missing and we are only provided with the feature matrix X
Externí odkaz:
https://doaj.org/article/c2148aa58f194972839b1f02ee005e54
Publikováno v:
IEEE Access, Vol 10, Pp 80858-80868 (2022)
Partitioning trees are efficient data structures for $k$ -nearest neighbor search. Machine learning libraries commonly use a special type of partitioning trees called $k\text{d}$ -trees to perform $k$ -nn search. Unfortunately, $k\text{d}$ -trees can
Externí odkaz:
https://doaj.org/article/e6790d76fc364bad88ef38a9acc2baa2
Publikováno v:
Array, Vol 17, Iss , Pp 100274- (2023)
SpectralNet is a graph clustering method that uses neural network to find an embedding that separates the data. So far it was only used with k-nn graphs, which are usually constructed using a distance metric (e.g., Euclidean distance). k-nn graphs re
Externí odkaz:
https://doaj.org/article/dab956089f644c39ade05526e8865bbf
Publikováno v:
Array, Vol 15, Iss , Pp 100192- (2022)
Graph-based clustering methods like spectral clustering and SpectralNet are very efficient in detecting clusters of non-convex shapes. Unlike the popular k-means, graph-based clustering methods do not assume that each cluster has a single mean. Howev
Externí odkaz:
https://doaj.org/article/cf8f96062ac249a190614115508da362
Graph-based clustering methods like spectral clustering and SpectralNet are very efficient in detecting clusters of non-convex shapes. Unlike the popular $k$-means, graph-based clustering methods do not assume that each cluster has a single mean. How
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5e104f0c19c1f2b24298f55f5de1de5e
Partitioning trees are efficient data structures for $k$-nearest neighbor search. Machine learning libraries commonly use a special type of partitioning trees called $k$d-trees to perform $k$-nn search. Unfortunately, $k$d-trees can be ineffective in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::913d8c9e709c9e2dcb399330e1a332ae
Publikováno v:
Volume 1: Upstream Pipelines; Project Management; Design and Construction; Environment; Facilities Integrity Management; Operations and Maintenance; Pipeline Automation and Measurement.
On-stream pipeline cleaning is essential to pipeline operations in terms of maintaining both pipeline efficiency, as well as integrity. Running effective brush cleaning pigs through pipelines will remove accumulated solid debris as well as smoothen t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d9c199e4fd03aa29552b25671f4b6476
https://doi.org/10.1115/ipc2012-90193
https://doi.org/10.1115/ipc2012-90193