Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(nearest neighbor algorithms). Showing records 1 – 23 of 23 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Illinois – Urbana-Champaign

1. Kumar, Nirman. In search of better proximity.

Degree: PhD, 0112, 2014, University of Illinois – Urbana-Champaign

 Given a set of points in a metric space, a fundamental problem is to preprocess these points for answering nearest-neighbor queries on them. Proximity search… (more)

Subjects/Keywords: Computational Geometry; Algorithms; Data-Structures; Nearest-Neighbor Search; Approximation algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kumar, N. (2014). In search of better proximity. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/50535

Chicago Manual of Style (16th Edition):

Kumar, Nirman. “In search of better proximity.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed January 16, 2021. http://hdl.handle.net/2142/50535.

MLA Handbook (7th Edition):

Kumar, Nirman. “In search of better proximity.” 2014. Web. 16 Jan 2021.

Vancouver:

Kumar N. In search of better proximity. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/2142/50535.

Council of Science Editors:

Kumar N. In search of better proximity. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/50535

2. Åleskog, Christoffer. Comparing node-sorting algorithms for multi-goal pathfinding with obstacles.

Degree: 2019, , Department of Computer Science

  Background. Pathfinding plays a big role in both digital games and robotics, and is used in many different ways. One of them is multi-goal… (more)

Subjects/Keywords: multi-goals; pathfinding; nearest neighbor algorithms; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Åleskog, C. (2019). Comparing node-sorting algorithms for multi-goal pathfinding with obstacles. (Thesis). , Department of Computer Science. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:bth-18256

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

Chicago Manual of Style (16th Edition):

Åleskog, Christoffer. “Comparing node-sorting algorithms for multi-goal pathfinding with obstacles.” 2019. Thesis, , Department of Computer Science. Accessed January 16, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-18256.

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

MLA Handbook (7th Edition):

Åleskog, Christoffer. “Comparing node-sorting algorithms for multi-goal pathfinding with obstacles.” 2019. Web. 16 Jan 2021.

Vancouver:

Åleskog C. Comparing node-sorting algorithms for multi-goal pathfinding with obstacles. [Internet] [Thesis]. , Department of Computer Science; 2019. [cited 2021 Jan 16]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-18256.

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

Council of Science Editors:

Åleskog C. Comparing node-sorting algorithms for multi-goal pathfinding with obstacles. [Thesis]. , Department of Computer Science; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-18256

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


Universidade Nova

3. Mestre, Ricardo Jorge Palheira. Improvements on the KNN classifier.

Degree: 2013, Universidade Nova

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

The object classification is an important area within the artificial intelligence and its application extends… (more)

Subjects/Keywords: Artificial intelligence; Classification algorithms; KNN; K-nearest neighbor algorithm; Lazy-learning; Eager-learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mestre, R. J. P. (2013). Improvements on the KNN classifier. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/10923

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

Chicago Manual of Style (16th Edition):

Mestre, Ricardo Jorge Palheira. “Improvements on the KNN classifier.” 2013. Thesis, Universidade Nova. Accessed January 16, 2021. http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/10923.

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

MLA Handbook (7th Edition):

Mestre, Ricardo Jorge Palheira. “Improvements on the KNN classifier.” 2013. Web. 16 Jan 2021.

Vancouver:

Mestre RJP. Improvements on the KNN classifier. [Internet] [Thesis]. Universidade Nova; 2013. [cited 2021 Jan 16]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/10923.

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

Council of Science Editors:

Mestre RJP. Improvements on the KNN classifier. [Thesis]. Universidade Nova; 2013. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/10923

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


Hong Kong University of Science and Technology

4. Wong, Ka-Hang. A skip list approach for answering approximate nearest neighbor queries.

Degree: 2002, Hong Kong University of Science and Technology

 We present a new algorithm for answering approximate nearest neighbor queries that is inspired by skip lists. Our data structure uses linear space and can… (more)

Subjects/Keywords: Nearest neighbor analysis (Statistics) ; Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wong, K. (2002). A skip list approach for answering approximate nearest neighbor queries. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-5744 ; https://doi.org/10.14711/thesis-b728573 ; http://repository.ust.hk/ir/bitstream/1783.1-5744/1/th_redirect.html

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

Chicago Manual of Style (16th Edition):

Wong, Ka-Hang. “A skip list approach for answering approximate nearest neighbor queries.” 2002. Thesis, Hong Kong University of Science and Technology. Accessed January 16, 2021. http://repository.ust.hk/ir/Record/1783.1-5744 ; https://doi.org/10.14711/thesis-b728573 ; http://repository.ust.hk/ir/bitstream/1783.1-5744/1/th_redirect.html.

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

MLA Handbook (7th Edition):

Wong, Ka-Hang. “A skip list approach for answering approximate nearest neighbor queries.” 2002. Web. 16 Jan 2021.

Vancouver:

Wong K. A skip list approach for answering approximate nearest neighbor queries. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2002. [cited 2021 Jan 16]. Available from: http://repository.ust.hk/ir/Record/1783.1-5744 ; https://doi.org/10.14711/thesis-b728573 ; http://repository.ust.hk/ir/bitstream/1783.1-5744/1/th_redirect.html.

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

Council of Science Editors:

Wong K. A skip list approach for answering approximate nearest neighbor queries. [Thesis]. Hong Kong University of Science and Technology; 2002. Available from: http://repository.ust.hk/ir/Record/1783.1-5744 ; https://doi.org/10.14711/thesis-b728573 ; http://repository.ust.hk/ir/bitstream/1783.1-5744/1/th_redirect.html

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


University of Cincinnati

5. Agarwal, Akrita. Exploring the Noise Resilience of Combined Sturges Algorithm.

Degree: MS, Engineering and Applied Science: Computer Science, 2015, University of Cincinnati

 Over the years, various Classification algorithms have been developed.Two of the most popular Classification algorithms are - Naive Bayes and κnn. They are both unique… (more)

Subjects/Keywords: Computer Science; Noise Resilience; Machine Learning Algorithms; Combined Sturges; Naive Bayes; k nearest neighbor

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Agarwal, A. (2015). Exploring the Noise Resilience of Combined Sturges Algorithm. (Masters Thesis). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1447070335

Chicago Manual of Style (16th Edition):

Agarwal, Akrita. “Exploring the Noise Resilience of Combined Sturges Algorithm.” 2015. Masters Thesis, University of Cincinnati. Accessed January 16, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1447070335.

MLA Handbook (7th Edition):

Agarwal, Akrita. “Exploring the Noise Resilience of Combined Sturges Algorithm.” 2015. Web. 16 Jan 2021.

Vancouver:

Agarwal A. Exploring the Noise Resilience of Combined Sturges Algorithm. [Internet] [Masters thesis]. University of Cincinnati; 2015. [cited 2021 Jan 16]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1447070335.

Council of Science Editors:

Agarwal A. Exploring the Noise Resilience of Combined Sturges Algorithm. [Masters Thesis]. University of Cincinnati; 2015. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1447070335


Hong Kong University of Science and Technology

6. Fu, Addy Ho-Yam. Expected-case analysis of approximate nearest neighbor algorithms.

Degree: 1999, Hong Kong University of Science and Technology

 Most research in algorithms for geometric query problems has focused on their worst-case performance. But when information on the query distribution is available, the alternative… (more)

Subjects/Keywords: Geometry  – Data processing ; Computer algorithms ; Nearest neighbor analysis (Statistics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fu, A. H. (1999). Expected-case analysis of approximate nearest neighbor algorithms. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-5675 ; https://doi.org/10.14711/thesis-b643189 ; http://repository.ust.hk/ir/bitstream/1783.1-5675/1/th_redirect.html

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

Chicago Manual of Style (16th Edition):

Fu, Addy Ho-Yam. “Expected-case analysis of approximate nearest neighbor algorithms.” 1999. Thesis, Hong Kong University of Science and Technology. Accessed January 16, 2021. http://repository.ust.hk/ir/Record/1783.1-5675 ; https://doi.org/10.14711/thesis-b643189 ; http://repository.ust.hk/ir/bitstream/1783.1-5675/1/th_redirect.html.

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

MLA Handbook (7th Edition):

Fu, Addy Ho-Yam. “Expected-case analysis of approximate nearest neighbor algorithms.” 1999. Web. 16 Jan 2021.

Vancouver:

Fu AH. Expected-case analysis of approximate nearest neighbor algorithms. [Internet] [Thesis]. Hong Kong University of Science and Technology; 1999. [cited 2021 Jan 16]. Available from: http://repository.ust.hk/ir/Record/1783.1-5675 ; https://doi.org/10.14711/thesis-b643189 ; http://repository.ust.hk/ir/bitstream/1783.1-5675/1/th_redirect.html.

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

Council of Science Editors:

Fu AH. Expected-case analysis of approximate nearest neighbor algorithms. [Thesis]. Hong Kong University of Science and Technology; 1999. Available from: http://repository.ust.hk/ir/Record/1783.1-5675 ; https://doi.org/10.14711/thesis-b643189 ; http://repository.ust.hk/ir/bitstream/1783.1-5675/1/th_redirect.html

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


Hong Kong University of Science and Technology

7. Zhang, Jun. Nearest neighbor queries in spatial and spatio-temporal databases.

Degree: 2003, Hong Kong University of Science and Technology

Nearest neighbor (NN) search constitutes one of the most important forms of spatial / spatio-temporal information processing. Despite the large amount of related work during… (more)

Subjects/Keywords: Nearest neighbor analysis (Statistics) ; Spatial analysis (Statistics) ; Temporal databases ; Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, J. (2003). Nearest neighbor queries in spatial and spatio-temporal databases. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-1790 ; https://doi.org/10.14711/thesis-b810478 ; http://repository.ust.hk/ir/bitstream/1783.1-1790/1/th_redirect.html

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

Chicago Manual of Style (16th Edition):

Zhang, Jun. “Nearest neighbor queries in spatial and spatio-temporal databases.” 2003. Thesis, Hong Kong University of Science and Technology. Accessed January 16, 2021. http://repository.ust.hk/ir/Record/1783.1-1790 ; https://doi.org/10.14711/thesis-b810478 ; http://repository.ust.hk/ir/bitstream/1783.1-1790/1/th_redirect.html.

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

MLA Handbook (7th Edition):

Zhang, Jun. “Nearest neighbor queries in spatial and spatio-temporal databases.” 2003. Web. 16 Jan 2021.

Vancouver:

Zhang J. Nearest neighbor queries in spatial and spatio-temporal databases. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2003. [cited 2021 Jan 16]. Available from: http://repository.ust.hk/ir/Record/1783.1-1790 ; https://doi.org/10.14711/thesis-b810478 ; http://repository.ust.hk/ir/bitstream/1783.1-1790/1/th_redirect.html.

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

Council of Science Editors:

Zhang J. Nearest neighbor queries in spatial and spatio-temporal databases. [Thesis]. Hong Kong University of Science and Technology; 2003. Available from: http://repository.ust.hk/ir/Record/1783.1-1790 ; https://doi.org/10.14711/thesis-b810478 ; http://repository.ust.hk/ir/bitstream/1783.1-1790/1/th_redirect.html

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


Hong Kong University of Science and Technology

8. Hui, Michael Chun Kit. Aggregate nearest neighbor queries.

Degree: 2004, Hong Kong University of Science and Technology

 Given two sets of points P (e.g., facilities) and Q (queries) in a multidimensional vector space, an aggregate nearest neighbor (ANN) query retrieves the point(s)… (more)

Subjects/Keywords: Query languages (Computer science) ; Nearest neighbor analysis (Statistics) ; Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hui, M. C. K. (2004). Aggregate nearest neighbor queries. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-5794 ; https://doi.org/10.14711/thesis-b837457 ; http://repository.ust.hk/ir/bitstream/1783.1-5794/1/th_redirect.html

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

Chicago Manual of Style (16th Edition):

Hui, Michael Chun Kit. “Aggregate nearest neighbor queries.” 2004. Thesis, Hong Kong University of Science and Technology. Accessed January 16, 2021. http://repository.ust.hk/ir/Record/1783.1-5794 ; https://doi.org/10.14711/thesis-b837457 ; http://repository.ust.hk/ir/bitstream/1783.1-5794/1/th_redirect.html.

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

MLA Handbook (7th Edition):

Hui, Michael Chun Kit. “Aggregate nearest neighbor queries.” 2004. Web. 16 Jan 2021.

Vancouver:

Hui MCK. Aggregate nearest neighbor queries. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2004. [cited 2021 Jan 16]. Available from: http://repository.ust.hk/ir/Record/1783.1-5794 ; https://doi.org/10.14711/thesis-b837457 ; http://repository.ust.hk/ir/bitstream/1783.1-5794/1/th_redirect.html.

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

Council of Science Editors:

Hui MCK. Aggregate nearest neighbor queries. [Thesis]. Hong Kong University of Science and Technology; 2004. Available from: http://repository.ust.hk/ir/Record/1783.1-5794 ; https://doi.org/10.14711/thesis-b837457 ; http://repository.ust.hk/ir/bitstream/1783.1-5794/1/th_redirect.html

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


Hong Kong University of Science and Technology

9. Wong, Wing Sing. K-nearest-neighbor queries with non-spatial predicates on range attributes.

Degree: 2005, Hong Kong University of Science and Technology

 Spatial databases have interesting real-life applications with high demands in the area of geographic information system (GIS), transport monitoring, network monitoring and VLSI (chip design).… (more)

Subjects/Keywords: Nearest neighbor analysis (Statistics) ; Query languages (Computer science) ; Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wong, W. S. (2005). K-nearest-neighbor queries with non-spatial predicates on range attributes. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-5807 ; https://doi.org/10.14711/thesis-b856972 ; http://repository.ust.hk/ir/bitstream/1783.1-5807/1/th_redirect.html

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

Chicago Manual of Style (16th Edition):

Wong, Wing Sing. “K-nearest-neighbor queries with non-spatial predicates on range attributes.” 2005. Thesis, Hong Kong University of Science and Technology. Accessed January 16, 2021. http://repository.ust.hk/ir/Record/1783.1-5807 ; https://doi.org/10.14711/thesis-b856972 ; http://repository.ust.hk/ir/bitstream/1783.1-5807/1/th_redirect.html.

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

MLA Handbook (7th Edition):

Wong, Wing Sing. “K-nearest-neighbor queries with non-spatial predicates on range attributes.” 2005. Web. 16 Jan 2021.

Vancouver:

Wong WS. K-nearest-neighbor queries with non-spatial predicates on range attributes. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2005. [cited 2021 Jan 16]. Available from: http://repository.ust.hk/ir/Record/1783.1-5807 ; https://doi.org/10.14711/thesis-b856972 ; http://repository.ust.hk/ir/bitstream/1783.1-5807/1/th_redirect.html.

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

Council of Science Editors:

Wong WS. K-nearest-neighbor queries with non-spatial predicates on range attributes. [Thesis]. Hong Kong University of Science and Technology; 2005. Available from: http://repository.ust.hk/ir/Record/1783.1-5807 ; https://doi.org/10.14711/thesis-b856972 ; http://repository.ust.hk/ir/bitstream/1783.1-5807/1/th_redirect.html

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


Brno University of Technology

10. Martikán, Miroslav. Učení založené na instancích: Instance based learning.

Degree: 2019, Brno University of Technology

 This thesis is specialized in instance based learning algorithms. Main goal is to create an application for educational purposes. There are instance based learning algorithms(more)

Subjects/Keywords: učení s učitelem; učení založené na instancích; IBL algoritmy; metoda nejbližšího souseda; kd-stromy; MATLAB GUI; supervised learning; instance based learning; IBL algorithms; nearest neighbor algorithm; kd-trees; MATLAB GUI

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Martikán, M. (2019). Učení založené na instancích: Instance based learning. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/8607

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

Chicago Manual of Style (16th Edition):

Martikán, Miroslav. “Učení založené na instancích: Instance based learning.” 2019. Thesis, Brno University of Technology. Accessed January 16, 2021. http://hdl.handle.net/11012/8607.

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

MLA Handbook (7th Edition):

Martikán, Miroslav. “Učení založené na instancích: Instance based learning.” 2019. Web. 16 Jan 2021.

Vancouver:

Martikán M. Učení založené na instancích: Instance based learning. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/11012/8607.

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

Council of Science Editors:

Martikán M. Učení založené na instancích: Instance based learning. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/8607

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

11. Nguyen, Huy Le. Algorithms for High Dimensional Data .

Degree: PhD, 2014, Princeton University

 The quest of understanding large high dimension data has always been plagued by the so-called "curse of dimensionality": algorithms regularly suffer from terrible exponential dependence… (more)

Subjects/Keywords: algorithms; dimension reduction; high dimension; nearest neighbor search; regression

…problems when generalized to high dimensions. An illustrative example is nearest neighbor search… …dimensions. For the example of nearest neighbor search in Euclidean space, we can apply the lemma… …Section 1.7, we go back to the problem of nearest neighbor search, discuss previous work on the… …approximate nearest neighbor search (see, for example, Datar et al. [47]). For… …and signal processing. Many efficient near(est) neighbor algorithms are known for… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nguyen, H. L. (2014). Algorithms for High Dimensional Data . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01b8515q61f

Chicago Manual of Style (16th Edition):

Nguyen, Huy Le. “Algorithms for High Dimensional Data .” 2014. Doctoral Dissertation, Princeton University. Accessed January 16, 2021. http://arks.princeton.edu/ark:/88435/dsp01b8515q61f.

MLA Handbook (7th Edition):

Nguyen, Huy Le. “Algorithms for High Dimensional Data .” 2014. Web. 16 Jan 2021.

Vancouver:

Nguyen HL. Algorithms for High Dimensional Data . [Internet] [Doctoral dissertation]. Princeton University; 2014. [cited 2021 Jan 16]. Available from: http://arks.princeton.edu/ark:/88435/dsp01b8515q61f.

Council of Science Editors:

Nguyen HL. Algorithms for High Dimensional Data . [Doctoral Dissertation]. Princeton University; 2014. Available from: http://arks.princeton.edu/ark:/88435/dsp01b8515q61f

12. Holländer, John. Investigating the performance of matrix factorization techniques applied on purchase data for recommendation purposes.

Degree: 2015, , Faculty of Technology and Society (TS)

  Automated systems for producing product recommendations to users is a relatively new area within the field of machine learning. Matrix factorization techniques have been… (more)

Subjects/Keywords: Recommender systems; Matrix factorization; Machine learning; Implicit feedback; Recommender algorithms; Nearest neighbor; UserNN; Recommendation systems; UserKnn; Engineering and Technology; Teknik och teknologier

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Holländer, J. (2015). Investigating the performance of matrix factorization techniques applied on purchase data for recommendation purposes. (Thesis). , Faculty of Technology and Society (TS). Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-20624

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

Chicago Manual of Style (16th Edition):

Holländer, John. “Investigating the performance of matrix factorization techniques applied on purchase data for recommendation purposes.” 2015. Thesis, , Faculty of Technology and Society (TS). Accessed January 16, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-20624.

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

MLA Handbook (7th Edition):

Holländer, John. “Investigating the performance of matrix factorization techniques applied on purchase data for recommendation purposes.” 2015. Web. 16 Jan 2021.

Vancouver:

Holländer J. Investigating the performance of matrix factorization techniques applied on purchase data for recommendation purposes. [Internet] [Thesis]. , Faculty of Technology and Society (TS); 2015. [cited 2021 Jan 16]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-20624.

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

Council of Science Editors:

Holländer J. Investigating the performance of matrix factorization techniques applied on purchase data for recommendation purposes. [Thesis]. , Faculty of Technology and Society (TS); 2015. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-20624

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

13. Ram, Parikshit. New paradigms for approximate nearest-neighbor search.

Degree: PhD, Computational Science and Engineering, 2013, Georgia Tech

Nearest-neighbor search is a very natural and universal problem in computer science. Often times, the problem size necessitates approximation. In this thesis, I present new… (more)

Subjects/Keywords: Similarity search; Nearest-neighbor search; Computational geometry; Algorithms and analysis; Nearest neighbor analysis (Statistics); Approximation algorithms; Search theory

…new theory and algorithms in these paradigms) that make nearest-neighbor search more… …and presents various algorithms that can return an approximate nearest-neighbor within a… …for an approximate nearest-neighbor of the query. . . . . . . . . . . . . . . . 8 3 4… …18 6 Planted nearest-neighbor model. . . . . . . . . . . . . . . . . . . . . . 23 7… …13 ix 14 Efficiency over exact search. The speedups of 3 algorithms for k-nearest… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ram, P. (2013). New paradigms for approximate nearest-neighbor search. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/49112

Chicago Manual of Style (16th Edition):

Ram, Parikshit. “New paradigms for approximate nearest-neighbor search.” 2013. Doctoral Dissertation, Georgia Tech. Accessed January 16, 2021. http://hdl.handle.net/1853/49112.

MLA Handbook (7th Edition):

Ram, Parikshit. “New paradigms for approximate nearest-neighbor search.” 2013. Web. 16 Jan 2021.

Vancouver:

Ram P. New paradigms for approximate nearest-neighbor search. [Internet] [Doctoral dissertation]. Georgia Tech; 2013. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/1853/49112.

Council of Science Editors:

Ram P. New paradigms for approximate nearest-neighbor search. [Doctoral Dissertation]. Georgia Tech; 2013. Available from: http://hdl.handle.net/1853/49112


Laurentian University

14. Nour, Abdala. Markov blanket: efficient strategy for feature subset selection method for high dimensionality microarray cancer datasets .

Degree: 2017, Laurentian University

 Currently, feature subset selection methods are very important, especially in areas of application for which datasets with tens or hundreds of thousands of variables (genes)… (more)

Subjects/Keywords: Microarray datasets; feature selection methods; genetic algorithms; memetic algorithms; overfitting problem; fitness function; crossover; mutation; Markov Blanket; minimum redundancy-maximum relevant,; support vector machine; naive Bayes; k-nearest-neighbor; ensemble classifier; Bayesian networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nour, A. (2017). Markov blanket: efficient strategy for feature subset selection method for high dimensionality microarray cancer datasets . (Thesis). Laurentian University. Retrieved from https://zone.biblio.laurentian.ca/handle/10219/2848

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

Chicago Manual of Style (16th Edition):

Nour, Abdala. “Markov blanket: efficient strategy for feature subset selection method for high dimensionality microarray cancer datasets .” 2017. Thesis, Laurentian University. Accessed January 16, 2021. https://zone.biblio.laurentian.ca/handle/10219/2848.

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

MLA Handbook (7th Edition):

Nour, Abdala. “Markov blanket: efficient strategy for feature subset selection method for high dimensionality microarray cancer datasets .” 2017. Web. 16 Jan 2021.

Vancouver:

Nour A. Markov blanket: efficient strategy for feature subset selection method for high dimensionality microarray cancer datasets . [Internet] [Thesis]. Laurentian University; 2017. [cited 2021 Jan 16]. Available from: https://zone.biblio.laurentian.ca/handle/10219/2848.

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

Council of Science Editors:

Nour A. Markov blanket: efficient strategy for feature subset selection method for high dimensionality microarray cancer datasets . [Thesis]. Laurentian University; 2017. Available from: https://zone.biblio.laurentian.ca/handle/10219/2848

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


Brno University of Technology

15. Guňka, Jiří. Adaptivní klient pro sociální síť Twitter: Adaptive Client for Twitter Social Network.

Degree: 2018, Brno University of Technology

 The goal of this term project is create user friendly client of Twitter. They may use methods of machine learning as naive bayes classifier to… (more)

Subjects/Keywords: Twitter; The Jit; Titanium; Appcelator; adaptivní algoritmy; Naivní Bayesův filtr; strojové učení; k-nejbližších sousedů; rozhodovací strom; hyperbolické stromy; stromové mapy; Twitter; The Jit; Titanium; Appcelator; adaptive algorithms; naive bayes classifier; machine learning; k-nearest neighbor; decision tree; hyperbolic tree; treemaps

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Guňka, J. (2018). Adaptivní klient pro sociální síť Twitter: Adaptive Client for Twitter Social Network. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/54195

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

Chicago Manual of Style (16th Edition):

Guňka, Jiří. “Adaptivní klient pro sociální síť Twitter: Adaptive Client for Twitter Social Network.” 2018. Thesis, Brno University of Technology. Accessed January 16, 2021. http://hdl.handle.net/11012/54195.

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

MLA Handbook (7th Edition):

Guňka, Jiří. “Adaptivní klient pro sociální síť Twitter: Adaptive Client for Twitter Social Network.” 2018. Web. 16 Jan 2021.

Vancouver:

Guňka J. Adaptivní klient pro sociální síť Twitter: Adaptive Client for Twitter Social Network. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/11012/54195.

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

Council of Science Editors:

Guňka J. Adaptivní klient pro sociální síť Twitter: Adaptive Client for Twitter Social Network. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/54195

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


Vanderbilt University

16. Varol, Huseyin Atakan. Progress towards the intelligent control of a powered transfemoral prosthesis.

Degree: MS, Electrical Engineering, 2007, Vanderbilt University

 In this thesis, firstly a real-time gait intent recognition approach for use in controlling a fully powered transfemoral prosthesis is described. Rather than utilize an… (more)

Subjects/Keywords: decomposition based control; powered transfemoral prosthesis; gait intent recognition; nearest neighbor algorithms; Artificial legs  – Design and construction; Intelligent control systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Varol, H. A. (2007). Progress towards the intelligent control of a powered transfemoral prosthesis. (Thesis). Vanderbilt University. Retrieved from http://hdl.handle.net/1803/13605

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

Chicago Manual of Style (16th Edition):

Varol, Huseyin Atakan. “Progress towards the intelligent control of a powered transfemoral prosthesis.” 2007. Thesis, Vanderbilt University. Accessed January 16, 2021. http://hdl.handle.net/1803/13605.

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

MLA Handbook (7th Edition):

Varol, Huseyin Atakan. “Progress towards the intelligent control of a powered transfemoral prosthesis.” 2007. Web. 16 Jan 2021.

Vancouver:

Varol HA. Progress towards the intelligent control of a powered transfemoral prosthesis. [Internet] [Thesis]. Vanderbilt University; 2007. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/1803/13605.

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

Council of Science Editors:

Varol HA. Progress towards the intelligent control of a powered transfemoral prosthesis. [Thesis]. Vanderbilt University; 2007. Available from: http://hdl.handle.net/1803/13605

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

17. Calleja, Renato Carlos. Existence and persistence of invariant objects in dynamical systems and mathematical physics.

Degree: PhD, Mathematics, 2009, University of Texas – Austin

 In this dissertation we present four papers as chapters. In Chapter 2, we extended the techniques used for the Klein-Gordon Chain by Iooss, Kirchgässner, James,… (more)

Subjects/Keywords: Klein-Gordon Chain; Nearest neighbor interaction; Quasi-periodic solutions; N Fourier coefficients; Numerical KAM algorithms

…with non-nearest neighbor interactions. We look for travelling waves by reducing the Klein… …Gordon chain with second nearest neighbor interaction to an advance-delay equation. Then we… …mechanics models allowing non-nearest neighbor interactions. If we discretize a hull function… …systems with non-nearest neighbor interactions Introduction… …nearest neighbor interactions . . . . . . . . 3.4.2.2 The Frenkel-Kontorova model with long… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Calleja, R. C. (2009). Existence and persistence of invariant objects in dynamical systems and mathematical physics. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/17290

Chicago Manual of Style (16th Edition):

Calleja, Renato Carlos. “Existence and persistence of invariant objects in dynamical systems and mathematical physics.” 2009. Doctoral Dissertation, University of Texas – Austin. Accessed January 16, 2021. http://hdl.handle.net/2152/17290.

MLA Handbook (7th Edition):

Calleja, Renato Carlos. “Existence and persistence of invariant objects in dynamical systems and mathematical physics.” 2009. Web. 16 Jan 2021.

Vancouver:

Calleja RC. Existence and persistence of invariant objects in dynamical systems and mathematical physics. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2009. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/2152/17290.

Council of Science Editors:

Calleja RC. Existence and persistence of invariant objects in dynamical systems and mathematical physics. [Doctoral Dissertation]. University of Texas – Austin; 2009. Available from: http://hdl.handle.net/2152/17290

18. Curtin, Ryan Ross. Improving dual-tree algorithms.

Degree: PhD, Electrical and Computer Engineering, 2015, Georgia Tech

 This large body of work is entirely centered around dual-tree algorithms, a class of algorithm based on spatial indexing structures that often provide large amounts… (more)

Subjects/Keywords: Machine learning; Computational geometry; Tree-based algorithms; Dual-tree algorithms; Kd-tree; Nearest neighbor search; K-means clustering; Data mining

algorithms The nearest neighbor search algorithm for kd-trees given in the previous section (… …was the nearest-neighbor distance [7, 8, 9], which led to the well-known nearest… …neighbor rule for classification [10]. Numerous other data-driven algorithms for… …the nearest-neighbor rule for classification was briefly mentioned [10]. This task… …given some query point pq . Our task is to predict cq . The nearest neighbor rule for… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Curtin, R. R. (2015). Improving dual-tree algorithms. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/54354

Chicago Manual of Style (16th Edition):

Curtin, Ryan Ross. “Improving dual-tree algorithms.” 2015. Doctoral Dissertation, Georgia Tech. Accessed January 16, 2021. http://hdl.handle.net/1853/54354.

MLA Handbook (7th Edition):

Curtin, Ryan Ross. “Improving dual-tree algorithms.” 2015. Web. 16 Jan 2021.

Vancouver:

Curtin RR. Improving dual-tree algorithms. [Internet] [Doctoral dissertation]. Georgia Tech; 2015. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/1853/54354.

Council of Science Editors:

Curtin RR. Improving dual-tree algorithms. [Doctoral Dissertation]. Georgia Tech; 2015. Available from: http://hdl.handle.net/1853/54354

19. Goyal, Amit. Streaming and Sketch Algorithms for Large Data NLP.

Degree: Computer Science, 2013, University of Maryland

 The availability of large and rich quantities of text data is due to the emergence of the World Wide Web, social media, and mobile devices.… (more)

Subjects/Keywords: Computer science; Count-Min sketch; Fast Large Scale Approximate Graph (FLAG); Large data NLP; Nearest Neighbor Search; Sketch algorithms; Streaming

…Evaluating Approximate Nearest Neighbor 6.3.3.1 Experimental Setup . . . . . . . . 6.3.3.2… …and broad NLP problem: constructing large nearest-neighbor graphs in a memory- and time… …construct nearest-neighbor graphs between word pairs by computing the nearest neighbors of words… …terms. To construct large nearest-neighbor graphs, I propose Fast Large-Scale Approximate… …from approximate nearest neighbor graphs. Third, I describe an approximate version of… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Goyal, A. (2013). Streaming and Sketch Algorithms for Large Data NLP. (Thesis). University of Maryland. Retrieved from http://hdl.handle.net/1903/14451

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

Chicago Manual of Style (16th Edition):

Goyal, Amit. “Streaming and Sketch Algorithms for Large Data NLP.” 2013. Thesis, University of Maryland. Accessed January 16, 2021. http://hdl.handle.net/1903/14451.

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

MLA Handbook (7th Edition):

Goyal, Amit. “Streaming and Sketch Algorithms for Large Data NLP.” 2013. Web. 16 Jan 2021.

Vancouver:

Goyal A. Streaming and Sketch Algorithms for Large Data NLP. [Internet] [Thesis]. University of Maryland; 2013. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/1903/14451.

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

Council of Science Editors:

Goyal A. Streaming and Sketch Algorithms for Large Data NLP. [Thesis]. University of Maryland; 2013. Available from: http://hdl.handle.net/1903/14451

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

20. Lu, Victor. Multicore construction of k-d trees with applications in graphics and vision.

Degree: PhD, 0112, 2014, University of Illinois – Urbana-Champaign

 The k-d tree is widely used in graphics and vision applications for accelerating retrieval from large sets of geometric entities in R^k. Despite speeding up… (more)

Subjects/Keywords: computer graphics; vision; spatial data structures; k-d trees; multicore; parallel algorithms; ray-tracing; nearest neighbor search; image search; object detection; point cloud processing

…PatchMatch [8, 9] can quickly compute a nearest neighbor field over all patches in an… …SIFT [69]). Image search is thus often a nearest neighbor search in Euclidean… …dimensional approximate nearest neighbor search. This chapter demonstrates that a node parallel… …of other methods and data structures. For nearest ray-triangle intersections, bounding… …volume hierarchies (BVHs) have been a popular choice. For low dimensional nearest… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lu, V. (2014). Multicore construction of k-d trees with applications in graphics and vision. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/46588

Chicago Manual of Style (16th Edition):

Lu, Victor. “Multicore construction of k-d trees with applications in graphics and vision.” 2014. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed January 16, 2021. http://hdl.handle.net/2142/46588.

MLA Handbook (7th Edition):

Lu, Victor. “Multicore construction of k-d trees with applications in graphics and vision.” 2014. Web. 16 Jan 2021.

Vancouver:

Lu V. Multicore construction of k-d trees with applications in graphics and vision. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2014. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/2142/46588.

Council of Science Editors:

Lu V. Multicore construction of k-d trees with applications in graphics and vision. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/46588


Brno University of Technology

21. Bílý, Ondřej. Moderní řečové příznaky používané při diagnóze chorob: State of the art speech features used during the Parkinson disease diagnosis.

Degree: 2019, Brno University of Technology

 This work deals with the diagnosis of Parkinson's disease by analyzing the speech signal. At the beginning of this work there is described speech signal… (more)

Subjects/Keywords: Řeč; prozodie; jitter; shimmer; Parkinsonova choroba; hypokinetická dysartrie; analýza řečového signálu; segmentace; parametrizace; segmentální příznak; formant; výběr příznaků; samohláska; souhláska; učící se algoritmy; matice záměn; klasifikace; přesnost; Matthewůw korelační koeficient; algoritmy podpůrných vektorů; umělé neuronové sítě; k nejbližších sousedů.; Speech; prosody; jitter; shimmer; Parkinson's disease; hypokinetic dysarthria; speech signal analysis; segmentation; parameterization; segmentation symptom; formant; selection symptom; vowel; consonant; learning algorithms; confusion matrix; classification; accuracy; Matthews correlation coefficient; support vector machine; Artificial neural network; k nearest-neighbor.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bílý, O. (2019). Moderní řečové příznaky používané při diagnóze chorob: State of the art speech features used during the Parkinson disease diagnosis. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/3819

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

Chicago Manual of Style (16th Edition):

Bílý, Ondřej. “Moderní řečové příznaky používané při diagnóze chorob: State of the art speech features used during the Parkinson disease diagnosis.” 2019. Thesis, Brno University of Technology. Accessed January 16, 2021. http://hdl.handle.net/11012/3819.

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

MLA Handbook (7th Edition):

Bílý, Ondřej. “Moderní řečové příznaky používané při diagnóze chorob: State of the art speech features used during the Parkinson disease diagnosis.” 2019. Web. 16 Jan 2021.

Vancouver:

Bílý O. Moderní řečové příznaky používané při diagnóze chorob: State of the art speech features used during the Parkinson disease diagnosis. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/11012/3819.

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

Council of Science Editors:

Bílý O. Moderní řečové příznaky používané při diagnóze chorob: State of the art speech features used during the Parkinson disease diagnosis. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/3819

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


University of New South Wales

22. Cheema, Muhammad Aamir. CircularTrip and ArcTrip: effective grid access methods for continuous spatial queries.

Degree: Computer Science & Engineering, 2007, University of New South Wales

 A k nearest neighbor query q retrieves k objects that lie closest to the query point q among a given set of objects P. With… (more)

Subjects/Keywords: Nearest neighbor analysis (Statistics); Querying (Computer science); Query languages (Computer science); Data structures (Computer science); Real-time data processing; Geographic information systems  – Data processing; Computational grids (Computer systems); Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cheema, M. A. (2007). CircularTrip and ArcTrip: effective grid access methods for continuous spatial queries. (Masters Thesis). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/40512 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:1678/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Cheema, Muhammad Aamir. “CircularTrip and ArcTrip: effective grid access methods for continuous spatial queries.” 2007. Masters Thesis, University of New South Wales. Accessed January 16, 2021. http://handle.unsw.edu.au/1959.4/40512 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:1678/SOURCE02?view=true.

MLA Handbook (7th Edition):

Cheema, Muhammad Aamir. “CircularTrip and ArcTrip: effective grid access methods for continuous spatial queries.” 2007. Web. 16 Jan 2021.

Vancouver:

Cheema MA. CircularTrip and ArcTrip: effective grid access methods for continuous spatial queries. [Internet] [Masters thesis]. University of New South Wales; 2007. [cited 2021 Jan 16]. Available from: http://handle.unsw.edu.au/1959.4/40512 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:1678/SOURCE02?view=true.

Council of Science Editors:

Cheema MA. CircularTrip and ArcTrip: effective grid access methods for continuous spatial queries. [Masters Thesis]. University of New South Wales; 2007. Available from: http://handle.unsw.edu.au/1959.4/40512 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:1678/SOURCE02?view=true

23. Koval, Oksana. Using supervised machine learning to classify ceramic fabrics.

Degree: Anthropology, 2018, University of Manitoba

 Objective: The purpose of this thesis was to assess the ability of supervised machine learning to discriminate between images of ceramic fabrics and evaluate the… (more)

Subjects/Keywords: machine learning; supervised; supervised machine learning; classification; nearest neighbour; nearest neighbor; k nearest neighbour; archaeology; wndchrm; WND-CHRM; wndcharm; wnd; weighted nearest neighbour; weighted nearest neighbor; weighted nearest neighbour distance; weighted nearest distance; weighted neighbour distance using compound hierarchy of algorithms representing morphology; algorithm; pattern recognition; ceramic fabric analysis; ceramic; ceramic fabric; ceramics; pot; pottery; ceramic fabric; pottery fabric; paste; ceramic paste; pottery paste; fabric analysis; shaping; ceramic shaping; pottery shaping; vessel shaping; identification; data collection; image aquisition; dinoxcope; digital microscope; image processing; tile; tiling; ceramic classification; pottery classification; computer ceramic classification; computer analysis ceramics; pottery computer analysis; ceramic classification; dataset; datasets; pottery dataset; ceramic dataset; fabric dataset; ceramic fabric dataset; ceramic paste dataset; shaping methods; shaping technique; zulu; south africa; ethnoarchaeology; experimental; superrvised; fabric dataset; training set; training dataset; guidelines; computer analysis; new approaches; method; methodology; anthropology; programming; dataset guideline; ceramic production analysis; technological style; ceramic technological style; identify individual potter; individual; identify; provenience; homogeneity; accuracy; dataset design; ceramic dataset design; ceramic images dataset; ceramic images training set; ceramic fabric training set; ceramic fabric dataset; machine learning in archaeology; machine learning in ceramic analysis; image analysis

…of distance between two examples. . . . . . . . . . . An example of K-nearest neighbour… …Neighbour Distance using Compound Hierarchy of algorithms Representing Morphology, to classify… …learning algorithms learn to complete tasks or make predictions when provided with some input… …anyone. It consists of a collection of algorithms designed to extract information from training… …three key steps. First, the feature extraction algorithms are used to transform graphical… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Koval, O. (2018). Using supervised machine learning to classify ceramic fabrics. (Masters Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/33021

Chicago Manual of Style (16th Edition):

Koval, Oksana. “Using supervised machine learning to classify ceramic fabrics.” 2018. Masters Thesis, University of Manitoba. Accessed January 16, 2021. http://hdl.handle.net/1993/33021.

MLA Handbook (7th Edition):

Koval, Oksana. “Using supervised machine learning to classify ceramic fabrics.” 2018. Web. 16 Jan 2021.

Vancouver:

Koval O. Using supervised machine learning to classify ceramic fabrics. [Internet] [Masters thesis]. University of Manitoba; 2018. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/1993/33021.

Council of Science Editors:

Koval O. Using supervised machine learning to classify ceramic fabrics. [Masters Thesis]. University of Manitoba; 2018. Available from: http://hdl.handle.net/1993/33021

.