5 research outputs found

    Crop Recommendation System Using Improved Apriori Algorithm

    Get PDF
    A crop suggestion system is a technologically advanced tool that helps farmers choose which crops to plant in a certain location or with precise environmental circumstances. These systems use a variety of data sources and analytical methods to give farmers customized crop recommendations. This work presents the Crop Recommendation System Using an Improved Apriori Algorithm, which is an Apriori-based crop recommendation system. The goal of the system is to assist farmers in making well-informed choices about which crops to grow and what fertilizers to use depending on the properties of the soil and environment. With consideration for crop variety, climate, and soil nutrient content, the suggested method is an enhanced version of the Apriori algorithm. Tests of the updated algorithm on a dataset of soil samples from different parts of India revealed that it could correctly suggest the optimal crop. The model's output, association rules, is a suggestion system that farmers can use to boost crop productivity while lowering input costs. The method suggested operates in three phases: In the first stage, preprocessing the data is carried out to gather the input parameters that are crucial for determining the recommendation system. In Stage 2, the recommendation system's association rules are extracted by using an iterative approach to determine the threshold support count and confidence. Stage 3: The recommendation system's knowledge base is formed by pruning the top 8 apriori rules depending on priority. From the experiments, it is evident that the improved apriori algorithm-based extracted recommendation system is an interesting development in precision agriculture that could raise farming practices' sustainability and efficiency

    Spread Spectrum based QoS aware Energy Efficient Clustering Algorithm for Wireless Sensor Networks

    Get PDF
    Wireless sensor networks (WSNs) are composed of small, resource-constrained sensor nodes that form self-organizing, infrastructure-less, and ad-hoc networks. Many energy-efficient protocols have been developed in the network layer to extend the lifetime and scalability of these networks, but they often do not consider the Quality of Service (QoS) requirements of the data flow, such as delay, data rate, reliability, and throughput. In clustering, the probabilistic and randomized approach for cluster head selection can lead to varying numbers of cluster heads in different rounds of data gathering. This paper presents a new algorithm called "Spread Spectrum based QoS aware Energy Efficient Clustering for Wireless sensor Networks" that uses spread spectrum to limit the formation of clusters and optimize the number of cluster heads in WSNs, improving energy efficiency and QoS for diverse data flows. Simulation results show that the proposed algorithm outperforms classical algorithms in terms of energy efficiency and QoS

    Optimization of Energy-Efficient Cluster Head Selection Algorithm for Internet of Things in Wireless Sensor Networks

    Get PDF
    The Internet of Things (IoT) now uses the Wireless Sensor Network (WSN) as a platform to sense and communicate data. The increase in the number of embedded and interconnected devices on the Internet has resulted in a need for software solutions to manage them proficiently in an elegant and scalable manner. Also, these devices can generate massive amounts of data, resulting in a classic Big Data problem that must be stored and processed. Large volumes of information have to be produced by using IoT applications, thus raising two major issues in big data analytics. To ensure an efficient form of mining of both spatial and temporal data, a sensed sample has to be collected. So for this work, a new strategy to remove redundancy has been proposed. This classifies all forms of collected data to be either relevant or irrelevant in choosing suitable information even before they are forwarded to the base station or the cluster head. A Low-Energy Adaptive Clustering Hierarchy (LEACH) is a cluster-based routing protocol that uses cluster formation. The LEACH chooses one head from the network sensor nodes, such as the Cluster Head (CH), to rotate the role to a new distributed energy load. The CHs were chosen randomly with the possibility of all CHs being concentrated in one locality. The primary idea behind such dynamic clustering was them resulted in more overheads due to changes in the CH and advertisements. Therefore, the LEACH was not suitable for large networks. Here, Particle Swarm Optimization (PSO) and River Formation Dynamics are used to optimize the CH selection (RFD). The results proved that the proposed method to have performed better compared to other methods

    High blood pressure prediction based on AAA++ using machine-learning algorithms

    No full text
    The heart pumps the blood around the body to supply energy and oxygen for all the tissues of the body. In order to pump the blood, heart pushes the blood against the walls of arteries, which creates some pressure inside the arteries, called as blood pressure (BP). If this pressure is more than the desired level, we treat it as high blood pressure (HBP). Present days, HBP victims are growing in number across the globe. BP may be elevated because of change in biological or psychological state of a person. In this paper, we considered attributes such as age, anger, and anxiety (AAA) and obesity (+), cholesterol level (+) of a person to predict whether a person is prone to HBP or not. Obesity and cholesterol levels are considered as post-increment of AAA, where obesity as one +, and total blood cholesterol as another + because experimental results reveal that their impact is less comparatively AAA. In our technique, we used different classifiers for prediction, where each classifier considers the impact of each A in AAA along with obesity and cholesterol level of a person to predict whether a person becomes a victim of HBP or not. Random forest algorithm has shown 87.5% accuracy in prediction
    corecore