Search Results - (( java implementation phase algorithm ) OR ( using minimum spanning algorithm ))

Refine Results
  1. 1

    Outlier detection in circular regression model using minimum spanning tree method by Nur Faraidah, Muhammad Di, Siti Zanariah, Satari, Roslinazairimah, Zakaria

    Published 2019
    “…Therefore, this study aims to develop new algorithms that can detect outliers by using the minimum spanning tree method. …”
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2
  3. 3

    A matrix approach for minimum spanning tree in neutrosophic and application in medical waste management / Nur Haifa Ahmad Hayazim, Siti Nurain Zulkifli and Siti Nurhidayah Yaacob by Ahmad Hayazim, Nur Haifa, Zulkifli, Siti Nurain, Yaacob, Siti Nurhidayah

    Published 2022
    “…A numerical example related to finding the optimal route that can minimize the cost of solving the medical waste management is provided to show the effectiveness of the Prim's and Kruskal's algorithms with IVBN. As a final step, a comparative study such as interval-valued neutrosophic minimum spanning tree (IVN-MST), interval-valued intuitionistic fuzzy minimum spanning tree (IVIF-MST) and interval-valued fuzzy minimum spanning tree (IVE-MST) is presented to point out the advantages of the proposed method over that of other existing algorithms. …”
    Get full text
    Get full text
    Student Project
  4. 4

    Outlier detection in circular regression model using minimum spanning tree method by Nur Faraidah, Muhammad Di, Siti Zanariah, Satari, Roslinazairimah, Zakaria

    Published 2019
    “…Therefore, this study aims to develop new algorithms that can detect outliers by using minimum spanning tree method. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    A minimum spanning tree stock market analysis of Malaysia technology companies by Zulrushdi, Puteri Nur Qistina Megat, Bahaludin, Hafizah, Ibrahim, Siti Nur Iqmal

    Published 2024
    “…The collected data is the daily closing prices of Malaysia’s top 20 most active companies based on the volume traded in the list of technology companies. The minimum spanning tree was used to construct the network via Kruskal’s algorithm, and the centrality measures of the stocks, such as degree, betweenness, closeness, and eigenvector, were measured to identify influential stocks. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  6. 6
  7. 7

    Web-based clustering tool using fuzzy k-mean algorithm / Ahmad Zuladzlan Zulkifly by Zulkifly, Ahmad Zuladzlan

    Published 2019
    “…All the algorithm for the engine has been developed by using Java script language. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Using modification of Prim's algorithm and GNU Octave and to solve the multiperiods installation problem by ,, Wamiliana, Usman, Mustofa, ,, Warsono, Daoud, Jamal Ibrahim

    Published 2020
    “…The Minimum Spanning Tree (MST) is one of the famous problems that is used mostly as the backbone in many network design problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  9. 9
  10. 10

    Mining Sequential Patterns Using I-PrefixSpan by Dhany , Saputra, Rambli Dayang, R.A., Foong, Oi Mean

    Published 2007
    “…In this paper, we propose an improvement of pattern growth-based PrefixSpan algorithm, called I-PrefixSpan. The general idea of I-PrefixSpan is to use the efficient data structure for general tree-like framework and separator database to reduce the execution time and memory usage. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    A minimum spanning tree stock market analysis of Malaysia technology companies by Puteri Nur Qistina Megat Zulrushdi, Hafizah Bahaludin, Siti Nur Iqmal Ibrahim

    Published 2024
    “…The collected data is the daily closing prices of Malaysia’s top 20 most active companies based on the volume traded in the list of technology companies. The minimum spanning tree was used to construct the network via Kruskal’s algorithm, and the centrality measures of the stocks, such as degree, betweenness, closeness, and eigenvector, were measured to identify influential stocks. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    A minimum spanning tree stock market analysis of Malaysia technology companies by Zulrushdi, Puteri Nur Qistina Megat, Bahaludin, Hafizah, Ibrahim, Siti Nur Iqmal

    Published 2024
    “…The collected data is the daily closing prices of Malaysia’s top 20 most ac-tive companies based on the volume traded in the list of technology companies. The minimum spanning tree was used to construct the network via Kruskal’s algorithm, and the centrality measures of the stocks, such as degree, betweenness, closeness, and eigenvector, were measured to identify influential stocks. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Proportional-integral control optimization using imperialist competitive algorithm by Soheilirad, Mohammadsoroush

    Published 2012
    “…This implies that the ICA can be used to tune the PI control loops for a continuous stirred tank heater with a minimum cost and better response in compare with the GA and the PSO.…”
    Get full text
    Get full text
    Thesis
  14. 14

    Optimum MV Feeder Routing and Substation siting and rating in Distribution Network by Hasan, Ihsan Jabbar, Ab Ghani, Mohd Ruddin, Gan, Chin Kim

    Published 2014
    “…This paper proposes an evolutionary algorithm to determine the optimum distribution substation placement and sizing by using the particle swarm optimization algorithm and optimum feeder routing using modified minimum spanning tree algorithm. …”
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15

    An optimal tasks scheduling algorithm based on QoS in cloud computing network by Alhakimi, Mohammed Ameen Mohammed Abdo

    Published 2017
    “…Therefore, if the resource is from the first group then map the average length task to it and if the choosing resource is from the second group, then map the largest length task to it. The simulation tool used for testing the algorithm is WorkflowSim. We tested averages of execution time span of the proposed algorithm for 10 running times with 200-1000 tasks in 50 or 100 VMs. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Optimal route checking using genetic algorithm for UiTM's bus services / Tengku Salman Fathi Tengku Jaafar by Tengku Jaafar, Tengku Salman Fathi

    Published 2006
    “…Although from human logical thinking, the route can be generated easily but the calculation of checking the route whether it is optimal route or not is difficult and will take long time to be implemented. This research study with the development of the Optimal Route Checking Using Genetic Algorithm system should solve this scenario. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Improvement of horizontal streak on disparity map thru parameter optimization for stereo vision algorithm by Gan, Melvin Yeou Wei, Hamzah, Rostam Affendi, Nik Anwar, Nik Syahrim, Herman, Adi Irwan, Jamil Alsayaydeh, Jamil Abedalrahim

    Published 2024
    “…Next, the cost aggregation uses minimum spanning tree (MST) segmentation, which equipped with edge preserving properties and noise filtering. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Quantum Processing Framework And Hybrid Algorithms For Routing Problems by Soltan Aghaei, Mohammad Reza

    Published 2010
    “…Another quantum algorithm for a minimum weight spanning tree in the graph was also designed. …”
    Get full text
    Get full text
    Thesis
  19. 19

    A proposed algorithm of random vector in measuring similarity for network topology of Bursa Malaysia by Lim, San Yee

    Published 2018
    “…The behaviors and interactions among the stocks in Bursa Malaysia are then determined by using the Forest of all possible minimum spanning trees. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    Energy efficiency mechanism using mobile-based fermat's spiral in wireless sensor networks by Mantoro, Teddy, Shaukat Ali, Haroon, Ayu, Media Anugerah, Usino, Wendi

    Published 2011
    “…We evaluated the performance of wireless sensor network using minimum spanning tree algorithm specifically Prim’s Algorithm in order to know the bottleneck effect on wireless sensor network and propose a better solution performance based on Fermat Spiral model. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper