Research on Hierarchical Software Clustering Algorithm Based on Wireless Network

2019 ◽  
Author(s):  
Jia Xu ◽  
Yang Guo
Keyword(s):  
Wireless Network ◽  
Clustering Algorithm ◽  
Software Clustering

scholarly journals Clustering Methodologies for Software Engineering

2012 ◽  
Vol 2012 ◽  
pp. 1-18 ◽  
Author(s):  
Mark Shtern ◽  
Vassilios Tzerpos
Keyword(s):  
Software Engineering ◽  
Clustering Algorithm ◽  
Software Systems ◽  
Software Project ◽  
Clustering Methods ◽  
High Turnover ◽  
Research Directions ◽  
Software Clustering ◽  
Industrial Strength ◽  
Experienced Personnel

The size and complexity of industrial strength software systems are constantly increasing. This means that the task of managing a large software project is becoming even more challenging, especially in light of high turnover of experienced personnel. Software clustering approaches can help with the task of understanding large, complex software systems by automatically decomposing them into smaller, easier-to-manage subsystems. The main objective of this paper is to identify important research directions in the area of software clustering that require further attention in order to develop more effective and efficient clustering methodologies for software engineering. To that end, we first present the state of the art in software clustering research. We discuss the clustering methods that have received the most attention from the research community and outline their strengths and weaknesses. Our paper describes each phase of a clustering algorithm separately. We also present the most important approaches for evaluating the effectiveness of software clustering.

An improved intelligent clustering algorithm for irregular wireless network

2020 ◽  
Author(s):  
Xiang Hua ◽  
Zhaoxin Dong ◽  
Hongjuan Yao ◽  
Zhao Wang ◽  
Baohua Li ◽  
...  
Keyword(s):  
Wireless Network ◽  
Clustering Algorithm

scholarly journals Online Education and Wireless Network Coordination of Electronic Music Creation and Performance under Artificial Intelligence

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Ning Xu ◽  
Yuanyuan Zhao
Keyword(s):  
Artificial Intelligence ◽  
Online Education ◽  
Wireless Network ◽  
Electronic Music ◽  
Clustering Algorithm ◽  
Mean Squared Error ◽  
Clustering Algorithms ◽  
Music Performance ◽  
The Mean ◽  
And Performance

This paper is aimed at studying the online education and wireless network collaboration on electronic music creation and performance under artificial intelligence (AI). This paper uses a fuzzy clustering algorithm (FCA), designs the sensor network-related equipment, and uses AI to design an electronic music creation system. The analysis of simulation experiments suggests that under the premise of increasing the number of neighbors, the Mean Absolute Error (MAE) and Mean Squared Error (MSE) of collaborative filtering and fuzzy C -means clustering algorithms show a downward trend. However, with the same number of neighbors, the filtering matching algorithm is greater than FCA regarding the mean values of MAE and MSE. Meanwhile, on the electronic music performance system of AI, the digital module is designed and the sound data are imaged on the oscilloscope, and the collaboration of electronic music online education and wireless network is completed. The following conclusion is drawn: modularizing the creative mode of intelligent electronic music has achieved higher computational efficiency. Through the oscilloscope, the sound feature is converted into the image structure, and the corresponding sound and image mode is formed, which realizes the purpose of online electronic music intelligent matching and optimizes the effect of online education. In the AI environment, the matching degree of verification electronic music curriculum resources is better than traditional matching algorithms, and the accuracy is higher.

SOFTWARE ARCHITECTURE RECOVERY THROUGH SIMILARITY-BASED GRAPH CLUSTERING

2013 ◽  
Vol 23 (04) ◽  
pp. 559-586 ◽  
Author(s):  
JIANLIN ZHU ◽  
JIN HUANG ◽  
DAICUI ZHOU ◽  
ZHONGBAO YIN ◽  
GUOPING ZHANG ◽  
...  
Keyword(s):  
Software Architecture ◽  
Clustering Algorithm ◽  
Graph Clustering ◽  
Software System ◽  
Clustering Methods ◽  
Architecture Recovery ◽  
Clustering Techniques ◽  
Software Clustering ◽  
Software Architecture Recovery ◽  
Similar Elements

Software architecture recovery is to gain the architectural level understanding of a software system while its architecture description does not exist. In recent years, researchers have adopted various software clustering techniques to detect hierarchical structure of software systems. Most graph clustering techniques focus on the connectivity between program elements, but unreasonably ignore the similarity which is also a key measure for finding elements of one module. In this paper we propose a novel hierarchy graph clustering algorithm DGHC, which considers both similarity and connectivity between program elements. During the transformation of program dependence graph edges representing similarity between elements are added. Then similar elements are grouped by density-based approaches. The alternative strategy is adopted to find groups of closely connected and similar elements. Meanwhile we adjust the contribution of connectivity and similarity by a flexible clustering algorithm based on short random walk model, which can obtain more structure information of software to find its multiple layers. Furthermore a new method called Multi-layer Propagation Gap is proposed to suggest stable layers of hierarchy clustering result as multiple layers of software system. Extensive experimental results illustrate the effectiveness and efficiency of DGHC in detecting hierarchy structure of software through comparison with various software clustering methods.

Distributed Entropy Energy-Efficient Clustering algorithm for cluster head selection (DEEEC)

2020 ◽  
Vol 39 (6) ◽  
pp. 8139-8147
Author(s):  
Ranganathan Arun ◽  
Rangaswamy Balamurugan
Keyword(s):  
Energy Efficient ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Second Stage ◽  
Energy Efficient Clustering ◽  
Two Stages ◽  
Ch Selection

In Wireless Sensor Networks (WSN) the energy of Sensor nodes is not certainly sufficient. In order to optimize the endurance of WSN, it is essential to minimize the utilization of energy. Head of group or Cluster Head (CH) is an eminent method to develop the endurance of WSN that aggregates the WSN with higher energy. CH for intra-cluster and inter-cluster communication becomes dependent. For complete, in WSN, the Energy level of CH extends its life of cluster. While evolving cluster algorithms, the complicated job is to identify the energy utilization amount of heterogeneous WSNs. Based on Chaotic Firefly Algorithm CH (CFACH) selection, the formulated work is named “Novel Distributed Entropy Energy-Efficient Clustering Algorithm”, in short, DEEEC for HWSNs. The formulated DEEEC Algorithm, which is a CH, has two main stages. In the first stage, the identification of temporary CHs along with its entropy value is found using the correlative measure of residual and original energy. Along with this, in the clustering algorithm, the rotating epoch and its entropy value must be predicted automatically by its sensor nodes. In the second stage, if any member in the cluster having larger residual energy, shall modify the temporary CHs in the direction of the deciding set. The target of the nodes with large energy has the probability to be CHs which is determined by the above two stages meant for CH selection. The MATLAB is required to simulate the DEEEC Algorithm. The simulated results of the formulated DEEEC Algorithm produce good results with respect to the energy and increased lifetime when it is correlated with the current traditional clustering protocols being used in the Heterogeneous WSNs.

Handling WSD using Hierarchical Clustering Algorithm with sentences

2018 ◽  
pp. 83-88
Author(s):  
Mohana Priya K ◽  
Pooja Ragavi S ◽  
Krishna Priya G
Keyword(s):  
Hierarchical Clustering ◽  
Similarity Measure ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Cosine Similarity Measure ◽  
Hierarchical Clustering Algorithm ◽  
Multiple Levels ◽  
Pos Tagger ◽  
Sentence Clustering ◽  
The Right

Clustering is the process of grouping objects into subsets that have meaning in the context of a particular problem. It does not rely on predefined classes. It is referred to as an unsupervised learning method because no information is provided about the "right answer" for any of the objects. Many clustering algorithms have been proposed and are used based on different applications. Sentence clustering is one of best clustering technique. Hierarchical Clustering Algorithm is applied for multiple levels for accuracy. For tagging purpose POS tagger, porter stemmer is used. WordNet dictionary is utilized for determining the similarity by invoking the Jiang Conrath and Cosine similarity measure. Grouping is performed with respect to the highest similarity measure value with a mean threshold. This paper incorporates many parameters for finding similarity between words. In order to identify the disambiguated words, the sense identification is performed for the adjectives and comparison is performed. semcor and machine learning datasets are employed. On comparing with previous results for WSD, our work has improvised a lot which gives a percentage of 91.2%

K-MEANS CLUSTERING ALGORITHM BASED CLASSIFICATION OF SOIL FERTILITY IN NORTH WEST NIGERIA

2020 ◽  
Vol 4 (2) ◽  
pp. 780-787
Author(s):  
Ibrahim Hassan Hayatu ◽  
Abdullahi Mohammed ◽  
Barroon Ahmad Isma’eel ◽  
Sahabi Yusuf Ali
Keyword(s):  
Soil Fertility ◽  
Crop Yield ◽  
Clustering Algorithm ◽  
Soil Samples ◽  
North West ◽  
R Programming ◽  
Available Information ◽  
Northwest Region ◽  
The Relationship

Soil fertility determines a plant's development process that guarantees food sufficiency and the security of lives and properties through bumper harvests. The fertility of soil varies according to regions, thereby determining the type of crops to be planted. However, there is no repository or any source of information about the fertility of the soil in any region in Nigeria especially the Northwest of the country. The only available information is soil samples with their attributes which gives little or no information to the average farmer. This has affected crop yield in all the regions, more particularly the Northwest region, thus resulting in lower food production.  Therefore, this study is aimed at classifying soil data based on their fertility in the Northwest region of Nigeria using R programming. Data were obtained from the department of soil science from Ahmadu Bello University, Zaria. The data contain 400 soil samples containing 13 attributes. The relationship between soil attributes was observed based on the data. K-means clustering algorithm was employed in analyzing soil fertility clusters. Four clusters were identified with cluster 1 having the highest fertility, followed by 2 and the fertility decreases with an increasing number of clusters. The identification of the most fertile clusters will guide farmers on where best to concentrate on when planting their crops in order to improve productivity and crop yield.

Sign in / Sign up

Export Citation Format

Share Document