Search Results - (( using spanning tree algorithm ) OR ( java application using algorithm ))

Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Saputra , Dhany, Rambli, Dayang R.A., Foong, Oi Mean

“…A comprehensive performance study has been reported that PrefixSpan, one of the sequential pattern mining algorithms, outperforms GSP, SPADE, as well as FreeSpan in most cases, and PrefixSpan integrated with pseudoprojection technique is the fastest among those tested algorithms. …”
Get full text
Get full text

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

“…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 sufficient data structure for Seq-Tree Framework and separator database to reduce the execution time and memory usage. …”
Get full text
Get full text

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

“…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

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

“…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

Spanning Tree Transformation of Connected Graph into Single-Row Network by Loh, Ser Lee, Salleh, Shaharuddin, Sarmin, Nor Haniza

“…Paths are produced by Path-Growing and they are combined into a spanning tree by Tree-Forming. The spanning tree that is produced from the connected graph is then transformed into single-row network using Tree Sequence Modeling (TSM). …”
Get full text
Get full text

Wireless sensor nodes deployment using multi-robot based on improved spanning tree algorithm by Arezoumand, Reza

“…Developing an exploration algorithm based on spanning tree is the main contribution. …”
Get full text
Get full text

Interval elimination method for stochastic spanning tree problem by Mohd, Ismail

“…The optimum spanning tree problem has been well considered and until now several powerful algorithms have been proposed. …”
Get full text
Get full text
Get full text

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

“…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

Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Dhany, Saputra

“…A comprehensive performance study has been reported that PrefixSpan, one of the sequential pattern mining algorithms, outperforms GSP, SPADE, as well as FreeSpan in most cases, and PrefixSpan integrated with pseudoprojection technique is the fastest among those tested algorithms. …”
Get full text

Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem by Wamiliana, Wamiliana, Elfaki, Faiz Ahmed Mohamed, Usman, Mustofa, Azram, Mohammad

“…In this paper we proposed three algorithms by modifying Kruskal’s and Prim’s algorithms. …”
Get full text
Get full text
Get full text

Robust automatic multi-camera viewpoint stabilization using Harris laplace corner detection and spanning tree by Bhuiyan, Sharif Shah Newaj, Khalifa, Othman Omran

“…Spanning tree has been used to improve the connectivity of correct matching pairs by minimizing the global error value. …”
Get full text
Get full text
Get full text
Get full text

Efficient terrain coverage for deploying wireless sensor nodes on multi-robot system by Arezoumand, Reza, Mashohor, Syamsiah, Marhaban, Mohammad Hamiruce

“…Employing multi-robot system and path planning with spanning tree algorithm is a strategy for speeding up sensor nodes deployment. …”
Get full text
Get full text
Get full text

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

“…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

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

“…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

Network analysis on safety culture and worker‘s behaviour : A forest of all minimum spanning trees by Djauhari, Maman A., Sharif, Shamshuritawati, Djauhari, Hariza

“…We show that the current practice, based on a minimal spanning tree (MST), to filter the information contained in the network is not robust.A robust filter based on the forest of all possible MSTs is then proposed and used to analyze the network. …”
Get full text
Get full text
Get full text

Deploying clustered wireless sensor network by multi-robot system by Arezoumand, Reza, Mashohor, Syamsiah

“…In this method robots act as dispenser for wireless nodes. Using spanning tree as exploration algorithm helps robot to full coverage deployment of nodes. …”
Get full text
Get full text

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

“…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

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

“…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

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

“…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

A hybrid algorithm for finding shortest path in network routing. by Soltan Aghaei, Mohammad Reza, Ahmad Zulkarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

“…Classical algorithms have been used to search over some space for finding the shortest paths problem between two points in a network and a minimal weight spanning tree for routing. …”
Get full text