Loading...
Search for: ghassem-sani--gholamreza
0.129 seconds

    Temporal Planning using Satifiability

    , M.Sc. Thesis Sharif University of Technology Mahjoob, Ali (Author) ; Ghassem Sani, Gholamreza (Supervisor)
    Abstract
    Automated Planning is an active research area in Artificial Intelligence. In Classical planning, for simplicity, time is considered as the order of actions in plan. In temporal planning, due to the importance of time in real world problems, this simplifying assumption is not considered, and time is explicitly used in the planning process. Most of current methods for temporal planning are extensions of classical planning methods to include the explicit definition of time. Planning using Satisfiability is used as an efficient method to find optimal solutions for classical planning problems. In this dissertation, a temporal planner based on Satisfiability has been developed. This planner, as we... 

    Partial Order Planning using Machine Learning Techniques

    , M.Sc. Thesis Sharif University of Technology Babadi, Amin (Author) ; Ghassem-Sani, Gholamreza (Supervisor)
    Abstract
    Automated planning is a branch of artificial intelligence that studies intelligent agents’ decision making process.In planning, we can design agents that can decide on their own, about how to perform tasksthat are assigned to them. In classical planning, there is a restrictive assumption that actions in plans are totally ordered. By relaxing this restrictive assumption, partial order planninghas been created.Partial order planning uses a general principle, called the least commitment principle that results in a better performance than other classical planning methods. Yet, this branch of planning cannot compete with newer planning methods like heuristic search planning.That is why there has... 

    Persian Grammar Induction Using Unsupervised Data Oriented Parsing

    , M.Sc. Thesis Sharif University of Technology Mesgar, Hassan (Author) ; Ghassem Sani, Gholamreza (Supervisor)
    Abstract
    Automatic grammar induction is one of attractive research topics in natural language processing field. Automatic grammar induction methods can be categorized into three main groups of supervised, semi-supervised and unsupervised methods based on the type of training data that they need. Unsupervised methods are more difficult than two other. Data Oriented Parsing (DOP) is one of successful methods in unsupervised group. This method has been trained by some examples of language as same as child, then it parses new sentences based on its training knowledge. The aim of this project is finding and improving performance of UDOP method on Persian language as a Free Word Order language. Results of... 

    Towards Unsupervised Temporal Relation Extraction Between Events

    , M.Sc. Thesis Sharif University of Technology Mirroshandel, Abolghasem (Author) ; Ghassem-Sani, Gholamreza (Supervisor)
    Abstract
    Temporal relation classification is one of the contemporary demanding tasks in natural language processing. This task can be used in various applications such as question answering, summarization, and language specific information retrieval. Temporal relation classification methods can be categorized into three main groups of supervised, semi-supervised, and unsupervised (based on the type of the training data that they need). In this thesis, we have two main goals: first, improving accuracy of temporal relation learning, and second, decreasing supervision of algorithm as much as possible. For achieving these goals, three main steps are proposed. In the first step, we propose an improved... 

    Automatic Headline Generation for Persian News Texts

    , M.Sc. Thesis Sharif University of Technology Afrasiabi, Shayan (Author) ; Ghassem-Sani, Gholamreza (Supervisor)
    Abstract
    The news headlines should represent the main and the most important topics of their stories. The task of selecting an appropriate headline for news stories is mainly done by journalists. The goal of this project has been the design and implementation of a system to automate this task, that is generating headlines for news. This task has been done for Persian news stories. There are various methods for automatic headline generation in English and some other languages, but no work has been done for Persian, yet. Thus, we have adopted some of the ideas from those methods, and do the remaining by our initiation. Our proposed method consists of three main parts: keyword extraction, most important... 

    Persian Aspect-based Sentiment Analysis Using Learning Methods

    , M.Sc. Thesis Sharif University of Technology Sabeti, Behnam (Author) ; Ghassem Sani, Gholamreza (Supervisor)
    Abstract
    As digital content grows rapidly due to the internet, user reviews about different topics such as product quality can be used as a rich source to check and analyze product quality and performance. Automatic methods are being widely used to extract these information because of the massive amount of available resources. Sentiment analysis is one of the important fields in natural language processing, which uses a combination of learning and rule-based methods to extract subjective information out of documents. Aspect based sentiment analysis deals with sentiment analysis based on each aspect of the product. It consists of two main steps: first, aspects should be extracted from the reviews and... 

    Representation Based Multi-hop Question Answering

    , Ph.D. Dissertation Sharif University of Technology Hemmati, Nima (Author) ; Ghassem Sani, Gholamreza (Supervisor)
    Abstract
    The Question-Answering(QA) problem has long been a significant focus of researchers. Its connection with natural language understanding and knowledge retrieval makes it one of the most critical issues in Natural Language Processing (NLP). Given the inefficiency of simple question-answering methods, multi-hop question-answering (Multi-hop QA) across multiple documents has become one of the most attractive problems in recent years. In general, multi-hop question-answering is supposed to answer natural language questions that require extracting and combining information conained in several documents and performing reasoning about that information. The ability to answer questions and perform... 

    Improving the Efficiency of Domain Independent AI Planning through Automatic Domain Knowledge Extraction

    , M.Sc. Thesis Sharif University of Technology Akramifar, Ali (Author) ; Ghassem-Sani, Gholamreza (Supervisor)
    Abstract
    Planning is an important branch of Artificial Intelligence. It is the area of study concerned with the automatic generation of plans to solve problems within a particular domain. At its simplest case, a plan is a total ordered sequence of actions. Given an initial state, planner tries to find the actions required to achieve some desired goal conditions. Planning technology has been successfully used in a variety of applications, including NASA's Remote-Agent Planner/Scheduler, which was practically employed in the Deep Space 1 spacecraft, satellite planning and scheduling for the European Meteostat, planning in a forest fire simulation system, etc. AI planning encompasses some difficulties... 

    Automatic Event Extraction in Persian Text

    , M.Sc. Thesis Sharif University of Technology Yaghoobzadeh, Yadollah (Author) ; Ghassem Sani, Gholamreza (Supervisor)
    Abstract
    Event extraction is one of the important tasks in Natural Language Processing (NLP). Many NLP applications like question answering, information extraction and summarization need to have some knowledge about events of input documents. There are several definitions for events in NLP domains. In this dissertation, the event is viewed as an element in a network of temporal information. Therefore, the project has been based on the ISO-TimeML specification language, which is the standard scheme for temporal information processing in natural texts. Event extraction based on ISO-TimeML has been performed for a number of languages including English, French, Spanish, and Korean. However, for Persian... 

    Design and Implementation of a Planning-specific Sat Solver

    , M.Sc. Thesis Sharif University of Technology Hamidian Shoormasti, Sina (Author) ; Ghassem-Sani, Gholamreza (Supervisor)
    Abstract
    Automated planning is a branch of Artificial intelligence aimed at obtaining plans (i.e. sequences of actions) for solving complex problems or for governing the behavior of intelligent agents. Reduction of planning problems to satisfiability problems is one of the most successful approaches to automated planning. In this method first the planning problem with a preset length is coded to a satisfiability problem. Then, a general SAT solver is used for solving the obtained SAT formula. To find the plan with optimum length, plans with increasing coding lengths are evaluated by a SAT solver in a sequential manner. Since much of descriptive information of planning problems is lost in converting... 

    Design and Implementation of a Distributed Planning System Prototype

    , M.Sc. Thesis Sharif University of Technology Khademi Khaledi, Hossein (Author) ; Ghassem-Sani, Gholamreza (Supervisor)
    Abstract
    Planning is one of the most important branches of artificial intelligence. The goal of planning is automated production of sequence of actions (plans) for some specified tasks. However the computation done by planners is very time consuming and complicated. Distributing computation is one solution to overcome such difficulties. Distribution divides the load of process between a number of agents and increases robustness. The purpose of this project is to reduce the computational overhead of planning by the means of distributing the planning process between a numbers of planners. In the proposed method, we first divide a classical planning problem to two separate subproblems by decomposition... 

    Persian Named Entity Recognition

    , M.Sc. Thesis Sharif University of Technology Jalali Farahani, Farane (Author) ; Ghassem-Sani, Gholamreza (Supervisor)
    Abstract
    Named entity recognition (NER) is one of important tasks in natural language processing (NLP). Named entities consist of specific nouns such as personal names, organizations, locations, etc., which refer to important entities in text. NER contributes towards other NLP tasks such as machine translation, text summarization ,and text classification. In the recent decade, with respect to development of deep learning (DL) methods, considerable progress has been made in this field. The objective here is to propose an efficient method for NER in Farsi (Persian) text through DL methods. Since deep neural networks require a great deal of training data, and due to the fact that Farsi lacks such data,... 

    Improving Representation and Search in Concurrent Temporal Planning

    , Ph.D. Dissertation Sharif University of Technology Feyzbakhsh Rankouh, Masoud (Author) ; Ghassem Sani, Gholamreza (Supervisor)
    Abstract
    Temporal planning is one of the branches of AI planning, which has attracted a considerable amount of attention in recent years due to the importance of temporal properties in real world planning problems. Like in many other AI fields, there exists an important trade-off in temporal planning between the variety of solvable problems and the efficiency of the planner. Most of the previously proposed temporal planners use heuristic state-space search method. This method, despite being quite efficient, is not complete for so-called “problems with required concurrency”. On the other hand, plan-space based and satisfiability based temporal planners, which can tackle problems with required... 

    Persian Grammar Induction Using Deep Learning

    , M.Sc. Thesis Sharif University of Technology Gholamalitabar Firouzjaei, Maryam (Author) ; Ghassem-Sani, Gholamreza (Supervisor)
    Abstract
    Grammar induction is an important area of natural language processing. There are two general methods for recognizing the syntactic structure: constituency and dependency parsing. The unique nature of the dependency parsing, in which the word order does not affect the syntactic structure of the sentence, make it an appropriate option for parsing free-word-order languages such as the Persian. In this thesis, dependency-based methods are used to parse Persian sentences. Manual induction of the grammar is a time-consuming and tedious task. However, machine learning algorithms facilitated this task to a great deal. One of the most effective algorithms in this field is the deep neural networks... 

    Heuristic Flexibble Planning

    , M.Sc. Thesis Sharif University of Technology Ghiyas Nejad Omran, Pouya (Author) ; Ghassem-Sani, Gholamreza (Supervisor)
    Abstract
    Planning, as one of the major area of the artificial intelligence, has substantial applications in different science and technology fields. In the classical planning, usually some restricted assumptions are made to simplify the planning procedure. For example, for the world representation, states and actions are defined precisely; however, in the real world such information is mostly inacurate. Therefore, in order to address this inacuracy, flexible planning has been developed. In this technique, robust restrictions such as complete satisfaction of preconditions are interpreted as preferences or priority. In other words, the flexible planning aims at fulfilling planning goals with maximum... 

    Improving Robustness of Question Answering Systems Using Deep Neural Networks

    , Ph.D. Dissertation Sharif University of Technology Boreshban, Yasaman (Author) ; Ghassem Sani, Gholamreza (Supervisor) ; Mirroshandel, Abolghasem (Co-Supervisor)
    Abstract
    Question Answering (QA) systems have reached human-level accuracy; however, these systems are vulnerable to adversarial examples. Recently, adversarial attacks have been widely investigated in text classification. However, there have been few research efforts on this topic in QA systems. In this thesis our approach is improving the robustness of QA systems using deep neural networks. In this thesis, as the first proposed approach, the knowledge distillation method is introduced to create a student model to improve the robustness of QA systems. In this regard, the pre-trained BERT model was used as a teacher, and its impact on the robustness of the student models on the Adversarial SQuAD... 

    Employing domain knowledge to improve AI planning efficiency

    , Article Iranian Journal of Science and Technology, Transaction B: Engineering ; Volume 29, Issue 1 B , 2005 , Pages 107-115 ; 03601307 (ISSN) Ghassem Sani, G ; Halavati, R ; Sharif University of Technology
    2005
    Abstract
    One of the most important problems of traditional A.I. planning methods such as non-linear planning is the control of the planning process itself. A non-linear planner confronts many choice points in different steps of the planning process (i.e., selection of the next goal to work on, selection of an action to achieve the goal, and selection of the right order to resolve a conflict), and ideally, it should choose the best option in each case. The partial ordered planner (POP) introduced by Weld in 1994, assumes a magical function called "Choose" to select the best option in each planning step. There have been some previous efforts for the realization of this function; however, most of these... 

    Using satisfiability for non-optimal temporal planning

    , Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Volume 7519 Lnai , 2012 , Pages 176-188 ; 03029743 (ISSN) ; 9783642333521 (ISBN) Rankooh, M. F ; Mahjoob, A ; Ghassem-Sani, G ; Sharif University of Technology
    Springer  2012
    Abstract
    AI planning is one of the research fields that has benefited from employing satisfiability checking methods. These methods have been proved to be very effective in finding optimal plans for both classical and temporal planning. It is also known that by using planning-based heuristic information in solving SAT formulae, one can develop SAT-based planners that are competitive with state-of-the-art non-optimal planners in classical planning domains. However, using satisfiability for non-optimal temporal planning has not been investigated so far. The main difficulty in using satisfiability in temporal planning is the representation of time, which is a continuous concept. Previously introduced... 

    Formal verification of temporal questions in the context of query-answering text summarization

    , Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 28 May 2012 through 30 May 2012 ; Volume 7310 LNAI , May , 2012 , Pages 350-355 ; 03029743 (ISSN) ; 9783642303524 (ISBN) Mostafazadeh, N ; Bakhshandeh Babarsad, O ; Ghassem Sani, G ; Sharif University of Technology
    2012
    Abstract
    This paper presents a novel method for answering complex temporal ordering questions in the context of an event and query-based text summarization. This task is accomplished by precisely mapping the problem of "query-based summarization of temporal ordering questions" in the field of Natural Language Processing to "verifying a finite state model against a temporal formula" in the realm of Model Checking. This mapping requires specific definitions, structures, and procedures. The output of this new approach is promisingly a readable and informative summary satisfying the user's needs  

    Syntactic tree kernels for event-time temporal relation learning

    , Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Volume 6562 LNAI , 2011 , Pages 213-223 ; 03029743 (ISSN) ; 9783642200946 (ISBN) Mirroshandel, S. A ; Khayyamian, M ; Ghassem Sani, G ; Sharif University of Technology
    2011
    Abstract
    Temporal relation classification is one of the contemporary demanding tasks in natural language processing. This task can be used in various applications such as question answering, summarization, and language specific information retrieval. In this paper, we propose an improved algorithm for classifying temporal relations between events and times, using support vector machines (SVM). Along with gold-standard corpus features, the proposed method aims at exploiting useful syntactic features, which are automatically generated, to improve accuracy of the classification. Accordingly, a number of novel kernel functions are introduced and evaluated for temporal relation classification. The result...