Yazılım Mühendisliği Bölümü Yayın Koleksiyonu

Permanent URI for this collectionhttps://hdl.handle.net/20.500.12416/2147

Browse

Filters

2015 - 20203

Settings

Department: search.filters.department.Çankaya UniversityWoS Q: search.filters.wosQuartile.Q4

Search Results

Now showing 1 - 3 of 3
  • Article
    Citation - WoS: 7
    Citation - Scopus: 13
    A Concept-Based Sentiment Analysis Approach for Arabic
    (Zarka Private Univ, 2020) Sever, Hayri; Nasser, Ahmed
    Concept-Based Sentiment Analysis (CBSA) methods are considered to be more advanced and more accurate when it compared to ordinary Sentiment Analysis methods, because it has the ability of detecting the emotions that conveyed by multi-word expressions concepts in language. This paper presented a CBSA system for Arabic language which utilizes both of machine learning approaches and concept-based sentiment lexicon. For extracting concepts from Arabic, a rule-based concept extraction algorithm called semantic parser is proposed. Different types of feature extraction and representation techniques are experimented among the building prosses of the sentiment analysis model for the presented Arabic CBSA system. A comprehensive and comparative experiments using different types of classification methods and classifier fusion models, together with different combinations of our proposed feature sets, are used to evaluate and test the presented CBSA system. The experiment results showed that the best performance for the sentiment analysis model is achieved by combined Support Vector Machine-Logistic Regression (SVM-LR) model where it obtained a F-score value of 93.23% using the Concept-Based-Features + Lexicon-Based-Features + Word2vec-Features (CBF + LEX+ W2V) features combinations.
  • Article
    A Two-Stage Matching Method for Multi-Component Shapes
    (Univ Suceava, Fac Electrical Eng, 2015) Hassanpour, Reza
    In this paper a shape matching algorithm for multiple component objects has been proposed which aims at matching shapes by a two-stage method. The first stage extracts the similarity features of each component using a generic shape representation model. The first stage of our shape matching method normalizes the components for orientation and scaling, and neglects minor deformations. In the second stage, the extracted similarity features of the components are combined with their relative spatial characteristics for shape matching. Some important application areas for the proposed multi-component shape matching are medical image registration, content based medical image retrieval systems, and matching articulated objects which rely on the a-priori information of the model being searched. In these applications, salient features such as vertebrae or rib cage bones can be easily segmented and used. These features however, show differences from person to person on one hand and similarities at different cross-sectional images of the same examination on the other hand. The proposed method has been tested on articulated objects, and reliable registration of 3-dimensional abdominal computed tomography images.
  • Article
    Citation - WoS: 2
    Citation - Scopus: 3
    Single-Machine Scheduling of Indivisible Multi-Operation Jobs
    (Southern African inst industrial Engineering, 2019) Gorur, A. K.; Cetinkaya, F. C.; Catmakas, H. A.
    This paper considers a single-machine scheduling problem of multi-operation jobs where each job consists of several operations processed contiguously, rather than being intermingled with the operations of different jobs. That is, the jobs are indivisible. A sequence-independent setup is required if the machine switches from one operation to another. However, no setup is necessary before the first operation of a job if this first operation is the same as the last operation of the immediately previous job. A job is complete when all of its operations have been processed. We investigate the problem for two cases. Makespan, which is the time needed to complete all jobs, is minimised in the first case; whereas the total completion time, which is the sum of the job completion times, is minimised in the second case. We show that the makespan problem is solvable in polynomial time. For the problem of minimising total completion time, we develop a mixed integer linear programming (MILP) model, which is capable of solving small and medium-sized problem instances optimally, and obtain a very small gap between the solution found and the best possible solution for the unsolved large-sized problem instances.