scholarly journals On Bi-gram Graph Attributes

2021 ◽  
Vol 14 (3) ◽  
pp. 78
Author(s):  
Thomas Konstantinovsky ◽  
Matan Mizrachi
Keyword(s):  
Graph Theory ◽  
Graph Coloring ◽  
Semantic Analysis ◽  
Large Datasets ◽  
Corpus Analysis ◽  
Graph Representation ◽  
New Approach ◽  
Graph Density ◽  
Coloring Graph ◽  
Basic Graph

We propose a new approach to text semantic analysis and general corpus analysis using, as termed in this article, a "bi-gram graph" representation of a corpus. The different attributes derived from graph theory are measured and analyzed as unique insights or against other corpus graphs, attributes such as the graph chromatic number and the graph coloring, graph density and graph K-core. We observe a vast domain of tools and algorithms that can be developed on top of the graph representation; creating such a graph proves to be computationally cheap, and much of the heavy lifting is achieved via basic graph calculations. Furthermore, we showcase the different use-cases for the bi-gram graphs and how scalable it proves to be when dealing with large datasets.

scholarly journals ANALISIS PENJADWALAN MATA PELAJARAN MENGGUNAKAN ALGORITMA WELCH-POWELL

2020 ◽  
Vol 3 (1) ◽  
pp. 1-21
Author(s):  
Pramitha Shafika Wicaksono ◽  
Kartono Kartono
Keyword(s):  
Graph Theory ◽  
Graph Coloring ◽  
Academic Staff ◽  
Vertex Coloring ◽  
The Subject ◽  
Coloring Graph

At the beginning of each semester, subjects scheduling is always carried out by the curriculum representatives and academic staff. There were several problems that must be avoided in subjects scheduling, these problems were the schedule of teachers who teach one subject at the same time are scheduled in different classes, teachers who teach more than one subject are scheduled in the same class at the same time, teachers who are lack of scheduled for teaching. In the subject of graph theory, there is a concept of graph coloring, one of which is vertex coloring. In vertex coloring, there is a Welch-Powell Algorithm application which produces a color for each vertex. In subject scheduling, it is assumed that the vertex is the subject and the teacher, while the edge is the class. In vertex coloring, graph vertices are colored so that there's no two neighboring vertices have the same color. The aim of this research was to arrange a lesson schedule so that problems do not occur such as clashes between teachers, subjects, and teaching hours. The method used in arranging this lesson schedule used the Welch-Powell Algorithm. The results obtained were using the Welch-Powell Algorithm to produce a lesson schedule every day where if there are two classes that have the same subject, they can meet the same day requirements but come in different hours and get a lesson schedule that has no clash between teachers, subjects, and teaching hours.

scholarly journals Contribution to Semantic Analysis of Arabic Language

2012 ◽  
Vol 2012 ◽  
pp. 1-8 ◽  
Author(s):  
Anis Zouaghi ◽  
Mounir Zrigui ◽  
Georges Antoniadis ◽  
Laroussi Merhbene
Keyword(s):  
Information Retrieval ◽  
Semantic Analysis ◽  
String Matching ◽  
Ambiguous Word ◽  
Arabic Language ◽  
New Approach ◽  
Matching Algorithm ◽  
Ambiguous Words ◽  
Lesk Algorithm ◽  
Context Of Use

We propose a new approach for determining the adequate sense of Arabic words. For that, we propose an algorithm based on information retrieval measures to identify the context of use that is the closest to the sentence containing the word to be disambiguated. The contexts of use represent a set of sentences that indicates a particular sense of the ambiguous word. These contexts are generated using the words that define the senses of the ambiguous words, the exact string-matching algorithm, and the corpus. We use the measures employed in the domain of information retrieval, Harman, Croft, and Okapi combined to the Lesk algorithm, to assign the correct sense of those proposed.

Fuzzy graph theory in coloring graph

2021 ◽  
Author(s):  
S. Sangeetha ◽  
P. Hema ◽  
N. Selvarani ◽  
P. Geetha ◽  
P. Karthikeyan ◽  
...  
Keyword(s):  
Graph Theory ◽  
Fuzzy Graph ◽  
Coloring Graph

scholarly journals Controllability and Observability of a Large Scale Thermodynamical System via Connectability Approach

2010 ◽  
Author(s):  
Virdiansyah Permana ◽  
Rahmat Shoureshi
Keyword(s):  
Graph Theory ◽  
Lie Algebra ◽  
Large Scale ◽  
Point Of View ◽  
Rank Condition ◽  
Computational Point ◽  
New Approach ◽  
Class System ◽  
Necessary And Sufficient ◽  
Controllability And Observability

This study presents a new approach to determine the controllability and observability of a large scale nonlinear dynamic thermal system using graph-theory. The novelty of this method is in adapting graph theory for nonlinear class and establishing a graphic condition that describes the necessary and sufficient terms for a nonlinear class system to be controllable and observable, which equivalents to the analytical method of Lie algebra rank condition. The directed graph (digraph) is utilized to model the system, and the rule of its adaptation in nonlinear class is defined. Subsequently, necessary and sufficient terms to achieve controllability and observability condition are investigated through the structural property of a digraph called connectability. It will be shown that the connectability condition between input and states, as well as output and states of a nonlinear system are equivalent to Lie-algebra rank condition (LARC). This approach has been proven to be easier from a computational point of view and is thus found to be useful when dealing with a large system.

scholarly journals A New Technique to Solve the Instant Insanity Problem

2016 ◽  
Vol 11 (10) ◽  
pp. 5766-5773
Author(s):  
Salar Y Alsardary ◽  
Hwee Jung Kim ◽  
Julie George
Keyword(s):  
Graph Theory ◽  
Programming Language ◽  
New Technique ◽  
New Approach ◽  
A New Technique

Instant Insanity [1] consists of four cubes, each of whose six faces are colored with one of the four colors: red, blue, white, and green. The object is to stack the cubes in such a way that each of the four colors appears on each side of the resulting column. See figure 1 below[2]. Traditionally, this could be solved using graph theory.However, in this article, we introduce a new technique to solve the problem without using graph theory. We also used a Perl programming language to implement the new approach for the Instant Insanity.

scholarly journals COLLEGE STUDENT’S ERROR ANALYSIS BASED ON THEIR MATHEMATICAL CONNECTIONS ON GRAPH REPRESENTATION

2019 ◽  
Vol 4 (1) ◽  
pp. 18
Author(s):  
I ketut Suastika ◽  
Vivi Suwanti
Keyword(s):  
Graph Theory ◽  
College Student ◽  
Real Life ◽  
Graph Representation ◽  
High Ability ◽  
Pilot Studies ◽  
Graph Representations ◽  
Mathematical Connections ◽  
Life Problems ◽  
Basic Concepts

This study is investigates the college student’s errors on their graph representations making based on the mathematical connections indicators. Pilot studies were conducted with 4 college students of middle to high ability in Graph Theory class. Data analyze revealed that top 3 subject’s errors are 1) Finding the relations of a representations to it’s concepts and procedures, 2) Applying mathematics in other sciences or real life problems, and 3) Finding relations among procedures of the equivalent representations. Their lack of graph concepts understanding and it’s connections plays the major role in their errors. They failed at recognizing and choosing the suitable properties of graph which able to detect the error of their graph representation. So, in order to decrease college student errors in graph representations, we need to strengthen their basic concepts and its connections.

scholarly journals Retrieving Linguistic Information from a Corpus on the Example of Negation in Chinese

2019 ◽  
Vol 9 (2) ◽  
pp. 103-115
Author(s):  
Ľuboš GAJDOŠ
Keyword(s):  
Second Language Acquisition ◽  
Language Acquisition ◽  
Empirical Evidence ◽  
Statistical Data ◽  
Corpus Analysis ◽  
Linguistic Information ◽  
New Approach ◽  
Language Data ◽  
Authentic Language ◽  
Practical Implications

The paper deals with corpus analysis of negation in Chinese, namely the negatives bù 不 and méi/ méiyǒu没/没有. The adverbs BU and MEI are two of the most frequent negatives in Chinese. The aim of this study is to present statistical data together with linguistics analysis. The results provide empirical evidence of discrepancy between “authentic” language data versus linguistic prescription with practical implications for second-language acquisition. The findings inter alia suggest a new approach to verb categorisation.  

scholarly journals A survey of graph coloring - its types, methods and applications

2012 ◽  
Vol 37 (3) ◽  
pp. 223-238 ◽  
Author(s):  
Piotr Formanowicz ◽  
Krzysztof Tanaś
Keyword(s):  
Graph Theory ◽  
Graph Coloring ◽  
Cubic Graphs ◽  
The World ◽  
Computer Scientists

Abstract Graph coloring is one of the best known, popular and extensively researched subject in the field of graph theory, having many applications and conjectures, which are still open and studied by various mathematicians and computer scientists along the world. In this paper we present a survey of graph coloring as an important subfield of graph theory, describing various methods of the coloring, and a list of problems and conjectures associated with them. Lastly, we turn our attention to cubic graphs, a class of graphs, which has been found to be very interesting to study and color. A brief review of graph coloring methods (in Polish) was given by Kubale in [32] and a more detailed one in a book by the same author. We extend this review and explore the field of graph coloring further, describing various results obtained by other authors and show some interesting applications of this field of graph theory.

Sign in / Sign up

Export Citation Format

Share Document