Home Catalogue search

eng

Refine your search:

Search in the Catalogues and Directories






	Sort by
Simple Search

Page: 1 2 3 4 5...12

Hits 1 – 20 of 230

1	Optimal alphabet for single text compression ...
	Allahverdyan, Armen E.; Khachatryan, Andranik. - : arXiv, 2022
	BASE
	Show details

2	A novel source-filter stochastic model for voice production
	Cataldo, Edson; Monteiro, L.; Soize, Christian
	In: ISSN: 0892-1997 ; Journal of Voice ; https://hal-upec-upem.archives-ouvertes.fr/hal-03179837 ; Journal of Voice, Elsevier, 2021, In Press, pp.1-11. ⟨10.1016/j.jvoice.2020.11.015⟩ (2021)
	BASE
	Show details

3	Writing At the Horizon: How Producing Imagined Narratives Affects Mood
	Liang, David Yu-Zhong
	In: Senior Projects Fall 2021 (2021)
	BASE
	Show details

4	Symbolic Model-based Design and Generation of Logical Scenarios for Autonomous Vehicles Validation
	Bannour, Boutheina; Niol, Julien; Crisafulli, Paolo
	In: 2021 IEEE Intelligent Vehicles Symposium (IV) ; https://hal.archives-ouvertes.fr/hal-03540190 ; 2021 IEEE Intelligent Vehicles Symposium (IV), Jul 2021, Nagoya, Japan. pp.215-222, ⟨10.1109/IV48863.2021.9575528⟩ (2021)
	BASE
	Show details

5	Learning a weather dictionary of atmospheric patterns using Latent Dirichlet Allocation
	Fery, Lucas; Dubrulle, Berengere; Podvin, Berengere...
	In: https://hal.archives-ouvertes.fr/hal-03258523 ; 2021 (2021)
	BASE
	Show details

6	Neural Network Reconstruction of Late-Time Cosmology and Null Tests ...
	Dialektopoulos, Konstantinos; Said, Jackson Levi; Mifsud, Jurgen. - : arXiv, 2021
	BASE
	Show details

7	Drift in a Popular Metal Oxide Sensor Dataset Reveals Limitations for Gas Classification Benchmarks ...
	Dennler, Nik; Rastogi, Shavika; Fonollosa, Jordi. - : arXiv, 2021
	BASE
	Show details

8	The Fundamental Limit Theorem of Countable Markov Chains
	Gentry, Nathanael
	In: Senior Honors Theses (2021)
	BASE
	Show details

9	Combination of Time Series Analysis and Sentiment Analysis for Stock Market Forecasting
	Chou, Hsiao-Chuan. - : Digital Commons @ University of South Florida, 2021
	In: Graduate Theses and Dissertations (2021)
	BASE
	Show details

10	Free Energy: A User's Guide
	Mann, Stephen Francis; Pain, Ross; Kirchhoff, Michael. - 2021
	BASE
	Show details

11	Information flow, artificial phonology and typology
	Gafos, Adamantios
	In: Proceedings of the Society for Computation in Linguistics (2021)
	BASE
	Show details

12	Heaps' law and Heaps functions in tagged texts: Evidences of their linguistic relevance ...
	Chacoma, Andrés; Zanette, Damián H.. - : arXiv, 2020
	BASE
	Show details

13	Predictive Validity of Standards-based and Curriculum-embedded Assessments for Predicting Readiness at Kindergarten Entry
	DeCamilla, Elizabeth Ashton. - : Digital Commons @ University of South Florida, 2020
	In: Graduate Theses and Dissertations (2020)
	BASE
	Show details

14	Monolingual and bilingual language networks in healthy subjects using functional MRI and graph theory ...
	Li, Qiongge; Pasquini, Luca; Del Ferraro, Gino. - : arXiv, 2019
	BASE
	Show details

15	The brevity law as a scaling law, and a possible origin of Zipf's law for word frequencies ...
	Corral, Alvaro; Serra, Isabel. - : arXiv, 2019
	BASE
	Show details

16	Multilabel text classification of public procurements using deep learning intent detection ; Textklassificering av offentliga upphandlingar med djupa artificiella neuronnät och avsåtsdetektering
	Suta, Adin. - : KTH, Matematisk statistik, 2019
	BASE
	Show details

17	LSTM vs Random Forest for Binary Classification of Insurance Related Text ; LSTM vs Random Forest för binär klassificering av försäkringsrelaterad text
	Kindbom, Hannes. - : KTH, Matematisk statistik, 2019
	Abstract: The field of natural language processing has received increased attention lately, but less focus is put on comparing models, which differ in complexity. This thesis compares Random Forest to LSTM, for the task of classifying a message as question or non-question. The comparison was done by training and optimizing the models on historic chat data from the Swedish insurance company Hedvig. Different types of word embedding were also tested, such as Word2vec and Bag of Words. The results demonstrated that LSTM achieved slightly higher scores than Random Forest, in terms of F1 and accuracy. The models’ performance were not significantly improved after optimization and it was also dependent on which corpus the models were trained on. An investigation of how a chatbot would affect Hedvig’s adoption rate was also conducted, mainly by reviewing previous studies about chatbots’ effects on user experience. The potential effects on the innovation’s five attributes, relative advantage, compatibility, complexity, trialability and observability were analyzed to answer the problem statement. The results showed that the adoption rate of Hedvig could be positively affected, by improving the first two attributes. The effects a chatbot would have on complexity, trialability and observability were however suggested to be negligible, if not negative. ; Det vetenskapliga området språkteknologi har fått ökad uppmärksamhet den senaste tiden, men mindre fokus riktas på att jämföra modeller som skiljer sig i komplexitet. Den här kandidatuppsatsen jämför Random Forest med LSTM, genom att undersöka hur väl modellerna kan användas för att klassificera ett meddelande som fråga eller icke-fråga. Jämförelsen gjordes genom att träna och optimera modellerna på historisk chattdata från det svenska försäkringsbolaget Hedvig. Olika typer av word embedding, så som Word2vec och Bag of Words, testades också. Resultaten visade att LSTM uppnådde något högre F1 och accuracy än Random Forest. Modellernas prestanda förbättrades inte signifikant efter optimering och resultatet var också beroende av vilket korpus modellerna tränades på. En undersökning av hur en chattbot skulle påverka Hedvigs adoption rate genomfördes också, huvudsakligen genom att granska tidigare studier om chattbotars effekt på användarupplevelsen. De potentiella effekterna på en innovations fem attribut, relativ fördel, kompatibilitet, komplexitet, prövbarhet and observerbarhet analyserades för att kunna svara på frågeställningen. Resultaten visade att Hedvigs adoption rate kan påverkas positivt, genom att förbättra de två första attributen. Effekterna en chattbot skulle ha på komplexitet, prövbarhet och observerbarhet ansågs dock vara försumbar, om inte negativ.
	Keyword: Adoption Rate; Användarupplevelse; Bachelor Thesis; Bag of Words; Classification; Diffusion of Innovation; Kandidatexamensarbete; Klassificering; Machine Learning; Maskininlärning; Natural Language Processing; Neural Networks; Neurala nätverk; Probability Theory and Statistics; Random Forest; Sannolikhetsteori och statistik; Språkteknologi; User Experience
	URL: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-252748
	BASE
	Hide details

18	The flow of ideologies between a political figure and a militant community: a CMC corpora analysis
	Marinica, Claudia; Després, Zakarya; Plancq, Clément...
	In: 6th Conference on Computer-Mediated Communication (CMC) and Social Media Corpora ; https://hal.archives-ouvertes.fr/hal-01872152 ; 6th Conference on Computer-Mediated Communication (CMC) and Social Media Corpora, Sep 2018, Anvers, Belgium (2018)
	BASE
	Show details

19	Statistical Physics of Language Maps in the USA ...
	Burridge, James; Vaux, Bert; Gnacik, Michal. - : arXiv, 2018
	BASE
	Show details

20	Telling apart Felidae and Ursidae from the distribution of nucleotides in mitochondrial DNA ...
	Rovenchak, Andrij. - : arXiv, 2018
	BASE
	Show details

Page: 1 2 3 4 5...12

© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern