Research article · Feb 2015
Research articlePublished Jul 2011
AN EFFICIENT APPROACH TO DETECT FOREST FIRE USING K-MEDIODS ALGORITHM
Abstract
Select any words in the title or abstract, or press this and choose a sentence.
Problem Statement: : Clustering high dimensional spatial data for Forest fire risk analysis has been major issue due to sparsity of data points.. Most of the clustering algorithm becomes inefficient if the required distance similarity measure is computed for low dimensional spatial space of high dimensional data with sparsity of data point along different dimensions and also considering the obstacles.. Objective of this study were to contribute the complexity of projecting clusters for traffic risk analysis, (i) lack of support for reducing the number of dimensions on spatial space to reduce the searching time (ii) the lack of support for obstacles in the spatial data space. (iii) Compare computation time of HARP, Proclus, Doc, FastDoc, SSPC algorithms. Approach: During the first phase the satellite captured still images for different dimensions such as time and location of the forest fire network are enhanced and this images are given as input to red color image separation, During this phase the input images groped based on red color using K-Means algorithm and during the second phase the red color images are converted to gray scale images . The third phase mainly focuses on spatial attribute relevance analysis for detecting dense and sparse forest fire regions after detecting dense and sparse fire regions the algorithm employees pruning technique to reduce the search space by taking only dense fire regions and eliminating sparse fire regions and during fourth phase K-mediods algorithm is employed to project the clusters on different spatial dimensions and also it solves the problem of obstacles Results: First we showed that various projecting clustering algorithm on spatial space becomes inefficient if the number of dimensions increases .The new scheme proposed reduces the spatial dimension space so that it reduces the computation time and also it solves the problem of obstacles using K-mediods algorithim and finally the result is compared with HARP ,Proclus,Doc,FastDoc,SSPC The algorithms produces acceptable results when the average cluster dimensionality is greater than 10%. Conclusion: Hence the findings suggested the overhead reasonably minimized and using simulations, we investigated the efficiency of our schemes in supporting high dimensional spatial clustering for forest fire risk analysis.
Subjects
Computer Science & ITAsk about this article
Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.
Similar by topic
Research article · Dec 2013
Implementation of data mining techniques for Temperature Extraction for forest fire occurrence with Image Analysis
Research article · Aug 2014
An Efficient Uncertain Data Point Clustering Based On Probability–Maximization Algorithm
Research article · Mar 2014
Analysing the Efficiency of Data by Using Fast Clustering and Subset Selection Algorithm
Research article · Oct 2013
An Efficient Numerical Methods for the Prediction of Clusters using K-means Algorithm with Bisection method for Comparing Uniform and Random Distribution Data Points
More from this journal
The newest in Journal of Global Research in Computer Sciences.
Perspective · 30 Apr 2026
A NEW PROOF OF INEQUALITY OF P-NP
Research article · 17 Dec 2025
Computer Vision-Based Monitoring Method of Non-Wearing Helmet Events Using Face Recognition
Short communication · 17 Dec 2025
Leveraging AI in SAP Analytics Cloud for Business Transformation
Conferences in this field
Upcoming conferences in this field.
Follow
New articles from what you follow go into your email digest, once you agree to alert emails.
- JournalJournal of Global Research in Computer Sciences
- SubjectComputer Science & IT
- BylineArticles whose byline prints “A Gnana Baskaran”
- BylineArticles whose byline prints “Dr.K.Duraiswamy”
