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

Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

“…The thesis also provides a two different implementation of the modified FLEX algorithm using a java based parsers and XQuery implementation. …”
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

Study and Implementation of Data Mining in Urban Gardening by Mohana, Muniandy, Lee, Eu Vern

“…Using the J48 tree algorithm implemented through WEKA API on a Java Servlet, data provided is processed to derive a health index of the plant, with the possible outcomes set to “Good,” “Okay”, or “Bad”. …”
Get full text
Get full text
Get full text

Scalable approach for mining association rules from structured XML data by Abazeed, Ashraf Riad, Mamat, Ali, Sulaiman, Md. Nasir, Ibrahim, Hamidah

“…Many techniques have been proposed to tackle the problem of mining XML data we study the various techniques to mine XML data and yet We presented a java based implementation of FLEX algorithm for mining XML data.…”
Get full text
Get full text

Mining association rules from structured XML data by Abazeed, Ashraf Riad, Mamat, Ali, Sulaiman, Md. Nasir, Ibrahim, Hamidah

“…Many techniques have been proposed to tackle the problem of mining XML data. We study the various techniques to mine XML data and yet We presented a java based implementation of FLEX algorithm for mining XML data.…”
Get full text
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

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

A web-based implementation of k-means algorithms by Lee, Quan

“…This stinginess of proximity measures in data mining tools is stifling the performance of the algorithm. …”
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

A new local search algorithm for minimum span frequency assignment in mobile communication by Loh, S.L., Lim, S.P., Chong, S.H., Ching, D.L.C.

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

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

Get full text
Get full text
Get full text

Image clustering comparison of two color segmentation techniques by Subramaniam, Kavitha Pichaiyan

“…The clustering research is regarding the area of data mining and implementation of the clustering algorithms. …”
Get full text
Get full text
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

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

Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

“…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
Get full text
Get full text

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

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

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

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