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:(Clustering algorithms). Showing records 1 – 30 of 190 total matches.

[1] [2] [3] [4] [5] [6] [7]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Country

▼ Search Limiters


University of Texas – Austin

1. Krumpelman, Chase Serhur. Overlapping clustering.

Degree: Electrical and Computer Engineering, 2010, University of Texas – Austin

 Analysis of large collections of data has become inescapable in many areas of scientific and commercial endeavor. As the size and dimensionality of these collections… (more)

Subjects/Keywords: Clustering algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Krumpelman, C. S. (2010). Overlapping clustering. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2010-08-2022

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):

Krumpelman, Chase Serhur. “Overlapping clustering.” 2010. Thesis, University of Texas – Austin. Accessed June 19, 2019. http://hdl.handle.net/2152/ETD-UT-2010-08-2022.

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

MLA Handbook (7th Edition):

Krumpelman, Chase Serhur. “Overlapping clustering.” 2010. Web. 19 Jun 2019.

Vancouver:

Krumpelman CS. Overlapping clustering. [Internet] [Thesis]. University of Texas – Austin; 2010. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/2152/ETD-UT-2010-08-2022.

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

Council of Science Editors:

Krumpelman CS. Overlapping clustering. [Thesis]. University of Texas – Austin; 2010. Available from: http://hdl.handle.net/2152/ETD-UT-2010-08-2022

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


California State University – Sacramento

2. Bhinge, Akshay Vishwanath. A comparative study on data mining tools.

Degree: MS, Computer Science, 2015, California State University – Sacramento

 In a data mining course such as CSc 177 (Data Warehouse and Data Mining) at California State University, Sacramento, the students need to work on… (more)

Subjects/Keywords: Classification algorithm; Clustering algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bhinge, A. V. (2015). A comparative study on data mining tools. (Masters Thesis). California State University – Sacramento. Retrieved from http://hdl.handle.net/10211.3/158470

Chicago Manual of Style (16th Edition):

Bhinge, Akshay Vishwanath. “A comparative study on data mining tools.” 2015. Masters Thesis, California State University – Sacramento. Accessed June 19, 2019. http://hdl.handle.net/10211.3/158470.

MLA Handbook (7th Edition):

Bhinge, Akshay Vishwanath. “A comparative study on data mining tools.” 2015. Web. 19 Jun 2019.

Vancouver:

Bhinge AV. A comparative study on data mining tools. [Internet] [Masters thesis]. California State University – Sacramento; 2015. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/10211.3/158470.

Council of Science Editors:

Bhinge AV. A comparative study on data mining tools. [Masters Thesis]. California State University – Sacramento; 2015. Available from: http://hdl.handle.net/10211.3/158470


Penn State University

3. Prabhakara, Shruthi. Clustering Algorithms for Next-generation Sequencing Data from Heterogeneous Populations.

Degree: PhD, Computer Science and Engineering, 2012, Penn State University

 Next Generation Sequencing (NGS) technologies generate data more efficiently, economically and with a greater depth than ever before. NGS has opened up an array of… (more)

Subjects/Keywords: Clustering; Metagenomics; Mixture-modeling; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Prabhakara, S. (2012). Clustering Algorithms for Next-generation Sequencing Data from Heterogeneous Populations. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/16053

Chicago Manual of Style (16th Edition):

Prabhakara, Shruthi. “Clustering Algorithms for Next-generation Sequencing Data from Heterogeneous Populations.” 2012. Doctoral Dissertation, Penn State University. Accessed June 19, 2019. https://etda.libraries.psu.edu/catalog/16053.

MLA Handbook (7th Edition):

Prabhakara, Shruthi. “Clustering Algorithms for Next-generation Sequencing Data from Heterogeneous Populations.” 2012. Web. 19 Jun 2019.

Vancouver:

Prabhakara S. Clustering Algorithms for Next-generation Sequencing Data from Heterogeneous Populations. [Internet] [Doctoral dissertation]. Penn State University; 2012. [cited 2019 Jun 19]. Available from: https://etda.libraries.psu.edu/catalog/16053.

Council of Science Editors:

Prabhakara S. Clustering Algorithms for Next-generation Sequencing Data from Heterogeneous Populations. [Doctoral Dissertation]. Penn State University; 2012. Available from: https://etda.libraries.psu.edu/catalog/16053


Mississippi State University

4. Corn, John. Energy efficient clustering algorithms for homogeneous wireless sensor networks.

Degree: MS, Electrical and Computer Engineering, 2017, Mississippi State University

  Wireless sensor networks (WSNs) are systems of resource-constrained sensor nodes (SNs), distributed throughout a sensor field. Energy limitations persist due to the wireless nature… (more)

Subjects/Keywords: algorithms; wireless sensor networks; clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Corn, J. (2017). Energy efficient clustering algorithms for homogeneous wireless sensor networks. (Masters Thesis). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-03242017-052126/ ;

Chicago Manual of Style (16th Edition):

Corn, John. “Energy efficient clustering algorithms for homogeneous wireless sensor networks.” 2017. Masters Thesis, Mississippi State University. Accessed June 19, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-03242017-052126/ ;.

MLA Handbook (7th Edition):

Corn, John. “Energy efficient clustering algorithms for homogeneous wireless sensor networks.” 2017. Web. 19 Jun 2019.

Vancouver:

Corn J. Energy efficient clustering algorithms for homogeneous wireless sensor networks. [Internet] [Masters thesis]. Mississippi State University; 2017. [cited 2019 Jun 19]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-03242017-052126/ ;.

Council of Science Editors:

Corn J. Energy efficient clustering algorithms for homogeneous wireless sensor networks. [Masters Thesis]. Mississippi State University; 2017. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-03242017-052126/ ;


Anna University

5. Puniethaa Prabhu. An Efficient Visual Approach For Automatic Clustering And Validation;.

Degree: Computer Science, 2013, Anna University

Clustering or exploratory data analysis is a widely applied newlineunsupervised technique in the data mining domain The major concern of the newlinedomain is how the… (more)

Subjects/Keywords: algorithms; Clustering; data mining; Indexbased; Validation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Prabhu, P. (2013). An Efficient Visual Approach For Automatic Clustering And Validation;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/26159

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):

Prabhu, Puniethaa. “An Efficient Visual Approach For Automatic Clustering And Validation;.” 2013. Thesis, Anna University. Accessed June 19, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/26159.

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

MLA Handbook (7th Edition):

Prabhu, Puniethaa. “An Efficient Visual Approach For Automatic Clustering And Validation;.” 2013. Web. 19 Jun 2019.

Vancouver:

Prabhu P. An Efficient Visual Approach For Automatic Clustering And Validation;. [Internet] [Thesis]. Anna University; 2013. [cited 2019 Jun 19]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/26159.

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

Council of Science Editors:

Prabhu P. An Efficient Visual Approach For Automatic Clustering And Validation;. [Thesis]. Anna University; 2013. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/26159

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


Universiteit Utrecht

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

Degree: 2014, Universiteit Utrecht

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

Plattel, C J. “Distributed and Incremental Clustering using Shared Nearest Neighbours.” 2014. Web. 19 Jun 2019.

Vancouver:

Plattel CJ. Distributed and Incremental Clustering using Shared Nearest Neighbours. [Internet] [Masters thesis]. Universiteit Utrecht; 2014. [cited 2019 Jun 19]. 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


Penn State University

7. Sah, Navdha. Clustering Using Differential Evolution.

Degree: MS, Computer Science, 2016, Penn State University

 In the past few decades, clustering or cluster analysis has emerged as an essential tool in several fields to help find conceptually meaningful groups of… (more)

Subjects/Keywords: clustering; differential evolution; evolutionary algorithms; genetic algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sah, N. (2016). Clustering Using Differential Evolution. (Masters Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/12405nxs328

Chicago Manual of Style (16th Edition):

Sah, Navdha. “Clustering Using Differential Evolution.” 2016. Masters Thesis, Penn State University. Accessed June 19, 2019. https://etda.libraries.psu.edu/catalog/12405nxs328.

MLA Handbook (7th Edition):

Sah, Navdha. “Clustering Using Differential Evolution.” 2016. Web. 19 Jun 2019.

Vancouver:

Sah N. Clustering Using Differential Evolution. [Internet] [Masters thesis]. Penn State University; 2016. [cited 2019 Jun 19]. Available from: https://etda.libraries.psu.edu/catalog/12405nxs328.

Council of Science Editors:

Sah N. Clustering Using Differential Evolution. [Masters Thesis]. Penn State University; 2016. Available from: https://etda.libraries.psu.edu/catalog/12405nxs328


Universidade Nova

8. Nunes, Neuza Filipa Martins. Algorithms for time series clustering applied to biomedical signals.

Degree: 2011, Universidade Nova

Thesis submitted in the fulfillment of the requirements for the Degree of Master in Biomedical Engineering

The increasing number of biomedical systems and applications for… (more)

Subjects/Keywords: Biosignals; Algorithms; Signal-Processing; Alignment techniques; Clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nunes, N. F. M. (2011). Algorithms for time series clustering applied to biomedical signals. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/5666

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):

Nunes, Neuza Filipa Martins. “Algorithms for time series clustering applied to biomedical signals.” 2011. Thesis, Universidade Nova. Accessed June 19, 2019. http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/5666.

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

MLA Handbook (7th Edition):

Nunes, Neuza Filipa Martins. “Algorithms for time series clustering applied to biomedical signals.” 2011. Web. 19 Jun 2019.

Vancouver:

Nunes NFM. Algorithms for time series clustering applied to biomedical signals. [Internet] [Thesis]. Universidade Nova; 2011. [cited 2019 Jun 19]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/5666.

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

Council of Science Editors:

Nunes NFM. Algorithms for time series clustering applied to biomedical signals. [Thesis]. Universidade Nova; 2011. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/5666

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


Virginia Tech

9. Parikh, Nidhi Kiranbhai. Generating Random Graphs with Tunable Clustering Coefficient.

Degree: MS, Computer Science, 2011, Virginia Tech

 Most real-world networks exhibit a high clustering coefficientâ the probability that two neighbors of a node are also neighbors of each other. We propose four… (more)

Subjects/Keywords: Clustering coefficient; complex networks; random graphs; algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Parikh, N. K. (2011). Generating Random Graphs with Tunable Clustering Coefficient. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/31591

Chicago Manual of Style (16th Edition):

Parikh, Nidhi Kiranbhai. “Generating Random Graphs with Tunable Clustering Coefficient.” 2011. Masters Thesis, Virginia Tech. Accessed June 19, 2019. http://hdl.handle.net/10919/31591.

MLA Handbook (7th Edition):

Parikh, Nidhi Kiranbhai. “Generating Random Graphs with Tunable Clustering Coefficient.” 2011. Web. 19 Jun 2019.

Vancouver:

Parikh NK. Generating Random Graphs with Tunable Clustering Coefficient. [Internet] [Masters thesis]. Virginia Tech; 2011. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/10919/31591.

Council of Science Editors:

Parikh NK. Generating Random Graphs with Tunable Clustering Coefficient. [Masters Thesis]. Virginia Tech; 2011. Available from: http://hdl.handle.net/10919/31591


Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ)

10. Gkaitatzis, Stamatios. Μελέτη παραγωγής δύο μποζονίων και του συστήματος αναβάθμισης Fast Tracker (FTK) στο πείραμα ATLAS στο CERN.

Degree: 2018, Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ)

 The present doctoral dissertation focuses on three related but distinct topics.The first topic is the study of the production of W±Z and ZZ at proton-proton… (more)

Subjects/Keywords: FTK; Clustering; Image processing; Clustering Algorithms; Particle physics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gkaitatzis, S. (2018). Μελέτη παραγωγής δύο μποζονίων και του συστήματος αναβάθμισης Fast Tracker (FTK) στο πείραμα ATLAS στο CERN. (Thesis). Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ). Retrieved from http://hdl.handle.net/10442/hedi/43705

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):

Gkaitatzis, Stamatios. “Μελέτη παραγωγής δύο μποζονίων και του συστήματος αναβάθμισης Fast Tracker (FTK) στο πείραμα ATLAS στο CERN.” 2018. Thesis, Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ). Accessed June 19, 2019. http://hdl.handle.net/10442/hedi/43705.

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

MLA Handbook (7th Edition):

Gkaitatzis, Stamatios. “Μελέτη παραγωγής δύο μποζονίων και του συστήματος αναβάθμισης Fast Tracker (FTK) στο πείραμα ATLAS στο CERN.” 2018. Web. 19 Jun 2019.

Vancouver:

Gkaitatzis S. Μελέτη παραγωγής δύο μποζονίων και του συστήματος αναβάθμισης Fast Tracker (FTK) στο πείραμα ATLAS στο CERN. [Internet] [Thesis]. Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ); 2018. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/10442/hedi/43705.

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

Council of Science Editors:

Gkaitatzis S. Μελέτη παραγωγής δύο μποζονίων και του συστήματος αναβάθμισης Fast Tracker (FTK) στο πείραμα ATLAS στο CERN. [Thesis]. Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ); 2018. Available from: http://hdl.handle.net/10442/hedi/43705

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

11. Edla, Damodar Reddy. Developing algorithms for clustering biological data; -.

Degree: Engineering, 2013, INFLIBNET

None

References p.125-141, Appendices p.86-96

Advisors/Committee Members: Jana, Prasanta K.

Subjects/Keywords: Computer Science; Clustering Algorithms; algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Edla, D. R. (2013). Developing algorithms for clustering biological data; -. (Thesis). INFLIBNET. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/9728

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):

Edla, Damodar Reddy. “Developing algorithms for clustering biological data; -.” 2013. Thesis, INFLIBNET. Accessed June 19, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/9728.

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

MLA Handbook (7th Edition):

Edla, Damodar Reddy. “Developing algorithms for clustering biological data; -.” 2013. Web. 19 Jun 2019.

Vancouver:

Edla DR. Developing algorithms for clustering biological data; -. [Internet] [Thesis]. INFLIBNET; 2013. [cited 2019 Jun 19]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/9728.

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

Council of Science Editors:

Edla DR. Developing algorithms for clustering biological data; -. [Thesis]. INFLIBNET; 2013. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/9728

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

12. Lammersen, Christiane. Approximation Techniques for Facility Location and Their Applications in Metric Embeddings.

Degree: 2010, Technische Universität Dortmund

 This thesis addresses the development of geometric approximation algorithms for huge datasets and is subdivided into two parts. The first part deals with algorithms for… (more)

Subjects/Keywords: approximation algorithms; clustering; distributed algorithms; embedding; facility location; kinetic data structures; streaming algorithms; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lammersen, C. (2010). Approximation Techniques for Facility Location and Their Applications in Metric Embeddings. (Thesis). Technische Universität Dortmund. Retrieved from http://hdl.handle.net/2003/27597

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):

Lammersen, Christiane. “Approximation Techniques for Facility Location and Their Applications in Metric Embeddings.” 2010. Thesis, Technische Universität Dortmund. Accessed June 19, 2019. http://hdl.handle.net/2003/27597.

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

MLA Handbook (7th Edition):

Lammersen, Christiane. “Approximation Techniques for Facility Location and Their Applications in Metric Embeddings.” 2010. Web. 19 Jun 2019.

Vancouver:

Lammersen C. Approximation Techniques for Facility Location and Their Applications in Metric Embeddings. [Internet] [Thesis]. Technische Universität Dortmund; 2010. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/2003/27597.

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

Council of Science Editors:

Lammersen C. Approximation Techniques for Facility Location and Their Applications in Metric Embeddings. [Thesis]. Technische Universität Dortmund; 2010. Available from: http://hdl.handle.net/2003/27597

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


Queensland University of Technology

13. De Vries, Christopher M. Document clustering algorithms, representations and evaluation for information retrieval.

Degree: 2014, Queensland University of Technology

 This thesis presents new methods for classification and thematic grouping of billions of web pages, at scales previously not achievable. This process is also known… (more)

Subjects/Keywords: document clustering; representations; evaluation; information retrieval; algorithms; clustering; hashing; signatures; efficiency; machine learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

De Vries, C. M. (2014). Document clustering algorithms, representations and evaluation for information retrieval. (Thesis). Queensland University of Technology. Retrieved from https://eprints.qut.edu.au/75862/

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):

De Vries, Christopher M. “Document clustering algorithms, representations and evaluation for information retrieval.” 2014. Thesis, Queensland University of Technology. Accessed June 19, 2019. https://eprints.qut.edu.au/75862/.

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

MLA Handbook (7th Edition):

De Vries, Christopher M. “Document clustering algorithms, representations and evaluation for information retrieval.” 2014. Web. 19 Jun 2019.

Vancouver:

De Vries CM. Document clustering algorithms, representations and evaluation for information retrieval. [Internet] [Thesis]. Queensland University of Technology; 2014. [cited 2019 Jun 19]. Available from: https://eprints.qut.edu.au/75862/.

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

Council of Science Editors:

De Vries CM. Document clustering algorithms, representations and evaluation for information retrieval. [Thesis]. Queensland University of Technology; 2014. Available from: https://eprints.qut.edu.au/75862/

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


Georgia Tech

14. Gupta, Pramod. Robust clustering algorithms.

Degree: MS, Computing, 2011, Georgia Tech

 One of the most widely used techniques for data clustering is agglomerative clustering. Such algorithms have been long used across any different fields ranging from… (more)

Subjects/Keywords: Robust algorithms; Hierarchical clustering; Unsupervised learning; Clustering; Machine learning; Cluster analysis; Cluster analysis Computer programs; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gupta, P. (2011). Robust clustering algorithms. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/39553

Chicago Manual of Style (16th Edition):

Gupta, Pramod. “Robust clustering algorithms.” 2011. Masters Thesis, Georgia Tech. Accessed June 19, 2019. http://hdl.handle.net/1853/39553.

MLA Handbook (7th Edition):

Gupta, Pramod. “Robust clustering algorithms.” 2011. Web. 19 Jun 2019.

Vancouver:

Gupta P. Robust clustering algorithms. [Internet] [Masters thesis]. Georgia Tech; 2011. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/1853/39553.

Council of Science Editors:

Gupta P. Robust clustering algorithms. [Masters Thesis]. Georgia Tech; 2011. Available from: http://hdl.handle.net/1853/39553

15. Shyama, Das. Mean Squared Residue Based Biclustering Algorithms for the Analysis of Gene Expression Data.

Degree: 2011, Cochin University of Science and Technology

 Computational Biology is the research are that contributes to the analysis of biological data through the development of algorithms which will address significant research problems.The… (more)

Subjects/Keywords: Gene expression; Clustering; Biclustering; algorithms; Biclustering algorithms; Computational Biology; mean squared residue

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shyama, D. (2011). Mean Squared Residue Based Biclustering Algorithms for the Analysis of Gene Expression Data. (Thesis). Cochin University of Science and Technology. Retrieved from http://dyuthi.cusat.ac.in/purl/2956

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):

Shyama, Das. “Mean Squared Residue Based Biclustering Algorithms for the Analysis of Gene Expression Data.” 2011. Thesis, Cochin University of Science and Technology. Accessed June 19, 2019. http://dyuthi.cusat.ac.in/purl/2956.

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

MLA Handbook (7th Edition):

Shyama, Das. “Mean Squared Residue Based Biclustering Algorithms for the Analysis of Gene Expression Data.” 2011. Web. 19 Jun 2019.

Vancouver:

Shyama D. Mean Squared Residue Based Biclustering Algorithms for the Analysis of Gene Expression Data. [Internet] [Thesis]. Cochin University of Science and Technology; 2011. [cited 2019 Jun 19]. Available from: http://dyuthi.cusat.ac.in/purl/2956.

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

Council of Science Editors:

Shyama D. Mean Squared Residue Based Biclustering Algorithms for the Analysis of Gene Expression Data. [Thesis]. Cochin University of Science and Technology; 2011. Available from: http://dyuthi.cusat.ac.in/purl/2956

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


Penn State University

16. On, Byung-Won. Data Cleaning Techniques by means of Entity Resolution.

Degree: PhD, Computer Science and Engineering, 2007, Penn State University

 Real data are ``dirty.' Despite active research on integrity constraints enforcement and data cleaning, real data in real database applications are still dirty. To make… (more)

Subjects/Keywords: Data Mining; Clustering Algorithms; Graph Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

On, B. (2007). Data Cleaning Techniques by means of Entity Resolution. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/7797

Chicago Manual of Style (16th Edition):

On, Byung-Won. “Data Cleaning Techniques by means of Entity Resolution.” 2007. Doctoral Dissertation, Penn State University. Accessed June 19, 2019. https://etda.libraries.psu.edu/catalog/7797.

MLA Handbook (7th Edition):

On, Byung-Won. “Data Cleaning Techniques by means of Entity Resolution.” 2007. Web. 19 Jun 2019.

Vancouver:

On B. Data Cleaning Techniques by means of Entity Resolution. [Internet] [Doctoral dissertation]. Penn State University; 2007. [cited 2019 Jun 19]. Available from: https://etda.libraries.psu.edu/catalog/7797.

Council of Science Editors:

On B. Data Cleaning Techniques by means of Entity Resolution. [Doctoral Dissertation]. Penn State University; 2007. Available from: https://etda.libraries.psu.edu/catalog/7797


Virginia Commonwealth University

17. Donachy, Shaun. Spiking Neural Networks: Neuron Models, Plasticity, and Graph Applications.

Degree: MS, Computer Science, 2015, Virginia Commonwealth University

  Networks of spiking neurons can be used not only for brain modeling but also to solve graph problems. With the use of a computationally… (more)

Subjects/Keywords: Spiking Neural Networks; Plasticity; Shortest Path; Graph Clustering; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Donachy, S. (2015). Spiking Neural Networks: Neuron Models, Plasticity, and Graph Applications. (Thesis). Virginia Commonwealth University. Retrieved from https://scholarscompass.vcu.edu/etd/3984

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):

Donachy, Shaun. “Spiking Neural Networks: Neuron Models, Plasticity, and Graph Applications.” 2015. Thesis, Virginia Commonwealth University. Accessed June 19, 2019. https://scholarscompass.vcu.edu/etd/3984.

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

MLA Handbook (7th Edition):

Donachy, Shaun. “Spiking Neural Networks: Neuron Models, Plasticity, and Graph Applications.” 2015. Web. 19 Jun 2019.

Vancouver:

Donachy S. Spiking Neural Networks: Neuron Models, Plasticity, and Graph Applications. [Internet] [Thesis]. Virginia Commonwealth University; 2015. [cited 2019 Jun 19]. Available from: https://scholarscompass.vcu.edu/etd/3984.

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

Council of Science Editors:

Donachy S. Spiking Neural Networks: Neuron Models, Plasticity, and Graph Applications. [Thesis]. Virginia Commonwealth University; 2015. Available from: https://scholarscompass.vcu.edu/etd/3984

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


University of Waterloo

18. Kalhan, Sanchit. The Capacitated Matroid Median Problem.

Degree: 2018, University of Waterloo

 In this thesis, we study the capacitated generalization of the Matroid Median Problem which is a generalization of the classical clustering problem called the k-Median… (more)

Subjects/Keywords: Approximation algorithms; Matroid median; k-median; facility location; clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kalhan, S. (2018). The Capacitated Matroid Median Problem. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13331

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):

Kalhan, Sanchit. “The Capacitated Matroid Median Problem.” 2018. Thesis, University of Waterloo. Accessed June 19, 2019. http://hdl.handle.net/10012/13331.

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

MLA Handbook (7th Edition):

Kalhan, Sanchit. “The Capacitated Matroid Median Problem.” 2018. Web. 19 Jun 2019.

Vancouver:

Kalhan S. The Capacitated Matroid Median Problem. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/10012/13331.

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

Council of Science Editors:

Kalhan S. The Capacitated Matroid Median Problem. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13331

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

19. Sivakumar, Rohit. Approximation Algorithms for Min Sum k-Clustering and Balanced k-Median.

Degree: MS, Department of Computing Science, 2015, University of Alberta

 In this thesis, we consider two closely related clustering problems, Min Sum k-Clustering (MSkC) and Balanced k-Median (BkM). In Min Sum k-clustering, one is given… (more)

Subjects/Keywords: Clustering; Optimization; Approximation; Algorithms

…vi , vj ∈ V and i < j. 1.3 Approximation Algorithms Given a set of feasible solutions F… …these circumstances, we fall back to the approach of finding near-optimal algorithms to solve… …mathematically for every instance of the problem are called Approximation Algorithms. An approximation… …Approximation Scheme (PTAS) is a set of algorithms which takes an instance of an… …other words, these are problems which cannot have polynomial time approximation algorithms… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sivakumar, R. (2015). Approximation Algorithms for Min Sum k-Clustering and Balanced k-Median. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/rj430724q

Chicago Manual of Style (16th Edition):

Sivakumar, Rohit. “Approximation Algorithms for Min Sum k-Clustering and Balanced k-Median.” 2015. Masters Thesis, University of Alberta. Accessed June 19, 2019. https://era.library.ualberta.ca/files/rj430724q.

MLA Handbook (7th Edition):

Sivakumar, Rohit. “Approximation Algorithms for Min Sum k-Clustering and Balanced k-Median.” 2015. Web. 19 Jun 2019.

Vancouver:

Sivakumar R. Approximation Algorithms for Min Sum k-Clustering and Balanced k-Median. [Internet] [Masters thesis]. University of Alberta; 2015. [cited 2019 Jun 19]. Available from: https://era.library.ualberta.ca/files/rj430724q.

Council of Science Editors:

Sivakumar R. Approximation Algorithms for Min Sum k-Clustering and Balanced k-Median. [Masters Thesis]. University of Alberta; 2015. Available from: https://era.library.ualberta.ca/files/rj430724q


University of Pretoria

20. Labuschagne, Petrus Jacobus. Automatic clustering with application to time dependent fault detection in chemical processes.

Degree: Chemical Engineering, 2009, University of Pretoria

 Fault detection and diagnosis presents a big challenge within the petrochemical industry. The annual economic impact of unexpected shutdowns is estimated to be $20 billion.… (more)

Subjects/Keywords: Time delay estimation; Dimensional reduction; Clustering algorithms; Fault detection; UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Labuschagne, P. (2009). Automatic clustering with application to time dependent fault detection in chemical processes. (Masters Thesis). University of Pretoria. Retrieved from http://hdl.handle.net/2263/26092

Chicago Manual of Style (16th Edition):

Labuschagne, Petrus. “Automatic clustering with application to time dependent fault detection in chemical processes.” 2009. Masters Thesis, University of Pretoria. Accessed June 19, 2019. http://hdl.handle.net/2263/26092.

MLA Handbook (7th Edition):

Labuschagne, Petrus. “Automatic clustering with application to time dependent fault detection in chemical processes.” 2009. Web. 19 Jun 2019.

Vancouver:

Labuschagne P. Automatic clustering with application to time dependent fault detection in chemical processes. [Internet] [Masters thesis]. University of Pretoria; 2009. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/2263/26092.

Council of Science Editors:

Labuschagne P. Automatic clustering with application to time dependent fault detection in chemical processes. [Masters Thesis]. University of Pretoria; 2009. Available from: http://hdl.handle.net/2263/26092


Anna University

21. Ilango M R. Mining of projected clusters in high dimensional data using modified fuzzy C means algorithm.

Degree: Data mining, 2013, Anna University

Clustering is an important task in data mining. Data mining is the newlineprocess of extracting useful and hidden information from huge amount of newlinedata, which… (more)

Subjects/Keywords: algorithms; Clustering; data mining; density based; hierarchical; visualization techniques

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

R, I. M. (2013). Mining of projected clusters in high dimensional data using modified fuzzy C means algorithm. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/17537

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):

R, Ilango M. “Mining of projected clusters in high dimensional data using modified fuzzy C means algorithm.” 2013. Thesis, Anna University. Accessed June 19, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/17537.

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

MLA Handbook (7th Edition):

R, Ilango M. “Mining of projected clusters in high dimensional data using modified fuzzy C means algorithm.” 2013. Web. 19 Jun 2019.

Vancouver:

R IM. Mining of projected clusters in high dimensional data using modified fuzzy C means algorithm. [Internet] [Thesis]. Anna University; 2013. [cited 2019 Jun 19]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/17537.

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

Council of Science Editors:

R IM. Mining of projected clusters in high dimensional data using modified fuzzy C means algorithm. [Thesis]. Anna University; 2013. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/17537

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


NSYSU

22. Wang, Po-Cheng. Automatic Attribute Clustering and Feature Selection Based on Genetic Algorithms.

Degree: Master, Computer Science and Engineering, 2009, NSYSU

 Feature selection is an important pre-processing step in mining and learning. A good set of features can not only improve the accuracy of classification, but… (more)

Subjects/Keywords: k-means; reduct; genetic algorithms; feature clustering; feature selection

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, P. (2009). Automatic Attribute Clustering and Feature Selection Based on Genetic Algorithms. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0821109-092325

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):

Wang, Po-Cheng. “Automatic Attribute Clustering and Feature Selection Based on Genetic Algorithms.” 2009. Thesis, NSYSU. Accessed June 19, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0821109-092325.

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

MLA Handbook (7th Edition):

Wang, Po-Cheng. “Automatic Attribute Clustering and Feature Selection Based on Genetic Algorithms.” 2009. Web. 19 Jun 2019.

Vancouver:

Wang P. Automatic Attribute Clustering and Feature Selection Based on Genetic Algorithms. [Internet] [Thesis]. NSYSU; 2009. [cited 2019 Jun 19]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0821109-092325.

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

Council of Science Editors:

Wang P. Automatic Attribute Clustering and Feature Selection Based on Genetic Algorithms. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0821109-092325

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


University of Pretoria

23. [No author]. Automatic clustering with application to time dependent fault detection in chemical processes .

Degree: 2009, University of Pretoria

 Fault detection and diagnosis presents a big challenge within the petrochemical industry. The annual economic impact of unexpected shutdowns is estimated to be $20 billion.… (more)

Subjects/Keywords: Time delay estimation; Dimensional reduction; Clustering algorithms; Fault detection; UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

author], [. (2009). Automatic clustering with application to time dependent fault detection in chemical processes . (Masters Thesis). University of Pretoria. Retrieved from http://upetd.up.ac.za/thesis/available/etd-07062009-142237/

Chicago Manual of Style (16th Edition):

author], [No. “Automatic clustering with application to time dependent fault detection in chemical processes .” 2009. Masters Thesis, University of Pretoria. Accessed June 19, 2019. http://upetd.up.ac.za/thesis/available/etd-07062009-142237/.

MLA Handbook (7th Edition):

author], [No. “Automatic clustering with application to time dependent fault detection in chemical processes .” 2009. Web. 19 Jun 2019.

Vancouver:

author] [. Automatic clustering with application to time dependent fault detection in chemical processes . [Internet] [Masters thesis]. University of Pretoria; 2009. [cited 2019 Jun 19]. Available from: http://upetd.up.ac.za/thesis/available/etd-07062009-142237/.

Council of Science Editors:

author] [. Automatic clustering with application to time dependent fault detection in chemical processes . [Masters Thesis]. University of Pretoria; 2009. Available from: http://upetd.up.ac.za/thesis/available/etd-07062009-142237/


Georgia Tech

24. Fairbanks, James Paul. Graph analysis combining numerical, statistical, and streaming techniques.

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

 Graph analysis uses graph data collected on a physical, biological, or social phenomena to shed light on the underlying dynamics and behavior of the agents… (more)

Subjects/Keywords: Graph analysis; Graph algorithms; Data analysis; Spectral clustering; Numerical analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fairbanks, J. P. (2016). Graph analysis combining numerical, statistical, and streaming techniques. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/54972

Chicago Manual of Style (16th Edition):

Fairbanks, James Paul. “Graph analysis combining numerical, statistical, and streaming techniques.” 2016. Doctoral Dissertation, Georgia Tech. Accessed June 19, 2019. http://hdl.handle.net/1853/54972.

MLA Handbook (7th Edition):

Fairbanks, James Paul. “Graph analysis combining numerical, statistical, and streaming techniques.” 2016. Web. 19 Jun 2019.

Vancouver:

Fairbanks JP. Graph analysis combining numerical, statistical, and streaming techniques. [Internet] [Doctoral dissertation]. Georgia Tech; 2016. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/1853/54972.

Council of Science Editors:

Fairbanks JP. Graph analysis combining numerical, statistical, and streaming techniques. [Doctoral Dissertation]. Georgia Tech; 2016. Available from: http://hdl.handle.net/1853/54972


University of Tennessee – Knoxville

25. Phillips, Charles Alexander. Multipartite Graph Algorithms for the Analysis of Heterogeneous Data.

Degree: 2015, University of Tennessee – Knoxville

 The explosive growth in the rate of data generation in recent years threatens to outpace the growth in computer power, motivating the need for new,… (more)

Subjects/Keywords: graph algorithms; combinatorics; clustering; multipartite; biclique; Computational Biology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Phillips, C. A. (2015). Multipartite Graph Algorithms for the Analysis of Heterogeneous Data. (Doctoral Dissertation). University of Tennessee – Knoxville. Retrieved from https://trace.tennessee.edu/utk_graddiss/3600

Chicago Manual of Style (16th Edition):

Phillips, Charles Alexander. “Multipartite Graph Algorithms for the Analysis of Heterogeneous Data.” 2015. Doctoral Dissertation, University of Tennessee – Knoxville. Accessed June 19, 2019. https://trace.tennessee.edu/utk_graddiss/3600.

MLA Handbook (7th Edition):

Phillips, Charles Alexander. “Multipartite Graph Algorithms for the Analysis of Heterogeneous Data.” 2015. Web. 19 Jun 2019.

Vancouver:

Phillips CA. Multipartite Graph Algorithms for the Analysis of Heterogeneous Data. [Internet] [Doctoral dissertation]. University of Tennessee – Knoxville; 2015. [cited 2019 Jun 19]. Available from: https://trace.tennessee.edu/utk_graddiss/3600.

Council of Science Editors:

Phillips CA. Multipartite Graph Algorithms for the Analysis of Heterogeneous Data. [Doctoral Dissertation]. University of Tennessee – Knoxville; 2015. Available from: https://trace.tennessee.edu/utk_graddiss/3600

26. Quddus, Syed. Accurate and efficient clustering algorithms for very large data sets.

Degree: PhD, 2017, Federation University Australia

The ability to mine and extract useful information from large data sets is a common concern for organizations. Data over the internet is rapidly increasing… (more)

Subjects/Keywords: Clustering algorithms; Very large data sets; Data mining

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Quddus, S. (2017). Accurate and efficient clustering algorithms for very large data sets. (Doctoral Dissertation). Federation University Australia. Retrieved from http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/162586

Chicago Manual of Style (16th Edition):

Quddus, Syed. “Accurate and efficient clustering algorithms for very large data sets.” 2017. Doctoral Dissertation, Federation University Australia. Accessed June 19, 2019. http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/162586.

MLA Handbook (7th Edition):

Quddus, Syed. “Accurate and efficient clustering algorithms for very large data sets.” 2017. Web. 19 Jun 2019.

Vancouver:

Quddus S. Accurate and efficient clustering algorithms for very large data sets. [Internet] [Doctoral dissertation]. Federation University Australia; 2017. [cited 2019 Jun 19]. Available from: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/162586.

Council of Science Editors:

Quddus S. Accurate and efficient clustering algorithms for very large data sets. [Doctoral Dissertation]. Federation University Australia; 2017. Available from: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/162586

27. Draycott, Samuel Thomas. On the re-creation of site-specific directional wave conditions.

Degree: PhD, 2017, University of Edinburgh

 Wave tank tests facilitate the understanding of how complex sea conditions influence the dynamics of man-made structures. If a potential deployment location is known, site… (more)

Subjects/Keywords: simulations; buoy data; FloWave; clustering algorithms; directional spectrum reconstruction; test environments

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Draycott, S. T. (2017). On the re-creation of site-specific directional wave conditions. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/31472

Chicago Manual of Style (16th Edition):

Draycott, Samuel Thomas. “On the re-creation of site-specific directional wave conditions.” 2017. Doctoral Dissertation, University of Edinburgh. Accessed June 19, 2019. http://hdl.handle.net/1842/31472.

MLA Handbook (7th Edition):

Draycott, Samuel Thomas. “On the re-creation of site-specific directional wave conditions.” 2017. Web. 19 Jun 2019.

Vancouver:

Draycott ST. On the re-creation of site-specific directional wave conditions. [Internet] [Doctoral dissertation]. University of Edinburgh; 2017. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/1842/31472.

Council of Science Editors:

Draycott ST. On the re-creation of site-specific directional wave conditions. [Doctoral Dissertation]. University of Edinburgh; 2017. Available from: http://hdl.handle.net/1842/31472


IUPUI

28. Huang, Zhi. Vehicle sensor-based pedestrian position identification in V2V environment.

Degree: 2016, IUPUI

Indiana University-Purdue University Indianapolis (IUPUI)

This thesis presents a method to accurately determine the location and amount of pedestrians detected by different vehicles equipped with… (more)

Subjects/Keywords: Clustering methods; Greedy algorithms; Intelligent vehicles; Mathematical model; Vehicle detection

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huang, Z. (2016). Vehicle sensor-based pedestrian position identification in V2V environment. (Thesis). IUPUI. Retrieved from http://hdl.handle.net/1805/11825

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):

Huang, Zhi. “Vehicle sensor-based pedestrian position identification in V2V environment.” 2016. Thesis, IUPUI. Accessed June 19, 2019. http://hdl.handle.net/1805/11825.

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

MLA Handbook (7th Edition):

Huang, Zhi. “Vehicle sensor-based pedestrian position identification in V2V environment.” 2016. Web. 19 Jun 2019.

Vancouver:

Huang Z. Vehicle sensor-based pedestrian position identification in V2V environment. [Internet] [Thesis]. IUPUI; 2016. [cited 2019 Jun 19]. Available from: http://hdl.handle.net/1805/11825.

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

Council of Science Editors:

Huang Z. Vehicle sensor-based pedestrian position identification in V2V environment. [Thesis]. IUPUI; 2016. Available from: http://hdl.handle.net/1805/11825

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


University of Connecticut

29. Periaswamy, Priya. A Novel Clustering Technique to Identify Chemicals.

Degree: MS, Computer Science and Engineering, 2014, University of Connecticut

  Chemical detection is an important problem especially in the context of homeland security. We have designed an efficient algorithm to process complex multidimensional data… (more)

Subjects/Keywords: Clustering; Chemical detection; harmful chemicals; k-means; chemical defense; detection algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Periaswamy, P. (2014). A Novel Clustering Technique to Identify Chemicals. (Masters Thesis). University of Connecticut. Retrieved from https://opencommons.uconn.edu/gs_theses/660

Chicago Manual of Style (16th Edition):

Periaswamy, Priya. “A Novel Clustering Technique to Identify Chemicals.” 2014. Masters Thesis, University of Connecticut. Accessed June 19, 2019. https://opencommons.uconn.edu/gs_theses/660.

MLA Handbook (7th Edition):

Periaswamy, Priya. “A Novel Clustering Technique to Identify Chemicals.” 2014. Web. 19 Jun 2019.

Vancouver:

Periaswamy P. A Novel Clustering Technique to Identify Chemicals. [Internet] [Masters thesis]. University of Connecticut; 2014. [cited 2019 Jun 19]. Available from: https://opencommons.uconn.edu/gs_theses/660.

Council of Science Editors:

Periaswamy P. A Novel Clustering Technique to Identify Chemicals. [Masters Thesis]. University of Connecticut; 2014. Available from: https://opencommons.uconn.edu/gs_theses/660


San Jose State University

30. Murali, Mrudula. Online Local Communities.

Degree: MS, Computer Science, 2019, San Jose State University

  A community in a network is a group of nodes that are densely and closely connected to each other, get sparsely connected to the… (more)

Subjects/Keywords: Community detection; Local graph clustering; Online com- munity; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Murali, M. (2019). Online Local Communities. (Masters Thesis). San Jose State University. Retrieved from https://scholarworks.sjsu.edu/etd_projects/723

Chicago Manual of Style (16th Edition):

Murali, Mrudula. “Online Local Communities.” 2019. Masters Thesis, San Jose State University. Accessed June 19, 2019. https://scholarworks.sjsu.edu/etd_projects/723.

MLA Handbook (7th Edition):

Murali, Mrudula. “Online Local Communities.” 2019. Web. 19 Jun 2019.

Vancouver:

Murali M. Online Local Communities. [Internet] [Masters thesis]. San Jose State University; 2019. [cited 2019 Jun 19]. Available from: https://scholarworks.sjsu.edu/etd_projects/723.

Council of Science Editors:

Murali M. Online Local Communities. [Masters Thesis]. San Jose State University; 2019. Available from: https://scholarworks.sjsu.edu/etd_projects/723

[1] [2] [3] [4] [5] [6] [7]

.