Search Results - (( data distribution ((means algorithm) OR (_ algorithm)) ) OR ( re evaluation a algorithm ))

An eigenspace approach for detecting multiple space-time disease clusters: Application to measles hotspots detection in khyber-pakhtunkhwa, Pakistan by Ullah, S., Daud, H., Dass, S.C., Hadi, F.-T., Khalil, A.

“…The EigenSpot algorithm has been recently proposed for detecting space-time disease clusters of arbitrary shapes with no restriction on the distribution and quality of the data, and has shown some promising advantages over the state-of-the-art methods. …”
Get full text
Get full text

An eigenspace approach for detecting multiple space-time disease clusters: Application to measles hotspots detection in khyber-pakhtunkhwa, Pakistan by Ullah, S., Daud, H., Dass, S.C., Hadi, F.-T., Khalil, A.

“…The EigenSpot algorithm has been recently proposed for detecting space-time disease clusters of arbitrary shapes with no restriction on the distribution and quality of the data, and has shown some promising advantages over the state-of-the-art methods. …”
Get full text
Get full text

Traffic management algorithms for LEO satellite networks by Huyop @ Ayop, Fahrul Hakim

“…In dealing with traffic routing problem, two algorithms, Dijkstra's Shortest Path and Genetic Algorithm (GA) are combined together and enhanced to re-strategize a better routing mechanism for a heterogeneous mix of traffic classes ranging from traditional voice calls to multimedia data services in Low Earth Orbit (LEO) satellite networks. …”
Get full text
Get full text
Get full text

Parallel power load abnormalities detection using fast density peak clustering with a hybrid canopy-K-means algorithm by Al-Jumaili A.H.A., Muniyandi R.C., Hasan M.K., Singh M.J., Paw J.K.S., Al-Jumaily A.

“…Parallel power loads anomalies are processed by a fast-density peak clustering technique that capitalizes on the hybrid strengths of Canopy and K-means algorithms all within Apache Mahout's distributed machine-learning environment. …”

Slice sampler algorithm for generalized pareto distribution by Rostami, Mohammad, Adam, Mohd Bakri, Yahya, Mohamed Hisham, Ibrahim, Noor Akma

“…In this paper, we developed the slice sampler algorithm for the generalized Pareto distribution (GPD) model. …”
Get full text
Get full text

Slice sampler and metropolis hastings approaches for bayesian analysis of extreme data by Rostami, Mohammad

Get full text
Get full text

An observation of different clustering algorithms and clustering evaluation criteria for a feature selection based on linear discriminant analysis by Tie, K. H., A., Senawi, Chuan, Z. L.

“…Yet, the LDA cannot be implemented directly on unsupervised data as it requires the presence of class labels to train the algorithm. …”
Get full text
Get full text
Get full text

Power-efficient wireless coverage using minimum number of uavs by Sawalmeh A., Othman N.S., Liu G., Khreishah A., Alenezi A., Alanazi A.

Efficient genetic partitioning-around-medoid algorithm for clustering by Garib, Sarmad Makki Mohammed

“…One of the main issues in genetic k-means based algorithms is their sensitivity to outliers and unevenly distributed clusters due to the mean compromised computations. …”
Get full text
Get full text

Replica Creation Algorithm for Data Grids by Madi, Mohammed Kamel

“…This thesis presents a new replication algorithm that improves data access performance in data grids by distributing relevant data copies around the grid. …”
Get full text
Get full text
Get full text
Get full text

Estimation Of Weibull Parameters Using Simulated Annealing As Applied In Financial Data by Hamza, Abubakar

“…The finding reveals that the Weibull distribution is well-suited to describing the investment behaviour of the MPS based on the estimates via the SA algorithm. …”
Get full text
Get full text

A dynamic replication aware load balanced scheduling for data grids in distributed environments of internet of things by Bakhshad, Said, Noor, Rafidah Md, Akhundzada, Adnan, Saba, Tanzila, Ahmedy, Ismail, Haroon, Faisal, Nazir, Babar

“…Grid computing is a powerful distributed and scalable computing infrastructure that deals with massive data-intensive applications. …”
Get full text
Get full text

A comparative effectiveness of hierarchical and non-hierarchical regionalisation algorithms in regionalising the homogeneous rainfall regions by Chuan, Zun Liang, Wan Nur Syahidah, Wan Yusoff, Azlyna, Senawi, Mohd Akramin, Mohd Romlay, Fam, Soo-Fen, Wendy Ling, Shinyie, Tan Lit, Ken

“…The results of the analysis show that Forgy K-means non-hierarchical (FKNH), Hartigan- Wong K-means non-hierarchical (HKNH), and Lloyd K-means non-hierarchical (LKNH) regionalisation algorithms are superior to other automated agglomerative hierarchical and non-hierarchical regionalisation algorithms. …”
Get full text
Get full text
Get full text

A comparative effectiveness of hierarchical and nonhierarchical regionalisation algorithms in regionalising the homogeneous rainfall regions by Zun, Liang Chuan, Wan Yusof, Wan Nur Syahidah, Senawi, Azlyna, Mohd Akramin, Mohd Romlay, Soo, Fen Fam, Wendy, Ling Shinyie, Tan, Lit Ken

“…The results of the analysis show that Forgy K-means non-hierarchical (FKNH), HartiganWong K-means non-hierarchical (HKNH), and Lloyd K-means non-hierarchical (LKNH) regionalisation algorithms are superior to other automated agglomerative hierarchical and non-hierarchical regionalisation algorithms. …”
Get full text
Get full text
Get full text

Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures by Koohi, Sina Zangbari

“…Any optimization algorithm is suitable for only a specific domain of optimization problems. …”
Get full text
Get full text

Development of an effective clustering algorithm for older fallers by Goh, Choon Hian, Wong, Kam Kang, Tan, Maw Pin *, Ng, Siew Cheok, Chuah, Yea Dat, Kwan, Ban Hoe

“…The proposed algorithm was developed through the stages of: data pre-processing, feature identification and extraction with either t-Distributed Stochastic Neighbour Embedding (t-SNE) or principal component analysis (PCA)), clustering (K-means clustering, Hierarchical clustering, and Fuzzy C-means clustering) and characteristics interpretation with statistical analysis. …”
Get full text
Get full text

Coordinate-Descent Adaptation over Hamiltonian Multi-Agent Networks by Azam Khalili, Vahid Vahidpour, Amir Rastegarnia, Ali Farzamnia, Teo, Kenneth Tze Kin, Saeid Sanei

“…The incremental least-mean-square (ILMS) algorithm is a useful method to perform distributed adaptation and learning in Hamiltonian networks. …”
Get full text
Get full text
Get full text
Get full text
Get full text

A comparative effectiveness of hierarchical and nonhierarchical regionalisation algorithms in regionalising the homogeneous rainfall regions by Chuan, Zun Liang, Wan Nur Syahidah, Wan Yusoff, Azlyna, Senawi, Mohd Akramin, Mohd Romlay, Fam, Soo-Fen, Shinyie, Wendy Ling, Ken, Tan Lit

“…The results of the analysis show that Forgy K-means non-hierarchical (FKNH), HartiganWong K-means non-hierarchical (HKNH), and Lloyd K-means non-hierarchical (LKNH) regionalisation algorithms are superior to other automated agglomerative hierarchical and non-hierarchical regionalisation algorithms. …”
Get full text
Get full text
Get full text

Autonomous anomaly detection using density-based features in streaming data / Muhammmad Yunus Iqbal Basheer by Iqbal Basheer, Muhammmad Yunus

“…Consequently, to handle these data, computer algorithms must adapt to their characteristics. …”
Get full text
Get full text

Minimizing Classification Errors in Imbalanced Dataset Using Means of Sampling by Khan I., Ahmad A.R., Jabeur N., Mahdi M.N.