• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 5597
  • 577
  • 282
  • 275
  • 167
  • 157
  • 83
  • 66
  • 50
  • 41
  • 24
  • 21
  • 20
  • 19
  • 12
  • Tagged with
  • 9039
  • 9039
  • 3028
  • 1688
  • 1534
  • 1522
  • 1416
  • 1357
  • 1191
  • 1186
  • 1157
  • 1128
  • 1113
  • 1024
  • 1020
  • 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.
311

An Embedded Seizure Onset Detection System

Kindle, Alexander Lawrence 12 September 2013 (has links)
"A combined hardware and software platform for ambulatory seizure onset detection is presented. The hardware is developed around commercial off-the-shelf components, featuring ADS1299 analog front ends for electroencephalography from Texas Instruments and a Broadcom ARM11 microcontroller for algorithm execution. The onset detection algorithm is a patient-specific support vector machine algorithm. It outperforms a state-of-the-art detector on a reference data set, with 100% sensitivity, 3.4 second average onset detection latency, and on average 1 false positive per 24 hours. The more comprehensive European Epilepsy Database is then evaluated, which highlights several real-world challenges for seizure onset detection, resulting in reduced average sensitivity of 93.5%, 5 second average onset detection latency, and 85.5% specificity. Algorithm enhancements to improve this reduced performance are proposed."
312

Adaptively-Halting RNN for Tunable Early Classification of Time Series

Hartvigsen, Thomas 11 November 2018 (has links)
Early time series classification is the task of predicting the class label of a time series before it is observed in its entirety. In time-sensitive domains where information is collected over time it is worth sacrificing some classification accuracy in favor of earlier predictions, ideally early enough for actions to be taken. However, since accuracy and earliness are contradictory objectives, a solution to this problem must find a task-dependent trade-off. There are two common state-of-the-art methods. The first involves an analyst selecting a timestep at which all predictions must be made. This does not capture earliness on a case-by-case basis, so if the selecting timestep is too early, all later signals are missed, and if a signal happens early, the classifier still waits to generate a prediction. The second method is the exhaustive search for signals, which encodes no timing information and is not scalable to high dimensions or long time series. We design the first early classification model called EARLIEST to tackle this multi-objective optimization problem, jointly learning (1) to decide at which time step to halt and generate predictions and (2) how to classify the time series. Each of these is learned based on the task and data features. We achieve an analyst-controlled balance between the goals of earliness and accuracy by pairing a recurrent neural network that learns to classify time series as a supervised learning task with a stochastic controller network that learns a halting-policy as a reinforcement learning task. The halting-policy dictates sequential decisions, one per timestep, of whether or not to halt the recurrent neural network and classify the time series early. This pairing of networks optimizes a global objective function that incorporates both earliness and accuracy. We validate our method via critical clinical prediction tasks in the MIMIC III database from the Beth Israel Deaconess Medical Center along with another publicly available time series classification dataset. We show that EARLIEST out-performs two state-of-the-art LSTM-based early classification methods. Additionally, we dig deeper into our model's performance using a synthetic dataset which shows that EARLIEST learns to halt when it observes signals without having explicit access to signal locations. The contributions of this work are three-fold. First, our method is the first neural network-based solution to early classification of time series, bringing the recent successes of deep learning to this problem. Second, we present the first reinforcement-learning based solution to the unsupervised nature of early classification, learning the underlying distributions of signals without access to this information through trial and error. Third, we propose the first joint-optimization of earliness and accuracy, allowing learning of complex relationships between these contradictory goals.
313

Semi-Autonomous Wheelchair Navigation With Statistical Context Prediction

Qiao, Junqing 30 May 2016 (has links)
"This research introduces the structure and elements of the system used to predict the user's interested location. The combination of DBSCAN (Density-Based Spatial Clustering of Applications with Noise) algorithm and GMM (Gaussian Mixture Model) algorithm is used to find locations where the user usually visits. In addition, the testing result of applying other clustering algorithms such as Gaussian Mixture model, Density Based clustering algorithm and K-means clustering algorithm on actual data are also shown as comparison. With having the knowledge of locations where the user usually visits, Discrete Bayesian Network is generated from the user's time-sequence location data. Combining the Bayesian Network, the user's current location and the time when the user left the other locations, the user's interested location can be predicted."
314

Deep Learning on Attributed Sequences

Zhuang, Zhongfang 02 August 2019 (has links)
Recent research in feature learning has been extended to sequence data, where each instance consists of a sequence of heterogeneous items with a variable length. However, in many real-world applications, the data exists in the form of attributed sequences, which is composed of a set of fixed-size attributes and variable-length sequences with dependencies between them. In the attributed sequence context, feature learning remains challenging due to the dependencies between sequences and their associated attributes. In this dissertation, we focus on analyzing and building deep learning models for four new problems on attributed sequences. First, we propose a framework, called NAS, to produce feature representations of attributed sequences in an unsupervised fashion. The NAS is capable of producing task independent embeddings that can be used in various mining tasks of attributed sequences. Second, we study the problem of deep metric learning on attributed sequences. The goal is to learn a distance metric based on pairwise user feedback. In this task, we propose a framework, called MLAS, to learn a distance metric that measures the similarity and dissimilarity between attributed sequence feedback pairs. Third, we study the problem of one-shot learning on attributed sequences. This problem is important for a variety of real-world applications ranging from fraud prevention to network intrusion detection. We design a deep learning framework OLAS to tackle this problem. Once the OLAS is trained, we can then use it to make predictions for not only the new data but also for entire previously unseen new classes. Lastly, we investigate the problem of attributed sequence classification with attention model. This is challenging that now we need to assess the importance of each item in each sequence considering both the sequence itself and the associated attributes. In this work, we propose a framework, called AMAS, to classify attributed sequences using the information from the sequences, metadata, and the computed attention. Our extensive experiments on real-world datasets demonstrate that the proposed solutions significantly improve the performance of each task over the state-of-the-art methods on attributed sequences.
315

A machine learning approach for plagiarism detection

Alsallal, M. January 2016 (has links)
Plagiarism detection is gaining increasing importance due to requirements for integrity in education. The existing research has investigated the problem of plagrarim detection with a varying degree of success. The literature revealed that there are two main methods for detecting plagiarism, namely extrinsic and intrinsic. This thesis has developed two novel approaches to address both of these methods. Firstly a novel extrinsic method for detecting plagiarism is proposed. The method is based on four well-known techniques namely Bag of Words (BOW), Latent Semantic Analysis (LSA), Stylometry and Support Vector Machines (SVM). The LSA application was fine-tuned to take in the stylometric features (most common words) in order to characterise the document authorship as described in chapter 4. The results revealed that LSA based stylometry has outperformed the traditional LSA application. Support vector machine based algorithms were used to perform the classification procedure in order to predict which author has written a particular book being tested. The proposed method has successfully addressed the limitations of semantic characteristics and identified the document source by assigning the book being tested to the right author in most cases. Secondly, the intrinsic detection method has relied on the use of the statistical properties of the most common words. LSA was applied in this method to a group of most common words (MCWs) to extract their usage patterns based on the transitivity property of LSA. The feature sets of the intrinsic model were based on the frequency of the most common words, their relative frequencies in series, and the deviation of these frequencies across all books for a particular author. The Intrinsic method aims to generate a model of author “style” by revealing a set of certain features of authorship. The model’s generation procedure focuses on just one author as an attempt to summarise aspects of an author’s style in a definitive and clear-cut manner. The thesis has also proposed a novel experimental methodology for testing the performance of both extrinsic and intrinsic methods for plagiarism detection. This methodology relies upon the CEN (Corpus of English Novels) training dataset, but divides that dataset up into training and test datasets in a novel manner. Both approaches have been evaluated using the well-known leave-one-out-cross-validation method. Results indicated that by integrating deep analysis (LSA) and Stylometric analysis, hidden changes can be identified whether or not a reference collection exists.
316

Fais Ce Qu'il Te Plaît... Mais Fais Le Comme Je L'aime : Amélioration des performances en crowdfunding par l’utilisation des catégories et des récits / Give It To Me Straight... The Way I Like It : Increasing Crowdfunding Performance Using Categories and Narratives

Sitruk, Jonathan 07 September 2018 (has links)
Cette thèse vise à fournir aux entrepreneurs une meilleure compréhension de la façon d'améliorer leur performance lors de la collecte de fonds auprès d’investisseurs. Les entrepreneurs ont des difficultés notoires à accéder aux ressources financières et au capital parce qu'ils souffrent d'un aléa de la nouveauté. Cette condition inhérente est due à leur manque de légitimité dans leur marché cible et conduit les investisseurs à les considérer comme intrinsèquement risqués. Les moyens de financement des entrepreneurs ont traditionnellement été l'épargne personnelle, la famille et les amis, les banques ou les investisseurs professionnels. Le financement participatif est apparu comme une alternative à ceux-ci et les chercheurs dans le domaine de la gestion et de l'entrepreneuriat ont pris un grand intérêt à comprendre ses facettes multiples. La majorité de la recherche sur le financement participatif s’est concentrée sur des éléments quantifiables que les investisseurs utilisent pour déterminer la qualité de la startup. Plus la qualité perçue est élevée, plus les investisseurs ont des chances d'investir. Cependant, en complément de ces éléments de qualité, et non abordés par la recherche jusqu’à présent, sont les éléments qualitatifs qui permettent aux projets d’être plus clairs aux yeux des bailleurs de fonds potentiels tout en transmettant des informations en accord avec les attentes de ces mêmes investisseurs. Cette thèse vise à explorer les stratégies que les entrepreneurs peuvent utiliser pour augmenter leur performance dans le financement participatif en comprenant comment les investisseurs donnent du sens aux projets et comment ils les évaluent étant donné la nature de la plateforme utilisée par l'entrepreneur. Cette thèse contribue aux littératures du crowdfunding, de la catégorisation et des plateformes. La thèse explore d'abord comment les entrepreneurs peuvent utiliser les catégories et les stratégies narratives comme des leviers stratégiques pour améliorer leur performance en abaissant le niveau d'ambiguïté de leur offre tout en alignant leurs stratégies narratives aux attentes de la plateforme qu'ils utilisent. Deuxièmement, cette dissertation empreinte un chemin relativement inexploré en fournissant une critique de la relation qui existe entre l’utilisation de plusieurs catégories, l'ambiguïté et la créativité. De plus, la théorie de la catégorisation est enrichie par une analyse approfondie de l'importance des réseaux sémantiques et des images dans le processus de création de sens (« sense
making ») en utilisant une approche empirique nouvelle. Les images sont d'un intérêt particulier étant donné qu'elles ont leur importance à l’origine de la théorie de la catégorisation. Elles sont également traitées par des moyens cognitifs différents de ceux des mots et sont d'une importance vitale dans le monde d'aujourd'hui. Enfin, cette thèse explore la relation entre les plateformes et les récits en théorisant que les premiers sont des types particuliers d'organisations dont l'identité est forgée par leurs parties prenantes internes et externes. L’identité d’une plateforme est vulnérable aux changements tels que les chocs exogènes. Les entrepreneurs doivent apprendre à identifier ces identités ainsi que les changements potentiels afin d'adapter leurs stratégies narratives dans l’espoir d’augmenter leur performance. / This dissertation aims to provide entrepreneurs with a better understanding of how to improve their performance when raising funds from investors. Entrepreneurs have difficulty accessing financial resources and capital because they suffer from a liability of newness. This inherent condition is due to their lack of legitimacy in their target market and leads investors to see them as inherently risky. The traditional means of financing new venture ideas have been through personal savings, family and friends, banks, or professional investors. Crowdfunding has emerged as an alternative to these and scholars in the field of management and entrepreneurship have taken great interest in understanding its multiple facets. Most research in crowdfunding has focused on quantifiable elements that investors use in order to determine the quality of an entrepreneur’s venture. The higher the perceived quality, the higher the likelihood investors have of investing in it. However, orthogonal to these elements of quality, and not addressed in current research, are those qualitative elements that allow projects to become clearer in the eyes of potential funders and transmit valuable information about the venture in a coherent fashion regarding the medium they are raising funds from. This dissertation aims to explore strategies entrepreneurs can use to increase their performance in crowdfunding by understanding how investors make sense of projects and how they evaluate them given the nature of the platform used by the entrepreneur. This thesis contributes to the literature on crowdfunding, categorization, and platforms. The thesis first explores how entrepreneurs can use categories and narrative strategies as strategic levers to improve their performance by lowering the level of ambiguity of their offer while aligning their narrative strategies to the expectations of the platform they use. On a second level, the dissertation provides a deeper understanding of the relation that exists between category spanning, ambiguity, and creativity by addressing this relatively unexplored path. Categorization theory is further enriched through a closer examination of the importance of semantic networks and visuals in the sense making process by using a novel empirical approach. Visuals are of particular interest given they were of seminal importance at the foundation of categorization theory, are processed by different cognitive means than words, and are of vital importance in today’s world. Finally, the dissertation explores the relation between platforms and narratives by theorizing that the former are particular types of organizations whose identity is forged by their internal and external stakeholders. Platform identities are vulnerable to change such as exogenous shocks. Entrepreneurs need to learn how to identify these identities and potential changes in order to tailor their narrative strategies in the hopes of increasing their performance.
317

Using machine learning to predict gene expression and discover sequence motifs

Li, Xuejing January 2012 (has links)
Recently, large amounts of experimental data for complex biological systems have become available. We use tools and algorithms from machine learning to build data-driven predictive models. We first present a novel algorithm to discover gene sequence motifs associated with temporal expression patterns of genes. Our algorithm, which is based on partial least squares (PLS) regression, is able to directly model the flow of information, from gene sequence to gene expression, to learn cis regulatory motifs and characterize associated gene expression patterns. Our algorithm outperforms traditional computational methods e.g. clustering in motif discovery. We then present a study of extending a machine learning model for transcriptional regulation predictive of genetic regulatory response to Caenorhabditis elegans. We show meaningful results both in terms of prediction accuracy on the test experiments and biological information extracted from the regulatory program. The model discovers DNA binding sites ab intio. We also present a case study where we detect a signal of lineage-specific regulation. Finally we present a comparative study on learning predictive models for motif discovery, based on different boosting algorithms: Adaptive Boosting (AdaBoost), Linear Programming Boosting (LPBoost) and Totally Corrective Boosting (TotalBoost). We evaluate and compare the performance of the three boosting algorithms via both statistical and biological validation, for hypoxia response in Saccharomyces cerevisiae.
318

Machine learning and computer algebra

Huang, Zongyan January 2015 (has links)
No description available.
319

Automating the interpretation of thermal paints applied to gas turbine engines using Raman spectroscopy and machine learning

Russell, Bryn January 2015 (has links)
Thermal paints are paints that exhibit a number of permanent colour changes at various temperatures. Rolls-Royce, a producer of gas turbine engines, use thermal paints to map the surface heat distribution over components in gas turbine engines. Engine components are coated with thermal paints and built into engines. The engine is run which heats the components, and hence the paints. This results in a colour distribution over the surface of the painted components. This project aims to generate predictions for the temperature that the thermal paints applied to gas turbine engines have reached during engine operation. Training models are built using Raman spectra taken from known temperature paint samples. Raman spectra from the painted engine components are tested in these training models to generate temperature predictions. The known temperature paint samples are heated in an oven, while the paints applied to engine component are heated in a gas turbine engine. This leads to differences in the spectra of the known temperature paints and the engine run paints, complicating the training model. This thesis presents a method for classifying the spectra from the known temperature paints samples and the unknown temperature engine samples in such a way that meaningful predictive models can be built.
320

Studies of model selection and regularization for generalization in neural networks with applications. / CUHK electronic theses & dissertations collection

January 2002 (has links)
Guo Ping. / "March 2002." / Thesis (Ph.D.)--Chinese University of Hong Kong, 2002. / Includes bibliographical references (p. 166-182). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Mode of access: World Wide Web. / Abstracts in English and Chinese.

Page generated in 0.0945 seconds