Preferred Language
Articles
/
8hYn5IsBVTCNdQwCFON1
Graph based text representation for document clustering
...Show More Authors

Advances in digital technology and the World Wide Web has led to the increase of digital documents that are used for various purposes such as publishing and digital library. This phenomenon raises awareness for the requirement of effective techniques that can help during the search and retrieval of text. One of the most needed tasks is clustering, which categorizes documents automatically into meaningful groups. Clustering is an important task in data mining and machine learning. The accuracy of clustering depends tightly on the selection of the text representation method. Traditional methods of text representation model documents as bags of words using term-frequency index document frequency (TFIDF). This method ignores the relationship and meanings of words in the document. As a result the sparsity and semantic problem that is prevalent in textual document are not resolved. In this study, the problem of sparsity and semantic is reduced by proposing a graph based text representation method, namely dependency graph with the aim of improving the accuracy of document clustering. The dependency graph representation scheme is created through an accumulation of syntactic and semantic analysis. A sample of 20 news groups, dataset was used in this study. The text documents undergo pre-processing and syntactic parsing in order to identify the sentence structure. Then the semantic of words are modeled using dependency graph. The produced dependency graph is then used in the process of cluster analysis. K-means clustering technique was used in this study. The dependency graph based clustering result were compared with the popular text representation method, i.e. TFIDF and Ontology based text representation. The result shows that the dependency graph outperforms both TFIDF and Ontology based text representation. The findings proved that the proposed text representation method leads to more accurate document clustering results.

Scopus
Preview PDF
Quick Preview PDF
Publication Date
Tue Sep 24 2024
Journal Name
Arab World English Journal
A Critical Discourse Analysis of Women’s Representation in Maysaloon Hadi’s Novel The Black Eyes
...Show More Authors

This study applies a discourse analysis framework to explore the portrayal of women in Maysloon Hadi’s novel (The Black Eyes) (2011), using Critical Discourse Analysis (CDA) and Norman Fairclough’s tri-dimensional model (1989) as the analytical foundation. It investigates the roles and challenges women face in the novel. While there is growing interest in the portrayal of women in literature, Iraqi literature—especially from the perspective of Iraqi women writers remains underexplored. Hadi’s *The Black Eyes* provides a unique case to examine this intersection. Despite the novel’s rich narrative, which offers insight into Iraqi women’s lives, there is a lack of comprehensive CDA to understand how its language constructs

... Show More
View Publication Preview PDF
Clarivate Crossref
Publication Date
Sun Jul 09 2023
Journal Name
Journal Of Engineering
MR Brain Image Segmentation Using Spatial Fuzzy C- Means Clustering Algorithm
...Show More Authors

conventional FCM algorithm does not fully utilize the spatial information in the image. In this research, we use a FCM algorithm that incorporates spatial information into the membership function for clustering. The spatial function is the summation of the membership functions in the neighborhood of each pixel under consideration. The advantages of the method are that it is less
sensitive to noise than other techniques, and it yields regions more homogeneous than those of other methods. This technique is a powerful method for noisy image segmentation. 

View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Mon Jan 01 2018
Journal Name
Communications In Computer And Information Science
Automatically Recognizing Emotions in Text Using Prediction by Partial Matching (PPM) Text Compression Method
...Show More Authors

In this paper, we investigate the automatic recognition of emotion in text. We perform experiments with a new method of classification based on the PPM character-based text compression scheme. These experiments involve both coarse-grained classification (whether a text is emotional or not) and also fine-grained classification such as recognising Ekman’s six basic emotions (Anger, Disgust, Fear, Happiness, Sadness, Surprise). Experimental results with three datasets show that the new method significantly outperforms the traditional word-based text classification methods. The results show that the PPM compression based classification method is able to distinguish between emotional and nonemotional text with high accuracy, between texts invo

... Show More
View Publication
Scopus (1)
Crossref (3)
Scopus Clarivate Crossref
Publication Date
Wed Oct 20 2021
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Some Topological and Polynomial Indices (Hosoya and Schultz) for the Intersection Graph of the Subgroup of〖 Z〗_(r^n )
...Show More Authors

         Let  be any group with identity element (e) . A subgroup intersection graph of  a subset  is the Graph with V ( ) =  - e and two separate peaks c and d contiguous for c and d if and only if      , Where  is a Periodic subset of resulting from  . We find some topological indicators in this paper and Multi-border (Hosoya and Schultz) of   , where    ,  is aprime number.

View Publication Preview PDF
Crossref
Publication Date
Thu Oct 31 2024
Journal Name
Intelligent Automation And Soft Computing
Fusion of Type-2 Neutrosophic Similarity Measure in Signatures Verification Systems: A New Forensic Document Analysis Paradigm
...Show More Authors

Signature verification involves vague situations in which a signature could resemble many reference samples or might differ because of handwriting variances. By presenting the features and similarity score of signatures from the matching algorithm as fuzzy sets and capturing the degrees of membership, non-membership, and indeterminacy, a neutrosophic engine can significantly contribute to signature verification by addressing the inherent uncertainties and ambiguities present in signatures. But type-1 neutrosophic logic gives these membership functions fixed values, which could not adequately capture the various degrees of uncertainty in the characteristics of signatures. Type-1 neutrosophic representation is also unable to adjust to various

... Show More
View Publication Preview PDF
Crossref (2)
Crossref
Publication Date
Wed Oct 26 2022
Journal Name
Iraqi Journal Of Science
Gene Expression Analysis via Spatial Clustering and Evaluation Indexing
...Show More Authors

The density-based spatial clustering for applications with noise (DBSCAN) is one of the most popular applications of clustering in data mining, and it is used to identify useful patterns and interesting distributions in the underlying data. Aggregation methods for classifying nonlinear aggregated data. In particular, DNA methylations, gene expression. That show the differentially skewed by distance sites and grouped nonlinearly by cancer daisies and the change Situations for gene excretion on it. Under these conditions, DBSCAN is expected to have a desirable clustering feature i that can be used to show the results of the changes. This research reviews the DBSCAN and compares its performance with other algorithms, such as the tradit

... Show More
View Publication
Scopus (3)
Scopus Crossref
Publication Date
Tue Dec 01 2015
Journal Name
Journal Of Engineering
Data Aggregation in Wireless Sensor Networks Using Modified Voronoi Fuzzy Clustering Algorithm
...Show More Authors

Data centric techniques, like data aggregation via modified algorithm based on fuzzy clustering algorithm with voronoi diagram which is called modified Voronoi Fuzzy Clustering Algorithm (VFCA) is presented in this paper. In the modified algorithm, the sensed area divided into number of voronoi cells by applying voronoi diagram, these cells are clustered by a fuzzy C-means method (FCM) to reduce the transmission distance. Then an appropriate cluster head (CH) for each cluster is elected. Three parameters are used for this election process, the energy, distance between CH and its neighbor sensors and packet loss values. Furthermore, data aggregation is employed in each CH to reduce the amount of data transmission which le

... Show More
View Publication Preview PDF
Publication Date
Fri Dec 01 2023
Journal Name
Bulletin Of Electrical Engineering And Informatics
A comparative study of Gaussian mixture algorithm and K-means algorithm for efficient energy clustering in MWSN
...Show More Authors

Wireless sensor networks (WSNs) represent one of the key technologies in internet of things (IoTs) networks. Since WSNs have finite energy sources, there is ongoing research work to develop new strategies for minimizing power consumption or enhancing traditional techniques. In this paper, a novel Gaussian mixture models (GMMs) algorithm is proposed for mobile wireless sensor networks (MWSNs) for energy saving. Performance evaluation of the clustering process with the GMM algorithm shows a remarkable energy saving in the network of up to 92%. In addition, a comparison with another clustering strategy that uses the K-means algorithm has been made, and the developed method has outperformed K-means with superior performance, saving ener

... Show More
View Publication
Scopus (3)
Crossref (3)
Scopus Crossref
Publication Date
Mon Feb 01 2016
Journal Name
Swarm And Evolutionary Computation
Improving the performance of evolutionary multi-objective co-clustering models for community detection in complex social networks
...Show More Authors

Scopus (34)
Crossref (29)
Scopus Clarivate Crossref
Publication Date
Fri Jan 01 2021
Journal Name
Int. J. Nonlinear Anal. Appl.
Feeble regular and feeble normal spaces in α-topological spaces using graph
...Show More Authors

This paper introduces some properties of separation axioms called α -feeble regular and α -feeble normal spaces (which are weaker than the usual axioms) by using elements of graph which are the essential parts of our α -topological spaces that we study them. Also, it presents some dependent concepts and studies their properties and some relationships between them.

Preview PDF
Scopus (1)
Scopus Clarivate