Einloggen

Thematische Bibliographien / Data Domains

Inhaltsverzeichnis

Dissertationen

Auswahl der wissenschaftlichen Literatur zum Thema „Data Domains“

Autor: Grafiati

Veröffentlicht am 25. Mai 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Data Domains" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Dissertationen zum Thema "Data Domains"

1

Crockett, Keeley Alexandria. "Fuzzy rule induction from data domains." Thesis, Manchester Metropolitan University, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.243720.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

McLean, David. "Improving generalisation in continuous data domains." Thesis, University of Manchester, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.283816.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Hsu, Bo-June (Bo-June Paul). "Language Modeling for limited-data domains." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/52796.

Der volle Inhalt der Quelle

Annotation:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student submitted PDF version of thesis.<br>Includes bibliographical references (p. 99-109).<br>With the increasing focus of speech recognition and natural language processing applications on domains with limited amount of in-domain training data, enhanced system performance often relies on approaches involving mod

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

MAHOTO, NAEEM AHMED. "Data mining techniques for complex application domains." Doctoral thesis, Politecnico di Torino, 2013. http://hdl.handle.net/11583/2506368.

Der volle Inhalt der Quelle

Annotation:

The emergence of advanced communication techniques has increased availability of large collection of data in electronic form in a number of application domains including healthcare, e- business, and e-learning. Everyday a large amount of records are stored electronically. However, finding useful information from such a large data collection is a challenging issue. Data mining technology aims automatically extracting hidden knowledge from large data repositories exploiting sophisticated algorithms. The hidden knowledge in the electronic data may be potentially utilized to facilitate the procedu

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

RICUPERO, GIUSEPPE. "Exploring Data Hierarchies to Discover Knowledge in Different Domains." Doctoral thesis, Politecnico di Torino, 2019. http://hdl.handle.net/11583/2744938.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Carapelle, Claudia. "On the Satisfiability of Temporal Logics with Concrete Domains." Doctoral thesis, Universitätsbibliothek Leipzig, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-190987.

Der volle Inhalt der Quelle

Annotation:

Temporal logics are a very popular family of logical languages, used to specify properties of abstracted systems. In the last few years, many extensions of temporal logics have been proposed, in order to address the need to express more than just abstract properties. In our work we study temporal logics extended by local constraints, which allow to express quantitative properties on data values from an arbitrary relational structure called the concrete domain. An example of concrete domain can be (Z, <, =), where the integers are considered as a relational structure over the binary order relat

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

McGregor, Simon. "Artificial neural networks for novel data domains : principles and examples." Thesis, University of Sussex, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.497000.

Der volle Inhalt der Quelle

Annotation:

I assume that the reader of this thesis is reasonably familiar with artificial neural network (ANN) methods in computer science, including the multi-layer perceptron (ML?) and the backpropagation training method. I have not needed to use any difficult or esoteric mathematics; the major mathematical concept encountered in the thesis is the multiset (which is easy to grasp for anyone familiar with set theory). Certain chapters also make use of the notions of partial derivatives. inner products in arbitrary vector spaces, and metrics.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Ng, Siu Hung. "An extension of the relational data model to incorporate ordered domains." Thesis, University College London (University of London), 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.268033.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Baxter, Rolf Hugh. "Recognising high-level agent behaviour through observations in data scarce domains." Thesis, Heriot-Watt University, 2012. http://hdl.handle.net/10399/2597.

Der volle Inhalt der Quelle

Annotation:

This thesis presents a novel method for performing multi-agent behaviour recognition without requiring large training corpora. The reduced need for data means that robust probabilistic recognition can be performed within domains where annotated datasets are traditionally unavailable (e.g. surveillance, defence). Human behaviours are composed from sequences of underlying activities that can be used as salient features. We do not assume that the exact temporal ordering of such features is necessary, so can represent behaviours using an unordered “bag-of-features”. A weak temporal ordering is imp

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Ferguson, Alexander B. "Higher order strictness analysis by abstract interpretation over finite domains." Thesis, University of Glasgow, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.308143.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!