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.
Treatises concerning analyzing the interior spaces multiplied and their directions varied, that some of them analyzed the interior space on the basis of the intellectual and philosophical affiliation or the historical period and others in the light of the concept and mechanisms of the shape. The researcher has not been able to find a research that dealt with analyzing the space within the systems of shape generation, thus it is possible to determine the research problem with the following question: to what extent is it possible to analyze the interior space based on systems of shape generation? As far as the importance of the research is concerned, it sheds light on five of the systems of the shape generation which are: Syntax, shape gra
... Show MoreCzerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph Kn, Complete bipartite graph Km,n and Complete tripartite graph Kl,m,n. It has also been studied how the lucky number changes whi
... Show Moreيتناول البحث انتشار ظاهرة إعادة فرز وتقسيم الوحدات السكنية ذات المساحات الكبيرة الى قطع
صغيرة وبمساحات تصل أحيانا الى اقل من 100 م 2 وعدم التقيد بقوانين البناء ، وقد وجدت اسباب عدة لتفاقم
وانتشار هذه الظاهرة منها ت ردي الحالة الاقتصادية للمواطن والكثافة السكانية المتزايدة والانشطارات العائلية
وارتفاع بدلات الإيجار وعدم توفر السكن ، وهناك من استغل هذا الامر نتيجة لضعف الرقابة من قبل
الجهات المتخصصة في
The traveling salesman problem (TSP) is a well-known and important combinatorial optimization problem. The goal is to ï¬nd the shortest tour that visits each city in a given list exactly once and then returns to the starting city. In this paper we exploit the TSP to evaluate the minimum total cost (distance or time) for Iraqi cities. So two main methods are investigated to solve this problem; these methods are; Dynamic Programming (DP) and Branch and Bound Technique (BABT). For the BABT, more than one lower and upper bounds are be derived to gain the best one. The results of BABT are completely identical to DP, with less time for number of cities (n), 5 ≤ n ≤ 25. These results proof the efficiency of BABT compared with so
... Show MoreMachine scheduling problems (MSP) are considered as one of the most important classes of combinatorial optimization problems. In this paper, the problem of job scheduling on a single machine is studied to minimize the multiobjective and multiobjective objective function. This objective function is: total completion time, total lead time and maximum tardiness time, respectively, which are formulated as are formulated. In this study, a mathematical model is created to solve the research problem. This problem can be divided into several sub-problems and simple algorithms have been found to find the solutions to these sub-problems and compare them with efficient solutions. For this problem, some rules that provide efficient solutio
... Show MoreIn this article, the inverse source problem is determined by the partition hyperbolic equation under the left end flux tension of the string, where the extra measurement is considered. The approximate solution is obtained in the form of splitting and applying the finite difference method (FDM). Moreover, this problem is ill-posed, dealing with instability of force after adding noise to the additional condition. To stabilize the solution, the regularization matrix is considered. Consequently, it is proved by error estimates between the regularized solution and the exact solution. The numerical results show that the method is efficient and stable.
In this paper a measure of linear local dependence has been used between two
random variables and a study is conducted for the properties of this measure where
two examples of bivariate probability distributions has been considered, which are
bivariate Gumbel distribution and bivariate Beta-Stacy distribution, and applied on
data collected by using a questionnaire conducted to study the reasons for the
increase of application in private collages in Iraq. Five elements has been considered
as random variables and the dependence has been measured between every two
elements to estimate how correlated these elements are and their effect on the
application in private collages of Iraq generally and Baghdad specifically.<
The main purpose of this paper, is to introduce a topological space , which is induced by reflexive graph and tolerance graph , such that may be infinite. Furthermore, we offered some properties of such as connectedness, compactness, Lindelöf and separate properties. We also study the concept of approximation spaces and get the sufficient and necessary condition that topological space is approximation spaces.
Postcolonial theory deals with the effects of colonization on the colonized societies and their cultures. It examines the complex relationship between the colonized and the colonizer, and it represents the textual reactions that deal directly with such an issue. It is also a literary critique to texts that carry racist or colonial implications. The emergence of postcolonial theory as an aspect of literary criticism represents a shift in the focus of studies regarding the relation between the western and non-western worlds.
In contemporary theoretical discourse, Edward Said has been among the more influential postcolonial critics to draw attention to the centrality of imperialism in Western culture. Said’s work has provided a th
... Show MoreThis paper examines the finding of spacewise dependent heat source function in pseudoparabolic equation with initial and homogeneous Dirichlet boundary conditions, as well as the final time value / integral specification as additional conditions that ensure the uniqueness solvability of the inverse problem. However, the problem remains ill-posed because tiny perturbations in input data cause huge errors in outputs. Thus, we employ Tikhonov’s regularization method to restore this instability. In order to choose the best regularization parameter, we employ L-curve method. On the other hand, the direct (forward) problem is solved by a finite difference scheme while the inverse one is reformulated as an optimization problem. The
... Show More