subject:(Nearest neighbour random fields)

Vilnius University

1. Puplinskaitė, Donata. Autoregresinių procesų ir atsitiktinių laukų su baigtine arba begaline dispersija agregavimas.

Degree: PhD, Mathematics, 2013, Vilnius University

URL: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20131029_102452-85316 ;

►

Agreguoti duomenys naudojami daugelyje mokslo sričių tokių kaip ekonomika, sociologija, geografija ir kt. Tai motyvuoja tirti (de)agregavimo uždavinį. Viena iš pagrindinių priežasčių kodėl vienalaikis agregavimas… (more)

▼

Agreguoti duomenys naudojami daugelyje mokslo sričių tokių kaip ekonomika, sociologija, geografija ir kt. Tai motyvuoja tirti (de)agregavimo uždavinį. Viena iš pagrindinių priežasčių kodėl vienalaikis agregavimas tapo tyrimų objektu yra galimybė gauti ilgos atminties procesus. Agregavimas paaiškina ilgos atminties atsiradima procesuose ir yra vienas iš būdų tokius procesus generuoti. Agreguodami trumpos atminties neergodiškus atsitiktinius procesus, galime gauti ilgos atminties ergodišką procesą, kuris gali būti naudojamas mikro ir makro kintamųjų prognozavimui. Disertacijoje nagrinėjama AR(1) procesų bei artimiausio kaimyno atsitiktinių laukų, turinčių begalinę dispersiją, agregavimo schema, randamos sąlygos, kurioms esant ribinis agreguotas procesas egzistuoja, ir turi ilgąją atmintį tam tikra prasme. Atsitiktinių laukų atveju, įvedamas anizotropinės/izotropinės ilgos atminties apibrėžimas, kuris yra paremtas dalinių sumų elgesiu. Baigtinės dispersijos atveju yra gerai žinoma nepriklausomų AR(1) procesų schema, kuri rezultate duoda Gauso ribinį agreguotą procesą. Disertacijoje aprašoma trikampio masyvo agregavimo modelis, kuris baigtinės dispersijos atveju duoda nebūtinai Gauso ribinį agreguotą procesą. Taip pat disertacijoje nagrinėjama bankroto tikimybės asimptotika, kai žalos yra aprašomos sunkiauodegiu agreguotu procesu, nusakoma priklausomybė tarp žalų, apibūdinama žalų ilga atmintis.

Aggregated data appears in many areas such as econimics, sociology, geography, etc. This motivates an importance of studying the (dis)aggregation problem. One of the most important reasons why the contemporaneous aggregation become an object of research is the possibility of obtaining the long memory phenomena in processes. The aggregation provides an explanation of the long-memory effect in time series and a simulation method of such series as well. Accumulation of short-memory non-ergodic random processes can lead to the long memory ergodic process, that can be used for the forecasts of the macro and micro variables. We explore the aggregation scheme of AR(1) processes and nearest-neighbour random fields with infinite variance. We provide results on the existence of limit aggregated processes, and find conditions under which it has long memory properties in certain sense. For the random fields on Z², we introduce the notion of (an)isotropic long memory based on the behavior of partial sums. In L₂ case, the known aggregation of independent AR(1) processes leads to the Gaussian limit. While we describe a new model of aggregation based on independent triangular arrays. This scheme gives the limit aggregated process with finite variance which is not necessary Gaussian. We study a discrete time risk insurance model with stationary claims, modeled by the aggregated heavy-tailed process. We establish the asymptotic properties of the ruin probability and the dependence structure... [to full text]

Advisors/Committee Members: PAULAUSKAS, VYGANTAS (Doctoral dissertation committee chair), DAVYDOV, YOURI (Doctoral dissertation committee member), LEIPUS, REMIGIJUS (Doctoral dissertation committee member), RAČKAUSKAS, ALFREDAS (Doctoral dissertation committee member), SUQUET, CHARLES (Doctoral dissertation committee member), JAKUBOWKI, ADAM (Doctoral dissertation opponent), SOULIER, PHILIPPE (Doctoral dissertation opponent), SURGAILIS, DONATAS (Doctoral dissertation supervisor), PHILIPPE, ANNE (Doctoral dissertation advisor).

Subjects/Keywords: Agregavimas; Ilga atmintis; Atsitiktinis procesas; Artimiausio kaimynio laukai; Aggregation; Long memory; Random process; Nearest-neighbour random fields

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Puplinskaitė, D. (2013). Autoregresinių procesų ir atsitiktinių laukų su baigtine arba begaline dispersija agregavimas. (Doctoral Dissertation). Vilnius University. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20131029_102452-85316 ;

Chicago Manual of Style (16^th Edition):

Puplinskaitė, Donata. “Autoregresinių procesų ir atsitiktinių laukų su baigtine arba begaline dispersija agregavimas.” 2013. Doctoral Dissertation, Vilnius University. Accessed March 09, 2021. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20131029_102452-85316 ;.

MLA Handbook (7^th Edition):

Puplinskaitė, Donata. “Autoregresinių procesų ir atsitiktinių laukų su baigtine arba begaline dispersija agregavimas.” 2013. Web. 09 Mar 2021.

Vancouver:

Puplinskaitė D. Autoregresinių procesų ir atsitiktinių laukų su baigtine arba begaline dispersija agregavimas. [Internet] [Doctoral dissertation]. Vilnius University; 2013. [cited 2021 Mar 09]. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20131029_102452-85316 ;.

Council of Science Editors:

Puplinskaitė D. Autoregresinių procesų ir atsitiktinių laukų su baigtine arba begaline dispersija agregavimas. [Doctoral Dissertation]. Vilnius University; 2013. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20131029_102452-85316 ;

Vilnius University

2. Puplinskaitė, Donata. Aggregation of autoregressive processes and random fields with finite or infinite variance.

Degree: Dissertation, Mathematics, 2013, Vilnius University

URL: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20131029_102339-22917 ;

►

Aggregated data appears in many areas such as econimics, sociology, geography, etc. This motivates an importance of studying the (dis)aggregation problem. One of the most… (more)

▼

Aggregated data appears in many areas such as econimics, sociology, geography, etc. This motivates an importance of studying the (dis)aggregation problem. One of the most important reasons why the contemporaneous aggregation become an object of research is the possibility of obtaining the long memory phenomena in processes. The aggregation provides an explanation of the long-memory effect in time series and a simulation method of such series as well. Accumulation of short-memory non-ergodic random processes can lead to the long memory ergodic process, that can be used for the forecasts of the macro and micro variables. We explore the aggregation scheme of AR(1) processes and nearest-neighbour random fields with infinite variance. We provide results on the existence of limit aggregated processes, and find conditions under which it has long memory properties in certain sense. For the random fields on Z², we introduce the notion of (an)isotropic long memory based on the behavior of partial sums. In L₂ case, the known aggregation of independent AR(1) processes leads to the Gaussian limit. While we describe a new model of aggregation based on independent triangular arrays. This scheme gives the limit aggregated process with finite variance which is not necessary Gaussian. We study a discrete time risk insurance model with stationary claims, modeled by the aggregated heavy-tailed process. We establish the asymptotic properties of the ruin probability and the dependence structure... [to full text]

Agreguoti duomenys naudojami daugelyje mokslo sričių tokių kaip ekonomika, sociologija, geografija ir kt. Tai motyvuoja tirti (de)agregavimo uždavinį. Viena iš pagrindinių priežasčių kodėl vienalaikis agregavimas tapo tyrimų objektu yra galimybė gauti ilgos atminties procesus. Agregavimas paaiškina ilgos atminties atsiradima procesuose ir yra vienas iš būdų tokius procesus generuoti. Agreguodami trumpos atminties neergodiškus atsitiktinius procesus, galime gauti ilgos atminties ergodišką procesą, kuris gali būti naudojamas mikro ir makro kintamųjų prognozavimui. Disertacijoje nagrinėjama AR(1) procesų bei artimiausio kaimyno atsitiktinių laukų, turinčių begalinę dispersiją, agregavimo schema, randamos sąlygos, kurioms esant ribinis agreguotas procesas egzistuoja, ir turi ilgąją atmintį tam tikra prasme. Atsitiktinių laukų atveju, įvedamas anizotropinės/izotropinės ilgos atminties apibrėžimas, kuris yra paremtas dalinių sumų elgesiu. Baigtinės dispersijos atveju yra gerai žinoma nepriklausomų AR(1) procesų schema, kuri rezultate duoda Gauso ribinį agreguotą procesą. Disertacijoje aprašoma trikampio masyvo agregavimo modelis, kuris baigtinės dispersijos atveju duoda nebūtinai Gauso ribinį agreguotą procesą. Taip pat disertacijoje nagrinėjama bankroto tikimybės asimptotika, kai žalos yra aprašomos sunkiauodegiu agreguotu procesu, nusakoma priklausomybė tarp žalų, apibūdinama žalų ilga atmintis.

Advisors/Committee Members: PAULAUSKAS, VYGANTAS (Doctoral dissertation committee chair), DAVYDOV, YOURI (Doctoral dissertation committee member), LEIPUS, REMIGIJUS (Doctoral dissertation committee member), RAČKAUSKAS, ALFREDAS (Doctoral dissertation committee member), SUQUET, CHARLES (Doctoral dissertation committee member), JAKUBOWKI, ADAM (Doctoral dissertation opponent), SOULIER, PHILIPPE (Doctoral dissertation opponent), SURGAILIS, DONATAS (Doctoral dissertation supervisor), PHILIPPE, ANNE (Doctoral dissertation advisor).

Subjects/Keywords: Aggregation; Long memory; Random process; Nearest-neighbour random fields; Agregavimas; Ilga atmintis; Atsitiktiniai procesai; Artimiausio kaimyno atsitiktiniai laukai

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Puplinskaitė, D. (2013). Aggregation of autoregressive processes and random fields with finite or infinite variance. (Doctoral Dissertation). Vilnius University. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20131029_102339-22917 ;

Chicago Manual of Style (16^th Edition):

Puplinskaitė, Donata. “Aggregation of autoregressive processes and random fields with finite or infinite variance.” 2013. Doctoral Dissertation, Vilnius University. Accessed March 09, 2021. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20131029_102339-22917 ;.

MLA Handbook (7^th Edition):

Puplinskaitė, Donata. “Aggregation of autoregressive processes and random fields with finite or infinite variance.” 2013. Web. 09 Mar 2021.

Vancouver:

Puplinskaitė D. Aggregation of autoregressive processes and random fields with finite or infinite variance. [Internet] [Doctoral dissertation]. Vilnius University; 2013. [cited 2021 Mar 09]. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20131029_102339-22917 ;.

Council of Science Editors:

Puplinskaitė D. Aggregation of autoregressive processes and random fields with finite or infinite variance. [Doctoral Dissertation]. Vilnius University; 2013. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20131029_102339-22917 ;

Linnaeus University

3. Pedersen, Jesper Landmér. Weighing Machine Learning Algorithms for Accounting RWISs Characteristics in METRo : A comparison of Random Forest, Deep Learning & kNN.

Degree: computer science and media technology (CM), 2019, Linnaeus University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-85586

► The numerical model to forecast road conditions, Model of the Environment and Temperature of Roads (METRo), laid the foundation of solving the energy balance… (more)

Subjects/Keywords: machine learning; neural network; random forest; k-nearest neighbour; model of the environment and temperature of roads; Computer Sciences; Datavetenskap (datalogi)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Pedersen, J. L. (2019). Weighing Machine Learning Algorithms for Accounting RWISs Characteristics in METRo : A comparison of Random Forest, Deep Learning & kNN. (Thesis). Linnaeus University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-85586

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Pedersen, Jesper Landmér. “Weighing Machine Learning Algorithms for Accounting RWISs Characteristics in METRo : A comparison of Random Forest, Deep Learning & kNN.” 2019. Thesis, Linnaeus University. Accessed March 09, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-85586.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Pedersen, Jesper Landmér. “Weighing Machine Learning Algorithms for Accounting RWISs Characteristics in METRo : A comparison of Random Forest, Deep Learning & kNN.” 2019. Web. 09 Mar 2021.

Vancouver:

Pedersen JL. Weighing Machine Learning Algorithms for Accounting RWISs Characteristics in METRo : A comparison of Random Forest, Deep Learning & kNN. [Internet] [Thesis]. Linnaeus University; 2019. [cited 2021 Mar 09]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-85586.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pedersen JL. Weighing Machine Learning Algorithms for Accounting RWISs Characteristics in METRo : A comparison of Random Forest, Deep Learning & kNN. [Thesis]. Linnaeus University; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-85586

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Universiteit Utrecht

4. Plattel, C.J. Distributed and Incremental Clustering using Shared Nearest Neighbours.

Degree: 2014, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/296602

► Cluster analysis is a large field inside data mining. It tries to capture the structure of a data set by grouping similar data points into… (more)

Subjects/Keywords: Clustering; Algorithms; Incremental; Distributed; Shared Nearest Neighbour

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Plattel, C. J. (2014). Distributed and Incremental Clustering using Shared Nearest Neighbours. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/296602

Chicago Manual of Style (16^th Edition):

Plattel, C J. “Distributed and Incremental Clustering using Shared Nearest Neighbours.” 2014. Masters Thesis, Universiteit Utrecht. Accessed March 09, 2021. http://dspace.library.uu.nl:8080/handle/1874/296602.

MLA Handbook (7^th Edition):

Plattel, C J. “Distributed and Incremental Clustering using Shared Nearest Neighbours.” 2014. Web. 09 Mar 2021.

Vancouver:

Plattel CJ. Distributed and Incremental Clustering using Shared Nearest Neighbours. [Internet] [Masters thesis]. Universiteit Utrecht; 2014. [cited 2021 Mar 09]. Available from: http://dspace.library.uu.nl:8080/handle/1874/296602.

Council of Science Editors:

Plattel CJ. Distributed and Incremental Clustering using Shared Nearest Neighbours. [Masters Thesis]. Universiteit Utrecht; 2014. Available from: http://dspace.library.uu.nl:8080/handle/1874/296602

KTH

5. Dyremark, Johanna. Bedömning av elevuppsatser genom maskininlärning.

Degree: Electrical Engineering and Computer Science (EECS), 2019, KTH

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-262041

►

Betygsättning upptar idag en stor del av lärares arbetstid och det finns en betydande inkonsekvens vid bedömning utförd av olika lärare. Denna studie ämnar… (more)

▼

Betygsättning upptar idag en stor del av lärares arbetstid och det finns en betydande inkonsekvens vid bedömning utförd av olika lärare. Denna studie ämnar undersöka vilken träffsäkerhet som en automtiserad bedömningsmodell kan uppnå. Tre maskininlärningsmodeller för klassifikation i form av Linear Discriminant Analysis, K-Nearest Neighbor och Random Forest tränas och testas med femfaldig korsvalidering på uppsatser från nationella prov i svenska. Klassificeringen baseras på språk och formrelaterade attribut inkluderande ord och teckenvisa längdmått, likhet med texter av olika formalitetsgrad och grammatikrelaterade mått. Detta utmynnar i ett maximalt quadratic weighted kappa-värde på 0,4829 och identisk överensstämmelse med expertgivna betyg i 57,53 % av fallen. Dessa resultat uppnåddes av en modell baserad på Linear Discriminant Analysis och uppvisar en högre korrelation med expertgivna betyg än en ordinarie lärare. Trots pågående digitalisering inom skolväsendet kvarstår ett antal hinder innan fullständigt maskininlärningsbaserad bedömning kan realiseras, såsom användarnas inställning till tekniken, etiska dilemman och teknikens svårigheter med förståelse av semantik. En delvis integrerad automatisk betygssättning har dock potential att identifiera uppsatser där behov av dubbelrättning föreligger, vilket kan öka överensstämmelsen vid storskaliga prov till en låg kostnad.

Today, a large amount of a teacher’s workload is comprised of essay scoring and there is a large variability between teachers’ gradings. This report aims to examine what accuracy can be acceived with an automated essay scoring system for Swedish. Three following machine learning models for classification are trained and tested with 5-fold cross-validation on essays from Swedish national tests: Linear Discriminant Analysis, K-Nearest Neighbour and Random Forest. Essays are classified based on 31 language structure related attributes such as token-based length measures, similarity to texts with different formal levels and use of grammar. The results show a maximal quadratic weighted kappa value of 0.4829 and a grading identical to expert’s assessment in 57.53% of all tests. These results were achieved by a model based on Linear Discriminant Analysis and showed higher inter-rater reliability with expert grading than a local teacher. Despite an ongoing digitilization within the Swedish educational system, there are a number of obstacles preventing a complete automization of essay scoring such as users’ attitude, ethical issues and the current techniques difficulties in understanding semantics. Nevertheless, a partial integration of automatic essay scoring has potential to effectively identify essays suitable for double grading which can increase the consistency of large-scale tests to a low cost.

Subjects/Keywords: Automated essay scoring; machine learning; classification; linear discriminant analysis; k-nearest neighbour; random forest; language technology; natural language processing; Computer and Information Sciences; Data- och informationsvetenskap

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Dyremark, J. (2019). Bedömning av elevuppsatser genom maskininlärning. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-262041

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Dyremark, Johanna. “Bedömning av elevuppsatser genom maskininlärning.” 2019. Thesis, KTH. Accessed March 09, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-262041.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Dyremark, Johanna. “Bedömning av elevuppsatser genom maskininlärning.” 2019. Web. 09 Mar 2021.

Vancouver:

Dyremark J. Bedömning av elevuppsatser genom maskininlärning. [Internet] [Thesis]. KTH; 2019. [cited 2021 Mar 09]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-262041.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dyremark J. Bedömning av elevuppsatser genom maskininlärning. [Thesis]. KTH; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-262041

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Dundee

6. Jia, Wei. Image analysis and representation for textile design classification.

Degree: PhD, 2011, University of Dundee

URL: https://discovery.dundee.ac.uk/en/studentTheses/c667f279-d7a6-4670-b23e-c9dbe2784266 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.578781

► A good image representation is vital for image comparision and classification; it may affect the classification accuracy and efficiency. The purpose of this thesis was… (more)

▼ A good image representation is vital for image comparision and classification; it may affect the classification accuracy and efficiency. The purpose of this thesis was to explore novel and appropriate image representations. Another aim was to investigate these representations for image classification. Finally, novel features were examined for improving image classification accuracy. Images of interest to this thesis were textile design images. The motivation of analysing textile design images is to help designers browse images, fuel their creativity, and improve their design efficiency. In recent years, bag-of-words model has been shown to be a good base for image representation, and there have been many attempts to go beyond this representation. Bag-of-words models have been used frequently in the classification of image data, due to good performance and simplicity. “Words” in images can have different definitions and are obtained through steps of feature detection, feature description, and codeword calculation. The model represents an image as an orderless collection of local features. However, discarding the spatial relationships of local features limits the power of this model. This thesis exploited novel image representations, bag of shapes and region label graphs models, which were based on bag-of-words model. In both models, an image was represented by a collection of segmented regions, and each region was described by shape descriptors. In the latter model, graphs were constructed to capture the spatial information between groups of segmented regions and graph features were calculated based on some graph theory. Novel elements include use of MRFs to extract printed designs and woven patterns from textile images, utilisation of the extractions to form bag of shapes models, and construction of region label graphs to capture the spatial information. The extraction of textile designs was formulated as a pixel labelling problem. Algorithms for MRF optimisation and re-estimation were described and evaluated. A method for quantitative evaluation was presented and used to compare the performance of MRFs optimised using alpha-expansion and iterated conditional modes (ICM), both with and without parameter re-estimation. The results were used in the formation of the bag of shapes and region label graphs models. Bag of shapes model was a collection of MRFs' segmented regions, and the shape of each region was described with generic Fourier descriptors. Each image was represented as a bag of shapes. A simple yet competitive classification scheme based on nearest neighbour class-based matching was used. Classification performance was compared to that obtained when using bags of SIFT features. To capture the spatial information, region label graphs were constructed to obtain graph features. Regions with the same label were treated as a group and each group was associated uniquely with a vertex in an undirected, weighted graph. Each region group was represented as a bag of shape descriptors. Edges in the graph denoted either…

Subjects/Keywords: 004; Image classification; Image representation; Bag of shapes; Chromatic number; Domination number; Markov Random Field; Support Vector Machine; Region label graphs; Nearest neighbour

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Jia, W. (2011). Image analysis and representation for textile design classification. (Doctoral Dissertation). University of Dundee. Retrieved from https://discovery.dundee.ac.uk/en/studentTheses/c667f279-d7a6-4670-b23e-c9dbe2784266 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.578781

Chicago Manual of Style (16^th Edition):

Jia, Wei. “Image analysis and representation for textile design classification.” 2011. Doctoral Dissertation, University of Dundee. Accessed March 09, 2021. https://discovery.dundee.ac.uk/en/studentTheses/c667f279-d7a6-4670-b23e-c9dbe2784266 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.578781.

MLA Handbook (7^th Edition):

Jia, Wei. “Image analysis and representation for textile design classification.” 2011. Web. 09 Mar 2021.

Vancouver:

Jia W. Image analysis and representation for textile design classification. [Internet] [Doctoral dissertation]. University of Dundee; 2011. [cited 2021 Mar 09]. Available from: https://discovery.dundee.ac.uk/en/studentTheses/c667f279-d7a6-4670-b23e-c9dbe2784266 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.578781.

Council of Science Editors:

Jia W. Image analysis and representation for textile design classification. [Doctoral Dissertation]. University of Dundee; 2011. Available from: https://discovery.dundee.ac.uk/en/studentTheses/c667f279-d7a6-4670-b23e-c9dbe2784266 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.578781

University of Guelph

7. Mair, Nicholas. Location Sensing Using Bluetooth for GPS Suppression.

Degree: MS, Department of Computing and Information Science, 2012, University of Guelph

URL: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/3928

► With the ubiquity of mobile devices, there has been increased interest in determining how they can be used with location-based services. These types of services… (more)

Subjects/Keywords: Bluetooth; Mobile Device Localization; Location Based Services; K-Nearest Neighbour

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Mair, N. (2012). Location Sensing Using Bluetooth for GPS Suppression. (Masters Thesis). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/3928

Chicago Manual of Style (16^th Edition):

Mair, Nicholas. “Location Sensing Using Bluetooth for GPS Suppression.” 2012. Masters Thesis, University of Guelph. Accessed March 09, 2021. https://atrium.lib.uoguelph.ca/xmlui/handle/10214/3928.

MLA Handbook (7^th Edition):

Mair, Nicholas. “Location Sensing Using Bluetooth for GPS Suppression.” 2012. Web. 09 Mar 2021.

Vancouver:

Mair N. Location Sensing Using Bluetooth for GPS Suppression. [Internet] [Masters thesis]. University of Guelph; 2012. [cited 2021 Mar 09]. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/3928.

Council of Science Editors:

Mair N. Location Sensing Using Bluetooth for GPS Suppression. [Masters Thesis]. University of Guelph; 2012. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/3928

8. Berrett, Thomas Benjamin. Modern k-Nearest Neighbour Methods in Entropy Estimation, Independence Testing and Classification.

Degree: PhD, 2017, University of Cambridge

URL: https://www.repository.cam.ac.uk/handle/1810/267832

► Nearest neighbour methods are a classical approach in nonparametric statistics. The k-nearest neighbour classifier can be traced back to the seminal work of Fix and… (more)

▼ Nearest neighbour methods are a classical approach in nonparametric statistics. The k-nearest neighbour classifier can be traced back to the seminal work of Fix and Hodges (1951) and they also enjoy popularity in many other problems including density estimation and regression. In this thesis we study their use in three different situations, providing new theoretical results on the performance of commonly-used nearest neighbour methods and proposing new procedures that are shown to outperform these existing methods in certain settings. The first problem we discuss is that of entropy estimation. Many statistical procedures, including goodness-of-fit tests and methods for independent component analysis, rely critically on the estimation of the entropy of a distribution. In this chapter, we seek entropy estimators that are efficient and achieve the local asymptotic minimax lower bound with respect to squared error loss. To this end, we study weighted averages of the estimators originally proposed by Kozachenko and Leonenko (1987), based on the k-nearest neighbour distances of a sample. A careful choice of weights enables us to obtain an efficient estimator in arbitrary dimensions, given sufficient smoothness, while the original unweighted estimator is typically only efficient in up to three dimensions. A related topic of study is the estimation of the mutual information between two random vectors, and its application to testing for independence. We propose tests for the two different situations of the marginal distributions being known or unknown and analyse their performance. Finally, we study the classical k-nearest neighbour classifier of Fix and Hodges (1951) and provide a new asymptotic expansion for its excess risk. We also show that, in certain situations, a new modification of the classifier that allows k to vary with the location of the test point can provide improvements. This has applications to the field of semi-supervised learning, where, in addition to labelled training data, we also have access to a large sample of unlabelled data.

Subjects/Keywords: Nonparametric statistics; Nearest neighbour methods; Entropy Estimation; Independence Testing; Classification

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Berrett, T. B. (2017). Modern k-Nearest Neighbour Methods in Entropy Estimation, Independence Testing and Classification. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/267832

Chicago Manual of Style (16^th Edition):

Berrett, Thomas Benjamin. “Modern k-Nearest Neighbour Methods in Entropy Estimation, Independence Testing and Classification.” 2017. Doctoral Dissertation, University of Cambridge. Accessed March 09, 2021. https://www.repository.cam.ac.uk/handle/1810/267832.

MLA Handbook (7^th Edition):

Berrett, Thomas Benjamin. “Modern k-Nearest Neighbour Methods in Entropy Estimation, Independence Testing and Classification.” 2017. Web. 09 Mar 2021.

Vancouver:

Berrett TB. Modern k-Nearest Neighbour Methods in Entropy Estimation, Independence Testing and Classification. [Internet] [Doctoral dissertation]. University of Cambridge; 2017. [cited 2021 Mar 09]. Available from: https://www.repository.cam.ac.uk/handle/1810/267832.

Council of Science Editors:

Berrett TB. Modern k-Nearest Neighbour Methods in Entropy Estimation, Independence Testing and Classification. [Doctoral Dissertation]. University of Cambridge; 2017. Available from: https://www.repository.cam.ac.uk/handle/1810/267832

University of Manitoba

9. Ahmed, Kazi Wasif. Secure and efficient nearest neighbour search in high dimensional space.

Degree: Computer Science, 2017, University of Manitoba

URL: http://hdl.handle.net/1993/32788

► The attractive features of cloud platforms such as low cost, high availability and scalability are encouraging social networks, health and other service providers to outsource… (more)

Subjects/Keywords: Nearest Neighbour Search; Social Discovery; Anonymization; Intel SGX; Obfuscated Image Classification

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Ahmed, K. W. (2017). Secure and efficient nearest neighbour search in high dimensional space. (Masters Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/32788

Chicago Manual of Style (16^th Edition):

Ahmed, Kazi Wasif. “Secure and efficient nearest neighbour search in high dimensional space.” 2017. Masters Thesis, University of Manitoba. Accessed March 09, 2021. http://hdl.handle.net/1993/32788.

MLA Handbook (7^th Edition):

Ahmed, Kazi Wasif. “Secure and efficient nearest neighbour search in high dimensional space.” 2017. Web. 09 Mar 2021.

Vancouver:

Ahmed KW. Secure and efficient nearest neighbour search in high dimensional space. [Internet] [Masters thesis]. University of Manitoba; 2017. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/1993/32788.

Council of Science Editors:

Ahmed KW. Secure and efficient nearest neighbour search in high dimensional space. [Masters Thesis]. University of Manitoba; 2017. Available from: http://hdl.handle.net/1993/32788

Delft University of Technology

10. Dhanasekaran, D. (author). Improved Prediction of Runway Usage for Noise Forecast.

Degree: 2014, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:59f39b44-b292-4677-bed7-da6b9b310a46

► The research deals with improved prediction of runway usage for noise forecast. Since the accuracy of the noise forecast depends on the robustness of runway… (more)

▼ The research deals with improved prediction of runway usage for noise forecast. Since the accuracy of the noise forecast depends on the robustness of runway usage prediction, improved accuracy of runway usage prediction will result in improved accuracy of noise load prediction. The main motivation behind this research is that the current method for runway usage prediction does not account for certain factors such as anticipating changes in weather forecast, additional meteorological phenomena, operational disturbances, which influence the controllers in the runway configuration selection decision-making process. The main objectives of the research are to develop runway usage models with increased accuracy of runway usage prediction compared to the current models and to investigate the effect of the developed models on the results of the computations of the noise load around the airport. The novelty of this research comes from improving the accuracy of runway usage prediction and noise forecast and identification of the main factors that influence runway usage. Most of the recent research in this area focuses on runway usage prediction for tactical and strategic planning. There has been very few research carried out on runway usage prediction for noise forecast and this research aims to fill that knowledge gap. Based on literature study, it was identified that modeling with the use of historical data (empirical modeling) can be used to predict runway usage more accurately since it includes the controller’s decision-making patterns. Two prediction algorithms were chosen for the development of runway usage models: Nearest Neighbor and Neural Networks. Two approaches were chosen for runway usage prediction: determination of runway usage directly and determination of runway usage from runway combination prediction. The combination of the prediction algorithms along with approaches was used to develop four runway usage models. The main factors that influence runway usage were identified and used as predictors for the models. The developed models were verified by a comparison with the actual runway usage. Various predictors were analysed to see if it improves the runway usage prediction accuracy. The developed runway usage models were compared with each other in terms of noise forecast accuracy. Based on the effect of the developed runway usage models on the results of the noise load computations around the airport, the runway usage model that resulted in the highest noise forecast accuracy was identified to be the model developed using neural networks that determines runway usage from runway combination prediction. The main factors that influence runway usage were identified to be – wind direction, wind speed, visibility, period of the day, required capacity, type of operation (landing/take-off), and origin/destination. The developed runway usage models were validated for Schiphol airport and can be applied for other complex multi-runway airports like Schiphol airport. This will aid in noise load prediction around the… Advisors/Committee Members: Roling, P.C. (mentor).

Subjects/Keywords: runway usage prediction; noise forecast; neural networks; nearest neighbour

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Dhanasekaran, D. (. (2014). Improved Prediction of Runway Usage for Noise Forecast. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:59f39b44-b292-4677-bed7-da6b9b310a46

Chicago Manual of Style (16^th Edition):

Dhanasekaran, D (author). “Improved Prediction of Runway Usage for Noise Forecast.” 2014. Masters Thesis, Delft University of Technology. Accessed March 09, 2021. http://resolver.tudelft.nl/uuid:59f39b44-b292-4677-bed7-da6b9b310a46.

MLA Handbook (7^th Edition):

Dhanasekaran, D (author). “Improved Prediction of Runway Usage for Noise Forecast.” 2014. Web. 09 Mar 2021.

Vancouver:

Dhanasekaran D(. Improved Prediction of Runway Usage for Noise Forecast. [Internet] [Masters thesis]. Delft University of Technology; 2014. [cited 2021 Mar 09]. Available from: http://resolver.tudelft.nl/uuid:59f39b44-b292-4677-bed7-da6b9b310a46.

Council of Science Editors:

Dhanasekaran D(. Improved Prediction of Runway Usage for Noise Forecast. [Masters Thesis]. Delft University of Technology; 2014. Available from: http://resolver.tudelft.nl/uuid:59f39b44-b292-4677-bed7-da6b9b310a46

11. Berrett, Thomas Benjamin. Modern k-nearest neighbour methods in entropy estimation, independence testing and classification.

Degree: PhD, 2017, University of Cambridge

URL: https://doi.org/10.17863/CAM.13756 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.725564

► Nearest neighbour methods are a classical approach in nonparametric statistics. The k-nearest neighbour classifier can be traced back to the seminal work of Fix and… (more)

▼ Nearest neighbour methods are a classical approach in nonparametric statistics. The k-nearest neighbour classifier can be traced back to the seminal work of Fix and Hodges (1951) and they also enjoy popularity in many other problems including density estimation and regression. In this thesis we study their use in three different situations, providing new theoretical results on the performance of commonly-used nearest neighbour methods and proposing new procedures that are shown to outperform these existing methods in certain settings. The first problem we discuss is that of entropy estimation. Many statistical procedures, including goodness-of-fit tests and methods for independent component analysis, rely critically on the estimation of the entropy of a distribution. In this chapter, we seek entropy estimators that are efficient and achieve the local asymptotic minimax lower bound with respect to squared error loss. To this end, we study weighted averages of the estimators originally proposed by Kozachenko and Leonenko (1987), based on the k-nearest neighbour distances of a sample. A careful choice of weights enables us to obtain an efficient estimator in arbitrary dimensions, given sufficient smoothness, while the original unweighted estimator is typically only efficient in up to three dimensions. A related topic of study is the estimation of the mutual information between two random vectors, and its application to testing for independence. We propose tests for the two different situations of the marginal distributions being known or unknown and analyse their performance. Finally, we study the classical k-nearest neighbour classifier of Fix and Hodges (1951) and provide a new asymptotic expansion for its excess risk. We also show that, in certain situations, a new modification of the classifier that allows k to vary with the location of the test point can provide improvements. This has applications to the field of semi-supervised learning, where, in addition to labelled training data, we also have access to a large sample of unlabelled data.

Subjects/Keywords: 519.5; Nonparametric statistics; Nearest neighbour methods; Entropy Estimation; Independence Testing; Classification

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Berrett, T. B. (2017). Modern k-nearest neighbour methods in entropy estimation, independence testing and classification. (Doctoral Dissertation). University of Cambridge. Retrieved from https://doi.org/10.17863/CAM.13756 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.725564

Chicago Manual of Style (16^th Edition):

Berrett, Thomas Benjamin. “Modern k-nearest neighbour methods in entropy estimation, independence testing and classification.” 2017. Doctoral Dissertation, University of Cambridge. Accessed March 09, 2021. https://doi.org/10.17863/CAM.13756 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.725564.

MLA Handbook (7^th Edition):

Berrett, Thomas Benjamin. “Modern k-nearest neighbour methods in entropy estimation, independence testing and classification.” 2017. Web. 09 Mar 2021.

Vancouver:

Berrett TB. Modern k-nearest neighbour methods in entropy estimation, independence testing and classification. [Internet] [Doctoral dissertation]. University of Cambridge; 2017. [cited 2021 Mar 09]. Available from: https://doi.org/10.17863/CAM.13756 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.725564.

Council of Science Editors:

Berrett TB. Modern k-nearest neighbour methods in entropy estimation, independence testing and classification. [Doctoral Dissertation]. University of Cambridge; 2017. Available from: https://doi.org/10.17863/CAM.13756 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.725564

University of Guelph

12. Dar, Zainab. Performance of Analytical and Data Based Flux Approximations in Reactor Models.

Degree: MS, Department of Mathematics and Statistics, 2020, University of Guelph

URL: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/23675

► This paper examines the accuracy of algebraic and data-based approximations of substrate flux into a biofilm, computed from the solution of a boundary value problem… (more)

Subjects/Keywords: Biofilm Flux; CSTR; flux; approximations; multi layer perceptrons; biofilm; linear regression; nearest neighbour; nearest neighbor; pseuodanalytical; analytical approximation

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Dar, Z. (2020). Performance of Analytical and Data Based Flux Approximations in Reactor Models. (Masters Thesis). University of Guelph. Retrieved from https://atrium.lib.uoguelph.ca/xmlui/handle/10214/23675

Chicago Manual of Style (16^th Edition):

Dar, Zainab. “Performance of Analytical and Data Based Flux Approximations in Reactor Models.” 2020. Masters Thesis, University of Guelph. Accessed March 09, 2021. https://atrium.lib.uoguelph.ca/xmlui/handle/10214/23675.

MLA Handbook (7^th Edition):

Dar, Zainab. “Performance of Analytical and Data Based Flux Approximations in Reactor Models.” 2020. Web. 09 Mar 2021.

Vancouver:

Dar Z. Performance of Analytical and Data Based Flux Approximations in Reactor Models. [Internet] [Masters thesis]. University of Guelph; 2020. [cited 2021 Mar 09]. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/23675.

Council of Science Editors:

Dar Z. Performance of Analytical and Data Based Flux Approximations in Reactor Models. [Masters Thesis]. University of Guelph; 2020. Available from: https://atrium.lib.uoguelph.ca/xmlui/handle/10214/23675

University of Newcastle

13. Walker, Josiah. Improved similarity search for large data in machine learning and robotics.

Degree: PhD, 2017, University of Newcastle

URL: http://hdl.handle.net/1959.13/1333823

►

Research Doctorate - Doctor of Philosophy (PhD)

This thesis presents techniques for accelerating similarity search methods on large datasets. Similarity search has applications in clustering,… (more)

Subjects/Keywords: nearest neighbour search; cover trees; approximate search; locality sensitive hashing; boosting; learning to search; similarity and distance learning; big data; large scale learning; reverse nearest neighbour search

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Walker, J. (2017). Improved similarity search for large data in machine learning and robotics. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/1333823

Chicago Manual of Style (16^th Edition):

Walker, Josiah. “Improved similarity search for large data in machine learning and robotics.” 2017. Doctoral Dissertation, University of Newcastle. Accessed March 09, 2021. http://hdl.handle.net/1959.13/1333823.

MLA Handbook (7^th Edition):

Walker, Josiah. “Improved similarity search for large data in machine learning and robotics.” 2017. Web. 09 Mar 2021.

Vancouver:

Walker J. Improved similarity search for large data in machine learning and robotics. [Internet] [Doctoral dissertation]. University of Newcastle; 2017. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/1959.13/1333823.

Council of Science Editors:

Walker J. Improved similarity search for large data in machine learning and robotics. [Doctoral Dissertation]. University of Newcastle; 2017. Available from: http://hdl.handle.net/1959.13/1333823

University of Toronto

14. Adikari, Tharindu. Learning data representations for robust neighbour-based inference.

Degree: 2018, University of Toronto

URL: http://hdl.handle.net/1807/91651

►

The recently proposed Boundary Trees algorithm by Mathy et al. (2015) enables fast neighbour-based classification, regression and retrieval in large datasets. While boundary trees use… (more)

Subjects/Keywords: boundary tree; classification; data representations; differentiable boundary tree; MNIST; nearest neighbour; 0800

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Adikari, T. (2018). Learning data representations for robust neighbour-based inference. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/91651

Chicago Manual of Style (16^th Edition):

Adikari, Tharindu. “Learning data representations for robust neighbour-based inference.” 2018. Masters Thesis, University of Toronto. Accessed March 09, 2021. http://hdl.handle.net/1807/91651.

MLA Handbook (7^th Edition):

Adikari, Tharindu. “Learning data representations for robust neighbour-based inference.” 2018. Web. 09 Mar 2021.

Vancouver:

Adikari T. Learning data representations for robust neighbour-based inference. [Internet] [Masters thesis]. University of Toronto; 2018. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/1807/91651.

Council of Science Editors:

Adikari T. Learning data representations for robust neighbour-based inference. [Masters Thesis]. University of Toronto; 2018. Available from: http://hdl.handle.net/1807/91651

University of Western Ontario

15. King, Leanna M. Application of a K-Nearest Neighbour weather generator for simulation of historical and future climate variables in the Upper Thames River basin.

Degree: 2012, University of Western Ontario

URL: https://ir.lib.uwo.ca/etd/673

► Climate change has the potential to significantly alter the hydrologic cycle, changing the frequency and intensity of precipitation events in an area. It is necessary… (more)

Subjects/Keywords: Climate change; Weather generator; Hydrology; Stochastic; K-Nearest Neighbour; Downscaling; Environmental Engineering; Hydraulic Engineering

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

King, L. M. (2012). Application of a K-Nearest Neighbour weather generator for simulation of historical and future climate variables in the Upper Thames River basin. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/673

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

King, Leanna M. “Application of a K-Nearest Neighbour weather generator for simulation of historical and future climate variables in the Upper Thames River basin.” 2012. Thesis, University of Western Ontario. Accessed March 09, 2021. https://ir.lib.uwo.ca/etd/673.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

King, Leanna M. “Application of a K-Nearest Neighbour weather generator for simulation of historical and future climate variables in the Upper Thames River basin.” 2012. Web. 09 Mar 2021.

Vancouver:

King LM. Application of a K-Nearest Neighbour weather generator for simulation of historical and future climate variables in the Upper Thames River basin. [Internet] [Thesis]. University of Western Ontario; 2012. [cited 2021 Mar 09]. Available from: https://ir.lib.uwo.ca/etd/673.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

King LM. Application of a K-Nearest Neighbour weather generator for simulation of historical and future climate variables in the Upper Thames River basin. [Thesis]. University of Western Ontario; 2012. Available from: https://ir.lib.uwo.ca/etd/673

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

16. Bayliss, Kirsty L. Spatio-temporal modelling of earthquakes and earthquake clustering.

Degree: PhD, 2019, University of Edinburgh

URL: http://hdl.handle.net/1842/35736

► Individual earthquakes cannot be predicted reliably at present. However, earthquake occurrence is not totally random, being characterised by clustering of events in both time and… (more)

▼ Individual earthquakes cannot be predicted reliably at present. However, earthquake occurrence is not totally random, being characterised by clustering of events in both time and space. Understanding such clustering is vital for the development of more robust forecasting methodologies, for example during seismicity swarms, aftershock sequences, or for applications investigating induced seismicity. This thesis explores the spatio-temporal occurrence of earthquakes using Bayesian probabilistic approaches to characterise the evolution of seismicity and its clustering in time and space. Specifically, it examines spatio-temporal clustering of earthquakes, and explores a potential new approach to modelling the spatio-temporal evolution of seismicity which may be useful for future forecasting applications. The style of earthquake clustering can only be categorised in retrospect. A 'mainshock-aftershock' sequence has a large mainshock, followed by a decaying sequence of smaller events, and may include smaller 'foreshocks' before the largest event. In contrast, a 'swarm' is composed of smaller, similar magnitude events without an obvious mainshock. Diagnostic mapping of the style of clustering would allow parameters in seismic hazard models to reflect this, and by extrapolation forecast the likelihoods of future events. However, despite this widely recognised and studied clustering behaviour, there are currently no robust diagnostic methods for identifying cluster style in the analysis of such sequences. In this thesis, I develop a new probabilistic method for the identification of linked events for characterising cluster style, based on a nearest-neighbour algorithm that identifies the closest events in a multidimensional space-time-magnitude sense. Once events are linked to their most likely parent, aWeibull mixture model is fitted to the bimodal nearest-neighbour distance distribution using the Markov-Chain Monte-Carlo method. The resulting distributions establish the probability that a candidate event pair belongs to the clustered or background component of the mixture distribution. The chain of potentially causally-related events can then be expressed as a probability tree. A stochastic 'thinning' is applied to quantify uncertainty within the tree structure, allowing the formal construction of probabilistic earthquake cluster networks. This allows the consideration of the uncertainty that exists in links between events. There is significant uncertainty in resulting metrics when a probabilistic approach is used, due to the stochastic thinning of sequence links. This makes metrics like the average leaf depth extremely variable over many realisations, and the level of associated uncertainty in the metric is potentially more useful than the metric itself. The resulting network structure is also sensitive to key parameters such as magnitude cutoff, with changes in magnitude cutoff affecting the metrics and their uncertainty. The uncertainties within cluster sequences create inherent difficulties in categorising clustering.…

Subjects/Keywords: earthquake forecasting; short-term clustering; aftershocks; nearest neighbour distance; probability; spatial-statistical method; seismicity

10 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Bayliss, K. L. (2019). Spatio-temporal modelling of earthquakes and earthquake clustering. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/35736

Chicago Manual of Style (16^th Edition):

Bayliss, Kirsty L. “Spatio-temporal modelling of earthquakes and earthquake clustering.” 2019. Doctoral Dissertation, University of Edinburgh. Accessed March 09, 2021. http://hdl.handle.net/1842/35736.

MLA Handbook (7^th Edition):

Bayliss, Kirsty L. “Spatio-temporal modelling of earthquakes and earthquake clustering.” 2019. Web. 09 Mar 2021.

Vancouver:

Bayliss KL. Spatio-temporal modelling of earthquakes and earthquake clustering. [Internet] [Doctoral dissertation]. University of Edinburgh; 2019. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/1842/35736.

Council of Science Editors:

Bayliss KL. Spatio-temporal modelling of earthquakes and earthquake clustering. [Doctoral Dissertation]. University of Edinburgh; 2019. Available from: http://hdl.handle.net/1842/35736

17. Åkerblom, Thea. Fraud or Not?.

Degree: Statistics, 2019, Uppsala University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-388695

► This paper uses statistical learning to examine and compare three different statistical methods with the aim to predict credit card fraud. The methods compared… (more)

Subjects/Keywords: Logistic Regression; K-Nearest Neighbour; classification; random forest; fraud; transactions and statistical learning; Probability Theory and Statistics; Sannolikhetsteori och statistik

…x28;LR), K-Nearest Neighbour (K-NN) and Random Forest (RF). Figure… …W., 2013) 2.4 Classification Trees and Random Forests 2.4.1 Classifications Trees… …two-dimensional example. (Adopted from Hastie et al. 2013, page 308) 2.4.1 Random… …Forest Random Forest is, as the name indicates, an ensemble method consisting of several… …at lower levels of k. A random forest consists, as mentioned before, of multiple…

4 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Åkerblom, T. (2019). Fraud or Not?. (Thesis). Uppsala University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-388695

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Åkerblom, Thea. “Fraud or Not?.” 2019. Thesis, Uppsala University. Accessed March 09, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-388695.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Åkerblom, Thea. “Fraud or Not?.” 2019. Web. 09 Mar 2021.

Vancouver:

Åkerblom T. Fraud or Not?. [Internet] [Thesis]. Uppsala University; 2019. [cited 2021 Mar 09]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-388695.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Åkerblom T. Fraud or Not?. [Thesis]. Uppsala University; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-388695

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

18. Liu, Julia. Prediktion av efterfrågan i filmbranschen baserat på maskininlärning.

Degree: Electrical Engineering and Computer Science (EECS), 2018, KTH

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-235719

►

Machine learning is a central technology in data-driven decision making. In this study, machine learning in the context of demand forecasting in the motion picture… (more)

Subjects/Keywords: Box office forecasting; demand forecasting; regression; machine learning; random forest; k-nearest neighbour; Engineering and Technology; Teknik och teknologier

…lägsta värdet från modellen K-nearest neighbour med attributet svenska-Wikipedia sidvisningar… …vilket beror på ett flertal faktorer. För det första har K-nearest neighbour algorithen en… …modell. Linear Regression Random Forest Regression K-NN Regression Produktionsbudget 0,48… …och fem attribut) Multivariable linear Regression Random Forest Regression K-NN… …Multivariable linear Regression Random Forest Regression K-NN Regression 1 -0,11 0,05 0,04 2…

10 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Liu, J. (2018). Prediktion av efterfrågan i filmbranschen baserat på maskininlärning. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-235719

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Liu, Julia. “Prediktion av efterfrågan i filmbranschen baserat på maskininlärning.” 2018. Thesis, KTH. Accessed March 09, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-235719.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Liu, Julia. “Prediktion av efterfrågan i filmbranschen baserat på maskininlärning.” 2018. Web. 09 Mar 2021.

Vancouver:

Liu J. Prediktion av efterfrågan i filmbranschen baserat på maskininlärning. [Internet] [Thesis]. KTH; 2018. [cited 2021 Mar 09]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-235719.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liu J. Prediktion av efterfrågan i filmbranschen baserat på maskininlärning. [Thesis]. KTH; 2018. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-235719

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Brno University of Technology

19. Kučera, Ondřej. Nové metody nadvzorkování obrazu: New methods for super-resolution imaging.

Degree: 2019, Brno University of Technology

URL: http://hdl.handle.net/11012/9861

► This master's thesis deals with methods of increasing the image resolution. It contens as a description of theoretical principles and description of calculations which are… (more)

Subjects/Keywords: Zvyšování rozlišení; nejbližší soused; bilineární interpolace; bikubická interpolace; Markovova náhodná pole; Super resolution jednoho snímku; SSIM; PSNR; MSE; MATLAB; Super resolution; nearst neighbour; bilinear interpolation; bicubic interpolation; Markovs random fields; single image super resolution; SSIM; PSNR; MSE; MATLAB

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kučera, O. (2019). Nové metody nadvzorkování obrazu: New methods for super-resolution imaging. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/9861

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Kučera, Ondřej. “Nové metody nadvzorkování obrazu: New methods for super-resolution imaging.” 2019. Thesis, Brno University of Technology. Accessed March 09, 2021. http://hdl.handle.net/11012/9861.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Kučera, Ondřej. “Nové metody nadvzorkování obrazu: New methods for super-resolution imaging.” 2019. Web. 09 Mar 2021.

Vancouver:

Kučera O. Nové metody nadvzorkování obrazu: New methods for super-resolution imaging. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/11012/9861.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kučera O. Nové metody nadvzorkování obrazu: New methods for super-resolution imaging. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/9861

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Alberta

20. Petre, Cristian. Instance-Based Model for Predicting Total Fabrication Duration of Industrial Pipe Spools.

Degree: MS, Department of Civil and Environmental Engineering, 2016, University of Alberta

URL: https://era.library.ualberta.ca/files/cw95050712

► Industrial fabrication for modular installations has its own set of challenges that combine the environments of industrial manufacturing and off-site construction. This hybrid execution strategy… (more)

Subjects/Keywords: Pipe Spool Fabrication; Instance-Based Classification; Nearest Neighbour; Industrial Fabrication; Manufacturing; Process Modelling; Construction Simulation; Data Mining; Data Classification

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Petre, C. (2016). Instance-Based Model for Predicting Total Fabrication Duration of Industrial Pipe Spools. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/cw95050712

Chicago Manual of Style (16^th Edition):

Petre, Cristian. “Instance-Based Model for Predicting Total Fabrication Duration of Industrial Pipe Spools.” 2016. Masters Thesis, University of Alberta. Accessed March 09, 2021. https://era.library.ualberta.ca/files/cw95050712.

MLA Handbook (7^th Edition):

Petre, Cristian. “Instance-Based Model for Predicting Total Fabrication Duration of Industrial Pipe Spools.” 2016. Web. 09 Mar 2021.

Vancouver:

Petre C. Instance-Based Model for Predicting Total Fabrication Duration of Industrial Pipe Spools. [Internet] [Masters thesis]. University of Alberta; 2016. [cited 2021 Mar 09]. Available from: https://era.library.ualberta.ca/files/cw95050712.

Council of Science Editors:

Petre C. Instance-Based Model for Predicting Total Fabrication Duration of Industrial Pipe Spools. [Masters Thesis]. University of Alberta; 2016. Available from: https://era.library.ualberta.ca/files/cw95050712

University of Saskatchewan

21. Rawluk, Matthew B 1983-. Advancing Boreal Forest Archaeology: Intrasite Spatial Analysis of the Eaglenest Portage Site.

Degree: 2019, University of Saskatchewan

URL: http://hdl.handle.net/10388/11964

► This thesis presents the results of an intrasite spatial analysis study of an archaeological assemblage from the Eaglenest Portage site in the Birch Mountains of… (more)

▼ This thesis presents the results of an intrasite spatial analysis study of an archaeological assemblage from the Eaglenest Portage site in the Birch Mountains of northern Alberta. In this region, many sites consist of a seemingly random accumulation of stratigraphically mixed artifacts created through repeated occupations. Challenges arise for archaeologists who work in the region, due in part to physical and biological processes that move artifacts from where they were initially deposited, resulting in a general lack of stratified sites. These challenges make it difficult to understand both the vertical and horizontal spatial relationships between artifacts. Research in northern Alberta has primarily been conducted by consulting firms to make way for new industrial developments. Due to the perceived mixing of artifact assemblages, consulting archaeologists do not map all artifacts found in situ; instead, it is common to shovel-shave excavation units in arbitrary levels. Ives (1985) attempted to overcome the challenges of the boreal forest environment by collecting three-point provenience measurements (north, east, and depth below datum measurements) for each artifact collected from the Eaglenest Portage site and subsequently conducting a spatial study on the distribution of finished artifacts. The research presented in this thesis shows that carefully controlled excavations, with emphasis on three-point provenience measurements and spatial analysis (surface interpolation, nearest neighbour analysis, kernel density, k-means, and hot spot analysis) of an entire artifact assemblage, offer an objective method by which to identify temporally related clusters of artifacts and potential features that otherwise would be missed using the typical excavation practices in place today. A total of 25 clusters were identified in the four blocks that were excavated at the Eaglenest Portage site. The clusters allowed a range of discrete activities and potential features to be identified. This study and the study of Ives (1985) before it emphasize the importance of three-point provenience data in the interpretation of sites with limited stratigraphy. With this in mind, archaeologists and archaeological regulatory bodies should rethink what are deemed to be adequate excavation practices in the boreal forest. Advisors/Committee Members: Robertson, Elizabeth C, Stuart, Glenn S.L, Ives, John W, Foley , Chris, Blakley, Jill, Westman, Clint.

Subjects/Keywords: Boreal Forest; Spatial Analysis; Archaeology; Eaglenest Portage; GIS; Intrasite analysis; Kernel Density; K-means; Nearest Neighbour; Optimal Hot Spot

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Rawluk, M. B. 1. (2019). Advancing Boreal Forest Archaeology: Intrasite Spatial Analysis of the Eaglenest Portage Site. (Thesis). University of Saskatchewan. Retrieved from http://hdl.handle.net/10388/11964

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Rawluk, Matthew B 1983-. “Advancing Boreal Forest Archaeology: Intrasite Spatial Analysis of the Eaglenest Portage Site.” 2019. Thesis, University of Saskatchewan. Accessed March 09, 2021. http://hdl.handle.net/10388/11964.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Rawluk, Matthew B 1983-. “Advancing Boreal Forest Archaeology: Intrasite Spatial Analysis of the Eaglenest Portage Site.” 2019. Web. 09 Mar 2021.

Vancouver:

Rawluk MB1. Advancing Boreal Forest Archaeology: Intrasite Spatial Analysis of the Eaglenest Portage Site. [Internet] [Thesis]. University of Saskatchewan; 2019. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10388/11964.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rawluk MB1. Advancing Boreal Forest Archaeology: Intrasite Spatial Analysis of the Eaglenest Portage Site. [Thesis]. University of Saskatchewan; 2019. Available from: http://hdl.handle.net/10388/11964

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Otago

22. Auge, Amelie A. Terrestrial spatial ecology of female New Zealand sea lions: Study at Sandy Bay, Auckland Islands, and implication for the management of the recolonisation .

Degree: 2013, University of Otago

URL: http://hdl.handle.net/10523/4371

► The New Zealand sea lion, Phocarctos hookeri, is endemic to New Zealand and has only three breeding colonies, all situated in the sub-Antarctic islands. This… (more)

▼ The New Zealand sea lion, Phocarctos hookeri, is endemic to New Zealand and has only three breeding colonies, all situated in the sub-Antarctic islands. This reduced breeding distribution is the result of human extirpation from most of its pristine range, which included the New Zealand mainland. In 1993, a female bred for the first time on mainland New Zealand, indicating the possible start of the recolonisation. The recolonisation of an urbanised coastline will create interactions between humans, infrastructures and sea lions. No study had however looked at how the New Zealand sea lion uses its terrestrial environment. This study thus aimed to characterise, in space and time, the terrestrial spatial ecology of the female New Zealand sea lions at a breeding colony. Intensive fieldwork at the Sandy Bay breeding colony, Enderby Island, in the Auckland Islands, during two breeding seasons (between December 2001 and March 2003), produced a large dataset of daily Global Positioning System (GPS) locations of branded females onshore (4252 locations) within the study area (0.7 km²). A habitat type map and a Digital Terrain Model (DTM) of the study area were produced. The analyses were conducted in ArcGIS at three scales: individual, population and habitat. A two-phase pattern, including a harem phase (aggregation of females, area used < 0.003 km²) and a dispersion phase (spread of females, area used > 0.550 km²), was revealed and characterised using Nearest Neighbour Indices. A dispersion model of an average female was produced based on cumulative Minimum Convex Polygons (MCP) and pup mortality was found to be affected by females’ movements on pupping day. The female population was found to move and shift areas used throughout the dispersion phase while the gregariousness of females was considerably modified between the harem phase and the end of the dispersion phase (80 versus 0.3 females per 100 m²). Temporal analyses of habitat use demonstrated a radical change in habitat preferences between the two phases and a gradual change during the dispersion phase. At the end of the season, females preferred sites in forest and at more than 1.1 km from shore. Male aggressiveness and disturbance, habitat properties and parasite infections are thought to be some of the main factors that drive the terrestrial ecology of the females P. hookeri. In conclusion, the presence and spatial extent of a female population at Sandy Bay, unusual for a pinniped species, was found to be predictable and thought to be species- specific rather than location-specific. The results of this study can thus be used as a basis for the management of the recolonisation. Human infrastructure and disturbance are likely to interfere with the establishment of new breeding colonies and the ecology of female New Zealand sea lions on mainland New Zealand. Some recommendations based on these results are immediate public awareness and education programs, the monitoring of the new population using a GIS database and the identification, protection against human… Advisors/Committee Members: Mathieu, Renaud (advisor).

Subjects/Keywords: wildlife management; Phocarctos hookeri; GIS; spatial ecology; nearest neighbour; movement; behaviour; spatial analysis; Auckland Islands; recolonisation; pinnipeds

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Auge, A. A. (2013). Terrestrial spatial ecology of female New Zealand sea lions: Study at Sandy Bay, Auckland Islands, and implication for the management of the recolonisation . (Masters Thesis). University of Otago. Retrieved from http://hdl.handle.net/10523/4371

Chicago Manual of Style (16^th Edition):

Auge, Amelie A. “Terrestrial spatial ecology of female New Zealand sea lions: Study at Sandy Bay, Auckland Islands, and implication for the management of the recolonisation .” 2013. Masters Thesis, University of Otago. Accessed March 09, 2021. http://hdl.handle.net/10523/4371.

MLA Handbook (7^th Edition):

Auge, Amelie A. “Terrestrial spatial ecology of female New Zealand sea lions: Study at Sandy Bay, Auckland Islands, and implication for the management of the recolonisation .” 2013. Web. 09 Mar 2021.

Vancouver:

Auge AA. Terrestrial spatial ecology of female New Zealand sea lions: Study at Sandy Bay, Auckland Islands, and implication for the management of the recolonisation . [Internet] [Masters thesis]. University of Otago; 2013. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10523/4371.

Council of Science Editors:

Auge AA. Terrestrial spatial ecology of female New Zealand sea lions: Study at Sandy Bay, Auckland Islands, and implication for the management of the recolonisation . [Masters Thesis]. University of Otago; 2013. Available from: http://hdl.handle.net/10523/4371

AUT University

23. Liang, Wen. Integrated feature, neighbourhood, and model optimization for personalised modelling and knowledge discovery .

Degree: 2009, AUT University

URL: http://hdl.handle.net/10292/749

► “Machine learning is the process of discovering and interpreting meaningful information, such as new correlations, patterns and trends by sifting through large amounts of data… (more)

▼ “Machine learning is the process of discovering and interpreting meaningful information, such as new correlations, patterns and trends by sifting through large amounts of data stored in repositories, using pattern recognition technologies as well as statistical and mathematical techniques” (Larose, 2005). From my understanding, machine learning is a process of using different analysis techniques to observe previously unknown, potentially meaningful information, and discover strong patterns and relationships from a large dataset. Professor Kasabov (2007b) classified computational models into three categories (e.g. global, local, and personalised) which have been widespread and used in the areas of data analysis and decision support in general, and in the areas of medicine and bioinformatics in particular. Most recently, the concept of personalised modelling has been widely applied to various disciplines such as personalised medicine, personalised drug design for known diseases (e.g. cancer, diabetes, brain disease, etc.) as well as for other modelling problems in ecology, business, finance, crime prevention, and so on. The philosophy behind the personalised modelling approach is that every person is different from others, thus he/she will benefit from having a personalised model and treatment. However, personalised modelling is not without issues, such as defining the correct number of neighbours or defining an appropriate number of features. As a result, the principal goal of this research is to study and address these issues and to create a novel framework and system for personalised modelling. The framework would allow users to select and optimise the most important features and nearest neighbours for a new input sample in relation to a certain problem based on a weighted variable distance measure in order to obtain more precise prognostic accuracy and personalised knowledge, when compared with global modelling and local modelling approaches. Advisors/Committee Members: Kasabov, Nikola (advisor).

Subjects/Keywords: Optimisation; Personalised modelling; Feature selection; Nearest neighbour; Model optimization

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Liang, W. (2009). Integrated feature, neighbourhood, and model optimization for personalised modelling and knowledge discovery . (Thesis). AUT University. Retrieved from http://hdl.handle.net/10292/749

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Liang, Wen. “Integrated feature, neighbourhood, and model optimization for personalised modelling and knowledge discovery .” 2009. Thesis, AUT University. Accessed March 09, 2021. http://hdl.handle.net/10292/749.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Liang, Wen. “Integrated feature, neighbourhood, and model optimization for personalised modelling and knowledge discovery .” 2009. Web. 09 Mar 2021.

Vancouver:

Liang W. Integrated feature, neighbourhood, and model optimization for personalised modelling and knowledge discovery . [Internet] [Thesis]. AUT University; 2009. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10292/749.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liang W. Integrated feature, neighbourhood, and model optimization for personalised modelling and knowledge discovery . [Thesis]. AUT University; 2009. Available from: http://hdl.handle.net/10292/749

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

York University

24. Hu, Haohao. A Hybrid Approach for Large-Scale Product Categorization Based on Weighted KNN and LSTM-BPV.

Degree: MA -MA, Information Systems and Technology, 2019, York University

URL: https://yorkspace.library.yorku.ca/xmlui/handle/10315/36836

► In modern e-commerce systems, large volumes of new items are being added to the product list everyday, which calls for automatic product categorization. In this… (more)

Subjects/Keywords: Artificial intelligence; E-commerce Product Taxonomy Classification; Information Retrieval; K-Nearest Neighbour; Ensemble; Text Classification; Data Mining

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hu, H. (2019). A Hybrid Approach for Large-Scale Product Categorization Based on Weighted KNN and LSTM-BPV. (Masters Thesis). York University. Retrieved from https://yorkspace.library.yorku.ca/xmlui/handle/10315/36836

Chicago Manual of Style (16^th Edition):

Hu, Haohao. “A Hybrid Approach for Large-Scale Product Categorization Based on Weighted KNN and LSTM-BPV.” 2019. Masters Thesis, York University. Accessed March 09, 2021. https://yorkspace.library.yorku.ca/xmlui/handle/10315/36836.

MLA Handbook (7^th Edition):

Hu, Haohao. “A Hybrid Approach for Large-Scale Product Categorization Based on Weighted KNN and LSTM-BPV.” 2019. Web. 09 Mar 2021.

Vancouver:

Hu H. A Hybrid Approach for Large-Scale Product Categorization Based on Weighted KNN and LSTM-BPV. [Internet] [Masters thesis]. York University; 2019. [cited 2021 Mar 09]. Available from: https://yorkspace.library.yorku.ca/xmlui/handle/10315/36836.

Council of Science Editors:

Hu H. A Hybrid Approach for Large-Scale Product Categorization Based on Weighted KNN and LSTM-BPV. [Masters Thesis]. York University; 2019. Available from: https://yorkspace.library.yorku.ca/xmlui/handle/10315/36836

Mid Sweden University

25. Zand, Sajjad Zandi. FPGA implementation of ROI extraction for visual-IR smart cameras.

Degree: Electronics Design, 2015, Mid Sweden University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-26076

► Video surveillance systems have been popular as a security tool for years, and the technological development helps monitoring accident-prone areas with the help of… (more)

Subjects/Keywords: FPGA; Image Processing; Nearest Neighbour; Upscale; YCbCr; Other Electrical Engineering, Electronic Engineering, Information Engineering; Annan elektroteknik och elektronik

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zand, S. Z. (2015). FPGA implementation of ROI extraction for visual-IR smart cameras. (Thesis). Mid Sweden University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-26076

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Zand, Sajjad Zandi. “FPGA implementation of ROI extraction for visual-IR smart cameras.” 2015. Thesis, Mid Sweden University. Accessed March 09, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-26076.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Zand, Sajjad Zandi. “FPGA implementation of ROI extraction for visual-IR smart cameras.” 2015. Web. 09 Mar 2021.

Vancouver:

Zand SZ. FPGA implementation of ROI extraction for visual-IR smart cameras. [Internet] [Thesis]. Mid Sweden University; 2015. [cited 2021 Mar 09]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-26076.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zand SZ. FPGA implementation of ROI extraction for visual-IR smart cameras. [Thesis]. Mid Sweden University; 2015. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-26076

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

KTH

26. Gustavsson, Oscar. Inomhuspositionering med bredbandig radio.

Degree: Electrical Engineering and Computer Science (EECS), 2019, KTH

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254253

►

In this report it is evaluated whether a higher dimensional fingerprint vector increases accuracy of an algorithm for indoor localisation. Many solutions use a… (more)

▼

In this report it is evaluated whether a higher dimensional fingerprint vector increases accuracy of an algorithm for indoor localisation. Many solutions use a Received Signal Strength Indicator (RSSI) to estimate a position. It was studied if the use of the Channel State Information (CSI), i.e. the channel’s frequency response, is beneficial for the accuracy.The localisation algorithm estimates the position of a new measurement by comparing it to previous measurements using k-Nearest Neighbour (k-NN) regression. The mean power was used as RSSI and 100 samples of the frequency response as CSI. Reduction of the dimension of the CSI vector with statistical moments and Principal Component Analysis (PCA) was tested. An improvement in accuracy could not be observed by using a higher dimensional fingerprint vector than RSSI. A standardised Euclidean or Mahalanobis distance measure in the k-NN algorithm seemed to perform better than Euclidean distance. Taking the logarithm of the frequency response samples before doing any calculation also seemed to improve accuracy.

I denna rapport utvärderas huruvida data av högre dimension ökar noggrannheten hos en algoritm för inomhuspositionering. Många lösningar använder en indikator för mottagen signalstyrka (RSSI) för att skatta en position. Det studerades studerade om användningen av kanalens fysikaliska tillstånd (CSI), det vill säga kanalens frekvenssvar, är fördelaktig för noggrannheten.Positioneringsalgoritmen skattar positionen för en ny mätning genom att jämföra den med tidigare mätningar med k-Nearest Neighbour (k-NN)-regression. Medeleffekten användes som RSSI och 100 sampel av frekvenssvaret som CSI. Reducering av CSI vektornsdimension med statistiska moment och Principalkomponentanalys(PCA) testades. En förbättring av noggrannheten kunde inte observeras genom att använda data med högre dimension än RSSI. Ett standardiserat Euklidiskt eller Mahalanobis avståndsåatt i k-NN-algoritmen verkade prestera bättre än Euklidiskt avstånd. Att ta logaritmen av frekvenssvarets sampel innan andra beräkningar gjordes verkade också förbättra noggrannheten.

Subjects/Keywords: Indoor Localisation; WiFi-fingerprinting; k-Nearest Neighbour; RSSI; CSI; Electrical Engineering, Electronic Engineering, Information Engineering; Elektroteknik och elektronik

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Gustavsson, O. (2019). Inomhuspositionering med bredbandig radio. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254253

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Gustavsson, Oscar. “Inomhuspositionering med bredbandig radio.” 2019. Thesis, KTH. Accessed March 09, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254253.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Gustavsson, Oscar. “Inomhuspositionering med bredbandig radio.” 2019. Web. 09 Mar 2021.

Vancouver:

Gustavsson O. Inomhuspositionering med bredbandig radio. [Internet] [Thesis]. KTH; 2019. [cited 2021 Mar 09]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254253.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gustavsson O. Inomhuspositionering med bredbandig radio. [Thesis]. KTH; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254253

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Lethbridge

27. University of Lethbridge. Faculty of Arts and Science. Spatial patterns within gelada monkey one male units at Guassa, Ethiopia .

Degree: 2016, University of Lethbridge

URL: http://hdl.handle.net/10133/4485

► I used repeated, accurate positional data, collected between October 2013 and January 2014, on all adult members of nine gelada monkey One-Male Units (OMUs) living… (more)

Subjects/Keywords: inter-individual distances; nearest neighbour distances; spatial associations; axis of travel; spatial patterns; modular social organization; socio-spatal coordination; group structure

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Science, U. o. L. F. o. A. a. (2016). Spatial patterns within gelada monkey one male units at Guassa, Ethiopia . (Thesis). University of Lethbridge. Retrieved from http://hdl.handle.net/10133/4485

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Science, University of Lethbridge. Faculty of Arts and. “Spatial patterns within gelada monkey one male units at Guassa, Ethiopia .” 2016. Thesis, University of Lethbridge. Accessed March 09, 2021. http://hdl.handle.net/10133/4485.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Science, University of Lethbridge. Faculty of Arts and. “Spatial patterns within gelada monkey one male units at Guassa, Ethiopia .” 2016. Web. 09 Mar 2021.

Vancouver:

Science UoLFoAa. Spatial patterns within gelada monkey one male units at Guassa, Ethiopia . [Internet] [Thesis]. University of Lethbridge; 2016. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10133/4485.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Science UoLFoAa. Spatial patterns within gelada monkey one male units at Guassa, Ethiopia . [Thesis]. University of Lethbridge; 2016. Available from: http://hdl.handle.net/10133/4485

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Lehigh University

28. Savtchenko, Constantin. Pedestrian Tracking With A Low-Cost 3D LIDAR System On A Mobile Platform.

Degree: MS, Computer Science, 2011, Lehigh University

URL: https://preserve.lehigh.edu/etd/1281

Subjects/Keywords: LIDAR; nearest neighbour; pedestrian; tracking; Computer Sciences

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Savtchenko, C. (2011). Pedestrian Tracking With A Low-Cost 3D LIDAR System On A Mobile Platform. (Thesis). Lehigh University. Retrieved from https://preserve.lehigh.edu/etd/1281

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Savtchenko, Constantin. “Pedestrian Tracking With A Low-Cost 3D LIDAR System On A Mobile Platform.” 2011. Thesis, Lehigh University. Accessed March 09, 2021. https://preserve.lehigh.edu/etd/1281.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Savtchenko, Constantin. “Pedestrian Tracking With A Low-Cost 3D LIDAR System On A Mobile Platform.” 2011. Web. 09 Mar 2021.

Vancouver:

Savtchenko C. Pedestrian Tracking With A Low-Cost 3D LIDAR System On A Mobile Platform. [Internet] [Thesis]. Lehigh University; 2011. [cited 2021 Mar 09]. Available from: https://preserve.lehigh.edu/etd/1281.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Savtchenko C. Pedestrian Tracking With A Low-Cost 3D LIDAR System On A Mobile Platform. [Thesis]. Lehigh University; 2011. Available from: https://preserve.lehigh.edu/etd/1281

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

York University

29. Hu, Haohao. A Hybrid Approach for Large-Scale Product Categorization Based on Weighted KNN and LSTM-BPV.

Degree: MA -MA, Information Systems and Technology, 2019, York University

URL: http://hdl.handle.net/10315/36836

► In modern e-commerce systems, large volumes of new items are being added to the product list everyday, which calls for automatic product categorization. In this… (more)

Subjects/Keywords: Artificial intelligence; E-commerce Product Taxonomy Classification; Information Retrieval; K-Nearest Neighbour; Ensemble; Text Classification; Data Mining

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hu, H. (2019). A Hybrid Approach for Large-Scale Product Categorization Based on Weighted KNN and LSTM-BPV. (Masters Thesis). York University. Retrieved from http://hdl.handle.net/10315/36836

Chicago Manual of Style (16^th Edition):

Hu, Haohao. “A Hybrid Approach for Large-Scale Product Categorization Based on Weighted KNN and LSTM-BPV.” 2019. Masters Thesis, York University. Accessed March 09, 2021. http://hdl.handle.net/10315/36836.

MLA Handbook (7^th Edition):

Hu, Haohao. “A Hybrid Approach for Large-Scale Product Categorization Based on Weighted KNN and LSTM-BPV.” 2019. Web. 09 Mar 2021.

Vancouver:

Hu H. A Hybrid Approach for Large-Scale Product Categorization Based on Weighted KNN and LSTM-BPV. [Internet] [Masters thesis]. York University; 2019. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10315/36836.

Council of Science Editors:

Hu H. A Hybrid Approach for Large-Scale Product Categorization Based on Weighted KNN and LSTM-BPV. [Masters Thesis]. York University; 2019. Available from: http://hdl.handle.net/10315/36836

30. Shafiee, Mohammad Javad. Randomly-connected Non-Local Conditional Random Fields.

Degree: 2017, University of Waterloo

URL: http://hdl.handle.net/10012/11319

► Structural data modeling is an important field of research. Structural data are the combination of latent variables being related to each other. The incorporation of… (more)

▼ Structural data modeling is an important field of research. Structural data are the combination of latent variables being related to each other. The incorporation of these relations in modeling and taking advantage of those to have a robust estimation is an open field of research. There are several approaches that involve these relations such as Markov chain models or random field frameworks. Random fields specify the relations among random variables in the context of probability distributions. Markov random fields are generative models used to represent the prior distribution among random variables. On the other hand, conditional random fields (CRFs) are known as discriminative models computing the posterior probability of random variables given observations directly. CRFs are one of the most powerful frameworks in image modeling. However practical CRFs typically have edges only between nearby nodes. Utilizing more interactions and expressive relations among nodes make these methods impractical for large-scale applications, due to the high computational complexity. Nevertheless, studies have demonstrated that obtaining long-range interactions in the modeling improves the modeling accuracy and addresses the short-boundary bias problem to some extent. Recent work has shown that fully connected CRFs can be tractable by defining specific potential functions. Although the proposed frameworks present algorithms to efficiently manage the fully connected interactions/relatively dense random fields, there exists the unanswered question that fully connected interactions are usually useful in modeling. To the best of our knowledge, no research has been conducted to answer this question and the focus of research was to introduce a tractable approach to utilize all connectivity interactions. This research aims to analyze this question and attempts to provide an answer. It demonstrates that how long-range of connections might be useful. Motivated by the answer of this question, a novel framework to tackle the computational complexity of a fully connected random fields without requiring specific potential functions is proposed. Inspired by random graph theory and sampling methods, this thesis introduces a new clique structure called stochastic cliques. The stochastic cliques specify the range of effective connections dynamically which converts a conditional random field (CRF) to a randomly-connected CRF. The randomly-connected CRF (RCRF) is a marriage between random graphs and random fields, benefiting from the advantages of fully connected graphs while maintaining computational tractability. To address the limitations of RCRF, the proposed stochastic clique structure is utilized in a deep structural approach (deep structure randomly-connected conditional random field (DRCRF)) where various range of connectivities are obtained in a hierarchical framework to maintain the computational complexity while utilizing long-range interactions. In this thesis the concept of randomly-connected non-local conditional…

Subjects/Keywords: Conditional Random Fields; Image Segmentation; Random Fields; Fully Connected Random Fields; Interactive Image Segmentation

10 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Shafiee, M. J. (2017). Randomly-connected Non-Local Conditional Random Fields. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/11319

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Shafiee, Mohammad Javad. “Randomly-connected Non-Local Conditional Random Fields.” 2017. Thesis, University of Waterloo. Accessed March 09, 2021. http://hdl.handle.net/10012/11319.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Shafiee, Mohammad Javad. “Randomly-connected Non-Local Conditional Random Fields.” 2017. Web. 09 Mar 2021.

Vancouver:

Shafiee MJ. Randomly-connected Non-Local Conditional Random Fields. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2021 Mar 09]. Available from: http://hdl.handle.net/10012/11319.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Shafiee MJ. Randomly-connected Non-Local Conditional Random Fields. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/11319

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations