• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2623
  • 525
  • 226
  • 196
  • 138
  • 127
  • 83
  • 83
  • 83
  • 83
  • 83
  • 83
  • 81
  • 29
  • 28
  • Tagged with
  • 5002
  • 5002
  • 1911
  • 1279
  • 1240
  • 985
  • 777
  • 761
  • 696
  • 657
  • 624
  • 492
  • 488
  • 488
  • 443
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
41

Layered abduction for speech recognition from articulation /

Fox, Richard Keith January 1992 (has links)
No description available.
42

Exploiting a functional model of problem solving for error detection in tutoring /

Johnson, Kathy Anne January 1993 (has links)
No description available.
43

Evolutionary algorithms and emergent intelligence /

Angeline, Peter John January 1993 (has links)
No description available.
44

Exploring the computational capabilities of recurrent neural networks /

Kolen, John F. January 1994 (has links)
No description available.
45

Guidelines for handling multidimensionality in a terminological knowledge base.

Bowker, Lynne January 1992 (has links)
The goal of this thesis is to develop and apply a set of guidelines for handling multidimensionality in a terminological knowledge base (TKB). A dimension represents one way of classifying a group of objects; a classification with more than one dimension is said to be multidimensional. The recognition and representation of multidimensionality is a subject that has received very little attention in the terminology literature. One tool for dealing with multidimensionality is CODE (Conceptually Oriented Description Environment). This thesis is divided into four main parts. In Part I, we discuss the general principles of classification, and explain multidimensionality. In Part II, we develop an initial set of guidelines to help terminologists both recognize and represent multidimensionality in a TKB. In Part III, we develop a technical complement to the initial guidelines. We begin with a general description of the CODE system, and then we analyze those features that are particularly helpful for handling multidimensionality. Finally, in Part IV, we apply our guidelines by using the CODE system to construct a small TKB for concepts in a subfield of hypertext, namely hypertext links. (Abstract shortened by UMI.)
46

Hybrid Simulations: New Directions in Combining Machine Learning and Discrete Models

Wozniak, Maciej Kazimierz 04 January 2022 (has links)
No description available.
47

Reinforcement Learning Algorithms: Acceleration Design and Non-asymptotic Theory

Xiong, Huaqing 19 November 2021 (has links)
No description available.
48

Deep Learning for Unstructured Data by Leveraging Domain Knowledge

Zhang, Shanshan January 2019 (has links)
Unstructured data such as texts, strings, images, audios, videos are everywhere due to the social interaction on the Internet and the high-throughput technology in sciences, e.g., chemistry and biology. However, for traditional machine learning algorithms, classifying a text document is far more difficult than classifying a data entry in a spreadsheet. We have to convert the unstructured data into some numeric vectors which can then be understood by machine learning algorithms. For example, a sentence is first converted to a vector of word counts, and then fed into a classification algorithm such as logistic regression and support vector machine. The creation of such numerical vectors is very challenging and difficult. Recent progress in deep learning provides us a new way to jointly learn features and train classifiers for unstructured data. For example, recurrent neural networks proved successful at learning from a sequence of word indices; convolutional neural networks are effective to learn from videos, which are sequences of pixel matrices. Our research focuses on developing novel deep learning approaches for text and graph data. Breakthroughs using deep learning have been made during the last few years for many core tasks in natural language processing, such as machine translation, POS tagging, named entity recognition, etc. However, when it comes to informal and noisy text data, such as tweets, HTMLs, OCR, there are two major issues with modern deep learning technologies. First, deep learning requires large amount of labeled data to train an effective model; second, neural network architectures that work with natural language are not proper with informal text. In this thesis, we address the two important issues and develop new deep learning approaches in four supervised and unsupervised tasks with noisy text. We first present a deep feature engineering approach for informative tweets discovery during the emerging disasters. We propose to use unlabeled microblogs to cluster words into a limited number of clusters and use the word clusters as features for tweets discovery. Our results indicate that when the number of labeled tweets is 100 or less, the proposed approach is superior to the standard classification based on the bag or words feature representation. We then introduce a human-in-the-loop (HIL) framework for entity identification from noisy web text. Our work explores ways to combine the expressive power of REs, ability of deep learning to learn from large data into a new integrated framework for entity identification from web data. The evaluation on several entity identification problems shows that the proposed framework achieves very high accuracy while requiring only a modest human involvement. We further extend the framework of entity identification to an iterative HIL framework that addresses the entity recognition problem. We particularly investigate how human invest their time when a user is allowed to choose between regex construction and manual labeling. Finally, we address a fundamental problem in the text mining domain, i.e, embedding of rare and out-of-vocabulary (OOV) words, by refining word embedding models and character embedding models in an iterative way. We illustrate the simplicity but effectiveness of our method when applying it to online professional profiles allowing noisy user input. Graph neural networks have been shown great success in the domain of drug design and material sciences, where organic molecules and crystal structures of materials are represented as attributed graphs. A deep learning architecture that is capable of learning from graph nodes and graph edges is crucial for property estimation of molecules. In this dissertation, We propose a simple graph representation for molecules and three neural network architectures that is able to directly learn predictive functions from graphs. We discover that, it is true graph networks are superior than feature-driven algorithms for formation energy prediction. However, the superiority can not be reproduced on band gap prediction. We also discovered that our proposed simple shallow neural networks perform comparably with the state-of-the-art deep neural networks. / Computer and Information Science
49

The Simulation of Autonomous Racing Based on Reinforcement Learning

Li, Jiachen, Li 14 August 2018 (has links)
No description available.
50

Experiments with Neural Network Libraries

Khazanova, Yekaterina January 2013 (has links)
No description available.

Page generated in 0.1198 seconds