default search action
Mashaan A. Alshammari
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j8]Mashaan A. Alshammari
, John Stavrakakis, Adel F. Ahmed, Masahiro Takatsuka:
Random projection tree similarity metric for SpectralNet. Array 17: 100274 (2023) - [i8]Mashaan A. Alshammari, John Stavrakakis, Masahiro Takatsuka:
Refining a k-nearest neighbor graph for a computationally efficient spectral clustering. CoRR abs/2302.11296 (2023) - [i7]Mashaan A. Alshammari, Masahiro Takatsuka:
Approximate spectral clustering with eigenvector selection and self-tuned k. CoRR abs/2302.11297 (2023) - [i6]Mashaan A. Alshammari, Masahiro Takatsuka:
Approximate spectral clustering density-based similarity for noisy datasets. CoRR abs/2302.11298 (2023) - [i5]Mashaan A. Alshammari
Graph Construction using Principal Axis Trees for Simple Graph Convolution. CoRR abs/2302.12000 (2023) - [i4]Mashaan A. Alshammari
Random Projection Forest Initialization for Graph Convolutional Networks. CoRR abs/2302.12001 (2023) - [i3]Mashaan A. Alshammari, John Stavrakakis, Adel F. Ahmed, Masahiro Takatsuka:
The Effect of Points Dispersion on the k-nn Search in Random Projection Forests. CoRR abs/2302.13160 (2023) - [i2]Mashaan A. Alshammari, John Stavrakakis, Masahiro Takatsuka:
A parameter-free graph reduction for spectral clustering and SpectralNet. CoRR abs/2302.13165 (2023) - [i1]Mashaan A. Alshammari, John Stavrakakis, Adel F. Ahmed, Masahiro Takatsuka:
Random projection tree similarity metric for SpectralNet. CoRR abs/2302.13168 (2023) - 2022
- [j7]Mashaan A. Alshammari
The Effect of Points Dispersion on the k-nn Search in Random Projection Forests. IEEE Access 10: 80858-80868 (2022) - [j6]Mashaan A. Alshammari
A parameter-free graph reduction for spectral clustering and SpectralNet. Array 15: 100192 (2022) - 2021
- [j5]Mohammad R. Alshayeb, Mashaan A. Alshammari
The Effect of the Dataset Size on the Accuracy of Software Defect Prediction Models: An Empirical Study. Inteligencia Artif. 24(68): 72-88 (2021) - [j4]Mashaan A. Alshammari
Refining a k-nearest neighbor graph for a computationally efficient spectral clustering. Pattern Recognit. 114: 107869 (2021)
2010 – 2019
- 2019
- [j3]Mashaan A. Alshammari
Approximate spectral clustering with eigenvector selection and self-tuned k. Pattern Recognit. Lett. 122: 31-37 (2019) - [j2]Mashaan A. Alshammari
Approximate spectral clustering density-based similarity for noisy datasets. Pattern Recognit. Lett. 128: 155-161 (2019) - 2018
- [c2]Mashaan A. Alshammari
Approximate Spectral Clustering Using Topology Preserving Methods and Local Scaling. ICONIP (4) 2018: 109-121 - 2016
- [j1]El-Sayed M. El-Alfy
Towards scalable rough set based attribute subset selection for intrusion detection using parallel genetic algorithm in MapReduce. Simul. Model. Pract. Theory 64: 18-29 (2016) - 2015
- [c1]Fazal Noor
Distinguishing medical drugs from a large set of side effects using a distributed genetic algorithm on a PC cluster. ISCAS 2015: 790-793
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: