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:(Data Mining Algorithms). Showing records 1 – 30 of 212 total matches.

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

Search Limiters

Last 2 Years | English Only

Levels

Languages

Country

▼ Search Limiters


University of Oklahoma

1. Sadik, Shiblee. Online Detection of Outliers for Data Streams.

Degree: PhD, 2013, University of Oklahoma

 Extensive theoretical and empirical analyses have been conducted to evaluate the performance of Orion and Wadjet using real and synthetic datasets. The evaluation results show… (more)

Subjects/Keywords: Outliers (Statistics); Algorithms; Data mining

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sadik, S. (2013). Online Detection of Outliers for Data Streams. (Doctoral Dissertation). University of Oklahoma. Retrieved from http://hdl.handle.net/11244/320199

Chicago Manual of Style (16th Edition):

Sadik, Shiblee. “Online Detection of Outliers for Data Streams.” 2013. Doctoral Dissertation, University of Oklahoma. Accessed October 26, 2020. http://hdl.handle.net/11244/320199.

MLA Handbook (7th Edition):

Sadik, Shiblee. “Online Detection of Outliers for Data Streams.” 2013. Web. 26 Oct 2020.

Vancouver:

Sadik S. Online Detection of Outliers for Data Streams. [Internet] [Doctoral dissertation]. University of Oklahoma; 2013. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/11244/320199.

Council of Science Editors:

Sadik S. Online Detection of Outliers for Data Streams. [Doctoral Dissertation]. University of Oklahoma; 2013. Available from: http://hdl.handle.net/11244/320199


NSYSU

2. Lo , Huan-Chun. Development of a software for obtaining optimized solution of engineering problems by using Artificial Neural Network Algorithms and Genetic Algorithms.

Degree: Master, Mechanical and Electro-Mechanical Engineering, 2017, NSYSU

 In recent years, due to the rapid development of computational science, hardware and software of computer, and the internet, the amount of information collected in… (more)

Subjects/Keywords: Big Data; Artificial Neural Network Algorithms; Genetic Algorithms; Optimization; Data Mining

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lo , H. (2017). Development of a software for obtaining optimized solution of engineering problems by using Artificial Neural Network Algorithms and Genetic Algorithms. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0724117-200159

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

Lo , Huan-Chun. “Development of a software for obtaining optimized solution of engineering problems by using Artificial Neural Network Algorithms and Genetic Algorithms.” 2017. Thesis, NSYSU. Accessed October 26, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0724117-200159.

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

MLA Handbook (7th Edition):

Lo , Huan-Chun. “Development of a software for obtaining optimized solution of engineering problems by using Artificial Neural Network Algorithms and Genetic Algorithms.” 2017. Web. 26 Oct 2020.

Vancouver:

Lo H. Development of a software for obtaining optimized solution of engineering problems by using Artificial Neural Network Algorithms and Genetic Algorithms. [Internet] [Thesis]. NSYSU; 2017. [cited 2020 Oct 26]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0724117-200159.

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

Council of Science Editors:

Lo H. Development of a software for obtaining optimized solution of engineering problems by using Artificial Neural Network Algorithms and Genetic Algorithms. [Thesis]. NSYSU; 2017. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0724117-200159

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


Iowa State University

3. Mousavi Hanjani, Kiana. Improved triangle counting in graph streams: Neighborhood multi-sampling.

Degree: 2018, Iowa State University

 In this thesis, we study the problem of estimating the number of triangles of an undirected graph in the data stream model. Some of the… (more)

Subjects/Keywords: big data; data mining; graph mining; streaming algorithms; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mousavi Hanjani, K. (2018). Improved triangle counting in graph streams: Neighborhood multi-sampling. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/16644

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

Mousavi Hanjani, Kiana. “Improved triangle counting in graph streams: Neighborhood multi-sampling.” 2018. Thesis, Iowa State University. Accessed October 26, 2020. https://lib.dr.iastate.edu/etd/16644.

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

MLA Handbook (7th Edition):

Mousavi Hanjani, Kiana. “Improved triangle counting in graph streams: Neighborhood multi-sampling.” 2018. Web. 26 Oct 2020.

Vancouver:

Mousavi Hanjani K. Improved triangle counting in graph streams: Neighborhood multi-sampling. [Internet] [Thesis]. Iowa State University; 2018. [cited 2020 Oct 26]. Available from: https://lib.dr.iastate.edu/etd/16644.

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

Council of Science Editors:

Mousavi Hanjani K. Improved triangle counting in graph streams: Neighborhood multi-sampling. [Thesis]. Iowa State University; 2018. Available from: https://lib.dr.iastate.edu/etd/16644

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


University of Hong Kong

4. 崔俊傑. Mining frequent itemsets and order preserving submatrices from uncertain data.

Degree: 2007, University of Hong Kong

Subjects/Keywords: Algorithms; Data mining.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

崔俊傑. (2007). Mining frequent itemsets and order preserving submatrices from uncertain data. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/50799

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

Chicago Manual of Style (16th Edition):

崔俊傑. “Mining frequent itemsets and order preserving submatrices from uncertain data.” 2007. Thesis, University of Hong Kong. Accessed October 26, 2020. http://hdl.handle.net/10722/50799.

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

MLA Handbook (7th Edition):

崔俊傑. “Mining frequent itemsets and order preserving submatrices from uncertain data.” 2007. Web. 26 Oct 2020.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

崔俊傑. Mining frequent itemsets and order preserving submatrices from uncertain data. [Internet] [Thesis]. University of Hong Kong; 2007. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/10722/50799.

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

Council of Science Editors:

崔俊傑. Mining frequent itemsets and order preserving submatrices from uncertain data. [Thesis]. University of Hong Kong; 2007. Available from: http://hdl.handle.net/10722/50799

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


University of Hong Kong

5. 景麗萍. Text subspace clustering with feature weighting and ontologies.

Degree: 2007, University of Hong Kong

Subjects/Keywords: Data mining.; Algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

景麗萍.. (2007). Text subspace clustering with feature weighting and ontologies. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/51856

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

Chicago Manual of Style (16th Edition):

景麗萍.. “Text subspace clustering with feature weighting and ontologies.” 2007. Thesis, University of Hong Kong. Accessed October 26, 2020. http://hdl.handle.net/10722/51856.

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

MLA Handbook (7th Edition):

景麗萍.. “Text subspace clustering with feature weighting and ontologies.” 2007. Web. 26 Oct 2020.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

景麗萍.. Text subspace clustering with feature weighting and ontologies. [Internet] [Thesis]. University of Hong Kong; 2007. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/10722/51856.

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

Council of Science Editors:

景麗萍.. Text subspace clustering with feature weighting and ontologies. [Thesis]. University of Hong Kong; 2007. Available from: http://hdl.handle.net/10722/51856

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


University of Hong Kong

6. Hung, Yee-shing, Regant. The complexities of tracking quantiles and frequent items in a data stream.

Degree: 2009, University of Hong Kong

Subjects/Keywords: Algorithms.; Data mining.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hung, Yee-shing, R. (2009). The complexities of tracking quantiles and frequent items in a data stream. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/54683

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

Hung, Yee-shing, Regant. “The complexities of tracking quantiles and frequent items in a data stream.” 2009. Thesis, University of Hong Kong. Accessed October 26, 2020. http://hdl.handle.net/10722/54683.

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

MLA Handbook (7th Edition):

Hung, Yee-shing, Regant. “The complexities of tracking quantiles and frequent items in a data stream.” 2009. Web. 26 Oct 2020.

Vancouver:

Hung, Yee-shing R. The complexities of tracking quantiles and frequent items in a data stream. [Internet] [Thesis]. University of Hong Kong; 2009. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/10722/54683.

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

Council of Science Editors:

Hung, Yee-shing R. The complexities of tracking quantiles and frequent items in a data stream. [Thesis]. University of Hong Kong; 2009. Available from: http://hdl.handle.net/10722/54683

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


University of Hong Kong

7. 张问. Design and analysis of efficient algorithms for finding frequent itemsin a data stream.

Degree: 2011, University of Hong Kong

Subjects/Keywords: Data mining.; Algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

张问. (2011). Design and analysis of efficient algorithms for finding frequent itemsin a data stream. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/133279

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

Chicago Manual of Style (16th Edition):

张问. “Design and analysis of efficient algorithms for finding frequent itemsin a data stream.” 2011. Thesis, University of Hong Kong. Accessed October 26, 2020. http://hdl.handle.net/10722/133279.

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

MLA Handbook (7th Edition):

张问. “Design and analysis of efficient algorithms for finding frequent itemsin a data stream.” 2011. Web. 26 Oct 2020.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

张问. Design and analysis of efficient algorithms for finding frequent itemsin a data stream. [Internet] [Thesis]. University of Hong Kong; 2011. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/10722/133279.

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

Council of Science Editors:

张问. Design and analysis of efficient algorithms for finding frequent itemsin a data stream. [Thesis]. University of Hong Kong; 2011. Available from: http://hdl.handle.net/10722/133279

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


Anna University

8. 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 October 26, 2020. 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. 26 Oct 2020.

Vancouver:

Prabhu P. An Efficient Visual Approach For Automatic Clustering And Validation;. [Internet] [Thesis]. Anna University; 2013. [cited 2020 Oct 26]. 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


University of Hong Kong

9. 林弘. Finding frequent itemsets over bursty data streams.

Degree: 2005, University of Hong Kong

Subjects/Keywords: Algorithms.; Data mining.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

林弘.. (2005). Finding frequent itemsets over bursty data streams. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/25699

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

Chicago Manual of Style (16th Edition):

林弘.. “Finding frequent itemsets over bursty data streams.” 2005. Thesis, University of Hong Kong. Accessed October 26, 2020. http://hdl.handle.net/10722/25699.

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

MLA Handbook (7th Edition):

林弘.. “Finding frequent itemsets over bursty data streams.” 2005. Web. 26 Oct 2020.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

林弘.. Finding frequent itemsets over bursty data streams. [Internet] [Thesis]. University of Hong Kong; 2005. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/10722/25699.

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

Council of Science Editors:

林弘.. Finding frequent itemsets over bursty data streams. [Thesis]. University of Hong Kong; 2005. Available from: http://hdl.handle.net/10722/25699

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


Virginia Tech

10. Cadena, Jose Eduardo. Finding Interesting Subgraphs with Guarantees.

Degree: PhD, Computer Science and Applications, 2018, Virginia Tech

 Networks are a mathematical abstraction of the interactions between a set of entities, with extensive applications in social science, epidemiology, bioinformatics, and cybersecurity, among others.… (more)

Subjects/Keywords: Graph Mining; Data Mining; Graph Algorithms; Anomaly Detection; Finding Subgraphs; Parameterized Complexity; Distributed Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cadena, J. E. (2018). Finding Interesting Subgraphs with Guarantees. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/81960

Chicago Manual of Style (16th Edition):

Cadena, Jose Eduardo. “Finding Interesting Subgraphs with Guarantees.” 2018. Doctoral Dissertation, Virginia Tech. Accessed October 26, 2020. http://hdl.handle.net/10919/81960.

MLA Handbook (7th Edition):

Cadena, Jose Eduardo. “Finding Interesting Subgraphs with Guarantees.” 2018. Web. 26 Oct 2020.

Vancouver:

Cadena JE. Finding Interesting Subgraphs with Guarantees. [Internet] [Doctoral dissertation]. Virginia Tech; 2018. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/10919/81960.

Council of Science Editors:

Cadena JE. Finding Interesting Subgraphs with Guarantees. [Doctoral Dissertation]. Virginia Tech; 2018. Available from: http://hdl.handle.net/10919/81960


University of Toronto

11. PAPANGELIS, EMMANOUIL. Understanding and Improving Online Social Interactions and Processes: Methods, Algorithms Applications.

Degree: PhD, 2015, University of Toronto

 Over the last years, the web witnesses a prolific growth largely due to the changing trends in the use of web technology that aims to… (more)

Subjects/Keywords: algorithms; data mining; graph mining; information network mining; knowledge discovery; online social media; 0984

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

PAPANGELIS, E. (2015). Understanding and Improving Online Social Interactions and Processes: Methods, Algorithms Applications. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/69468

Chicago Manual of Style (16th Edition):

PAPANGELIS, EMMANOUIL. “Understanding and Improving Online Social Interactions and Processes: Methods, Algorithms Applications.” 2015. Doctoral Dissertation, University of Toronto. Accessed October 26, 2020. http://hdl.handle.net/1807/69468.

MLA Handbook (7th Edition):

PAPANGELIS, EMMANOUIL. “Understanding and Improving Online Social Interactions and Processes: Methods, Algorithms Applications.” 2015. Web. 26 Oct 2020.

Vancouver:

PAPANGELIS E. Understanding and Improving Online Social Interactions and Processes: Methods, Algorithms Applications. [Internet] [Doctoral dissertation]. University of Toronto; 2015. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/1807/69468.

Council of Science Editors:

PAPANGELIS E. Understanding and Improving Online Social Interactions and Processes: Methods, Algorithms Applications. [Doctoral Dissertation]. University of Toronto; 2015. Available from: http://hdl.handle.net/1807/69468


NSYSU

12. Pan, Bo-Hong. Reliability Analysis and Multi-objective Optimization for Electronic Packaging by using Artificial Neural Network Algorithms and Genetic Algorithms.

Degree: Master, Mechanical and Electro-Mechanical Engineering, 2018, NSYSU

 In recent years, due to the rapid development of computational science, software, and the internet, the popularity of storage device and high-capacity make the computational… (more)

Subjects/Keywords: Artificial Neural Network Algorithms; Genetic Algorithms; Multi-objective Optimization; Big Data; Data Mining Procedure

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pan, B. (2018). Reliability Analysis and Multi-objective Optimization for Electronic Packaging by using Artificial Neural Network Algorithms and Genetic Algorithms. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0804118-162733

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

Pan, Bo-Hong. “Reliability Analysis and Multi-objective Optimization for Electronic Packaging by using Artificial Neural Network Algorithms and Genetic Algorithms.” 2018. Thesis, NSYSU. Accessed October 26, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0804118-162733.

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

MLA Handbook (7th Edition):

Pan, Bo-Hong. “Reliability Analysis and Multi-objective Optimization for Electronic Packaging by using Artificial Neural Network Algorithms and Genetic Algorithms.” 2018. Web. 26 Oct 2020.

Vancouver:

Pan B. Reliability Analysis and Multi-objective Optimization for Electronic Packaging by using Artificial Neural Network Algorithms and Genetic Algorithms. [Internet] [Thesis]. NSYSU; 2018. [cited 2020 Oct 26]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0804118-162733.

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

Council of Science Editors:

Pan B. Reliability Analysis and Multi-objective Optimization for Electronic Packaging by using Artificial Neural Network Algorithms and Genetic Algorithms. [Thesis]. NSYSU; 2018. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0804118-162733

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


Ryerson University

13. Zheng, Bohan. Growing self-organizing tree-based kernel smoother for machine learning and data mining.

Degree: 2016, Ryerson University

 With Internet of Things (IoT) being prevalently adopted in recent years, traditional machine learning and data mining methods can hardly be competent to deal with… (more)

Subjects/Keywords: Big data; Machine learning; Internet of things; Data mining; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zheng, B. (2016). Growing self-organizing tree-based kernel smoother for machine learning and data mining. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A5783

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

Zheng, Bohan. “Growing self-organizing tree-based kernel smoother for machine learning and data mining.” 2016. Thesis, Ryerson University. Accessed October 26, 2020. https://digital.library.ryerson.ca/islandora/object/RULA%3A5783.

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

MLA Handbook (7th Edition):

Zheng, Bohan. “Growing self-organizing tree-based kernel smoother for machine learning and data mining.” 2016. Web. 26 Oct 2020.

Vancouver:

Zheng B. Growing self-organizing tree-based kernel smoother for machine learning and data mining. [Internet] [Thesis]. Ryerson University; 2016. [cited 2020 Oct 26]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A5783.

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

Council of Science Editors:

Zheng B. Growing self-organizing tree-based kernel smoother for machine learning and data mining. [Thesis]. Ryerson University; 2016. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A5783

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

14. Zhong, Wenliang. Efficient structured regularization with proximal algorithms.

Degree: 2014, Hong Kong University of Science and Technology

 Modern data arising from various domains, such as audio, image and text, are often high-dimensional and contain spurious features with various structures. In most cases,… (more)

Subjects/Keywords: Electronic data processing ; Mathematical models ; Data mining ; Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhong, W. (2014). Efficient structured regularization with proximal algorithms. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-70935 ; https://doi.org/10.14711/thesis-b1333673 ; http://repository.ust.hk/ir/bitstream/1783.1-70935/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):

Zhong, Wenliang. “Efficient structured regularization with proximal algorithms.” 2014. Thesis, Hong Kong University of Science and Technology. Accessed October 26, 2020. http://repository.ust.hk/ir/Record/1783.1-70935 ; https://doi.org/10.14711/thesis-b1333673 ; http://repository.ust.hk/ir/bitstream/1783.1-70935/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):

Zhong, Wenliang. “Efficient structured regularization with proximal algorithms.” 2014. Web. 26 Oct 2020.

Vancouver:

Zhong W. Efficient structured regularization with proximal algorithms. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2014. [cited 2020 Oct 26]. Available from: http://repository.ust.hk/ir/Record/1783.1-70935 ; https://doi.org/10.14711/thesis-b1333673 ; http://repository.ust.hk/ir/bitstream/1783.1-70935/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:

Zhong W. Efficient structured regularization with proximal algorithms. [Thesis]. Hong Kong University of Science and Technology; 2014. Available from: http://repository.ust.hk/ir/Record/1783.1-70935 ; https://doi.org/10.14711/thesis-b1333673 ; http://repository.ust.hk/ir/bitstream/1783.1-70935/1/th_redirect.html

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

15. 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 ; https://library.federation.edu.au/record=b2746800

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 October 26, 2020. http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/162586 ; https://library.federation.edu.au/record=b2746800.

MLA Handbook (7th Edition):

Quddus, Syed. “Accurate and efficient clustering algorithms for very large data sets.” 2017. Web. 26 Oct 2020.

Vancouver:

Quddus S. Accurate and efficient clustering algorithms for very large data sets. [Internet] [Doctoral dissertation]. Federation University Australia; 2017. [cited 2020 Oct 26]. Available from: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/162586 ; https://library.federation.edu.au/record=b2746800.

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 ; https://library.federation.edu.au/record=b2746800


Texas State University – San Marcos

16. Nagarajan, Arthi. Data-transformation algorithms for minimizing bit flips on GPU data buses.

Degree: MS, Computer Science, 2017, Texas State University – San Marcos

 Excessive power consumption and cooling costs in computing centers as well as limited battery life in mobile devices make energy optimization an important area of… (more)

Subjects/Keywords: Bit-flips; Data-transformation algorithms; Data mining; Database management

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nagarajan, A. (2017). Data-transformation algorithms for minimizing bit flips on GPU data buses. (Masters Thesis). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/7725

Chicago Manual of Style (16th Edition):

Nagarajan, Arthi. “Data-transformation algorithms for minimizing bit flips on GPU data buses.” 2017. Masters Thesis, Texas State University – San Marcos. Accessed October 26, 2020. https://digital.library.txstate.edu/handle/10877/7725.

MLA Handbook (7th Edition):

Nagarajan, Arthi. “Data-transformation algorithms for minimizing bit flips on GPU data buses.” 2017. Web. 26 Oct 2020.

Vancouver:

Nagarajan A. Data-transformation algorithms for minimizing bit flips on GPU data buses. [Internet] [Masters thesis]. Texas State University – San Marcos; 2017. [cited 2020 Oct 26]. Available from: https://digital.library.txstate.edu/handle/10877/7725.

Council of Science Editors:

Nagarajan A. Data-transformation algorithms for minimizing bit flips on GPU data buses. [Masters Thesis]. Texas State University – San Marcos; 2017. Available from: https://digital.library.txstate.edu/handle/10877/7725


Vilnius University

17. Stravinskienė, Auksė. Duomenų gavybos metodika.

Degree: Master, 2014, Vilnius University

Duomenų gavybos sistemos apibūdinamos kaip žinios, kurios pasinaudojant įvairiais statistiniais, matematiniais, modelių atpažinimo metodais yra apibendrinamos ir tinkamai apdorojamos. Pasinaudojant duomenų gavybos technologijomis ieškoma naujų… (more)

Subjects/Keywords: Duomenų gavyba; Metodika; Duomenų gavybos algoritmai; Data mining; Methodology of data mining; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Stravinskienė, Auksė. (2014). Duomenų gavybos metodika. (Masters Thesis). Vilnius University. Retrieved from http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2008~D_20140623_182557-55303 ;

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16th Edition):

Stravinskienė, Auksė. “Duomenų gavybos metodika.” 2014. Masters Thesis, Vilnius University. Accessed October 26, 2020. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2008~D_20140623_182557-55303 ;.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7th Edition):

Stravinskienė, Auksė. “Duomenų gavybos metodika.” 2014. Web. 26 Oct 2020.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

Stravinskienė, Auksė. Duomenų gavybos metodika. [Internet] [Masters thesis]. Vilnius University; 2014. [cited 2020 Oct 26]. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2008~D_20140623_182557-55303 ;.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

Stravinskienė, Auksė. Duomenų gavybos metodika. [Masters Thesis]. Vilnius University; 2014. Available from: http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2008~D_20140623_182557-55303 ;

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete


University of Waterloo

18. Helwa, Ahmed Khairy Farahat. Greedy Representative Selection for Unsupervised Data Analysis.

Degree: 2013, University of Waterloo

 In recent years, the advance of information and communication technologies has allowed the storage and transfer of massive amounts of data. The availability of this… (more)

Subjects/Keywords: Data Mining; Machine Learning; Unsupervised Data Analysis; Greedy Algorithms; Representative Selection; Feature Selection; Data Clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Helwa, A. K. F. (2013). Greedy Representative Selection for Unsupervised Data Analysis. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/7270

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

Helwa, Ahmed Khairy Farahat. “Greedy Representative Selection for Unsupervised Data Analysis.” 2013. Thesis, University of Waterloo. Accessed October 26, 2020. http://hdl.handle.net/10012/7270.

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

MLA Handbook (7th Edition):

Helwa, Ahmed Khairy Farahat. “Greedy Representative Selection for Unsupervised Data Analysis.” 2013. Web. 26 Oct 2020.

Vancouver:

Helwa AKF. Greedy Representative Selection for Unsupervised Data Analysis. [Internet] [Thesis]. University of Waterloo; 2013. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/10012/7270.

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

Council of Science Editors:

Helwa AKF. Greedy Representative Selection for Unsupervised Data Analysis. [Thesis]. University of Waterloo; 2013. Available from: http://hdl.handle.net/10012/7270

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


Penn State University

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

Degree: 2008, 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. (2008). Data Cleaning Techniques by means of Entity Resolution. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/7797

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

On, Byung-Won. “Data Cleaning Techniques by means of Entity Resolution.” 2008. Thesis, Penn State University. Accessed October 26, 2020. https://submit-etda.libraries.psu.edu/catalog/7797.

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

MLA Handbook (7th Edition):

On, Byung-Won. “Data Cleaning Techniques by means of Entity Resolution.” 2008. Web. 26 Oct 2020.

Vancouver:

On B. Data Cleaning Techniques by means of Entity Resolution. [Internet] [Thesis]. Penn State University; 2008. [cited 2020 Oct 26]. Available from: https://submit-etda.libraries.psu.edu/catalog/7797.

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

Council of Science Editors:

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

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

20. Ogaard, Kirk Anders. Mining Aircraft Telemetry Data With Evolutionary Algorithms.

Degree: PhD, Computer Science, 2012, University of North Dakota

  The Ganged Phased Array Radar - Risk Mitigation System (GPAR-RMS) was a mobile ground-based sense-and-avoid system for Unmanned Aircraft System (UAS) operations developed by… (more)

Subjects/Keywords: ant colony algorithms; collision avoidance; data mining; genetic algorithms; K-means algorithm; unmanned aircraft

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ogaard, K. A. (2012). Mining Aircraft Telemetry Data With Evolutionary Algorithms. (Doctoral Dissertation). University of North Dakota. Retrieved from https://commons.und.edu/theses/1262

Chicago Manual of Style (16th Edition):

Ogaard, Kirk Anders. “Mining Aircraft Telemetry Data With Evolutionary Algorithms.” 2012. Doctoral Dissertation, University of North Dakota. Accessed October 26, 2020. https://commons.und.edu/theses/1262.

MLA Handbook (7th Edition):

Ogaard, Kirk Anders. “Mining Aircraft Telemetry Data With Evolutionary Algorithms.” 2012. Web. 26 Oct 2020.

Vancouver:

Ogaard KA. Mining Aircraft Telemetry Data With Evolutionary Algorithms. [Internet] [Doctoral dissertation]. University of North Dakota; 2012. [cited 2020 Oct 26]. Available from: https://commons.und.edu/theses/1262.

Council of Science Editors:

Ogaard KA. Mining Aircraft Telemetry Data With Evolutionary Algorithms. [Doctoral Dissertation]. University of North Dakota; 2012. Available from: https://commons.und.edu/theses/1262


Universiteit Utrecht

21. Schuiling, N.H. Scalable Frequent Pattern Mining using Relational Databases.

Degree: 2014, Universiteit Utrecht

 Frequent pattern mining is a computationally expensive preprocessing step for association rule mining and involves major challenges when data sets are large. Many sophisticated algorithms(more)

Subjects/Keywords: frequent pattern mining; data mining; fp-growth; databases; query processing; top-k; distributed algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schuiling, N. H. (2014). Scalable Frequent Pattern Mining using Relational Databases. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/298560

Chicago Manual of Style (16th Edition):

Schuiling, N H. “Scalable Frequent Pattern Mining using Relational Databases.” 2014. Masters Thesis, Universiteit Utrecht. Accessed October 26, 2020. http://dspace.library.uu.nl:8080/handle/1874/298560.

MLA Handbook (7th Edition):

Schuiling, N H. “Scalable Frequent Pattern Mining using Relational Databases.” 2014. Web. 26 Oct 2020.

Vancouver:

Schuiling NH. Scalable Frequent Pattern Mining using Relational Databases. [Internet] [Masters thesis]. Universiteit Utrecht; 2014. [cited 2020 Oct 26]. Available from: http://dspace.library.uu.nl:8080/handle/1874/298560.

Council of Science Editors:

Schuiling NH. Scalable Frequent Pattern Mining using Relational Databases. [Masters Thesis]. Universiteit Utrecht; 2014. Available from: http://dspace.library.uu.nl:8080/handle/1874/298560


University of Hong Kong

22. Tsang, Pui-kwan, Smith. Efficient decision tree building algorithms for uncertain data.

Degree: 2008, University of Hong Kong

Subjects/Keywords: Decision trees.; Data mining.; Algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tsang, Pui-kwan, S. (2008). Efficient decision tree building algorithms for uncertain data. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/50806

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

Tsang, Pui-kwan, Smith. “Efficient decision tree building algorithms for uncertain data.” 2008. Thesis, University of Hong Kong. Accessed October 26, 2020. http://hdl.handle.net/10722/50806.

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

MLA Handbook (7th Edition):

Tsang, Pui-kwan, Smith. “Efficient decision tree building algorithms for uncertain data.” 2008. Web. 26 Oct 2020.

Vancouver:

Tsang, Pui-kwan S. Efficient decision tree building algorithms for uncertain data. [Internet] [Thesis]. University of Hong Kong; 2008. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/10722/50806.

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

Council of Science Editors:

Tsang, Pui-kwan S. Efficient decision tree building algorithms for uncertain data. [Thesis]. University of Hong Kong; 2008. Available from: http://hdl.handle.net/10722/50806

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


University of Hong Kong

23. 李立基. New results on online job scheduling and data stream algorithms.

Degree: 2009, University of Hong Kong

Subjects/Keywords: Computer scheduling.; Data mining.; Algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

李立基. (2009). New results on online job scheduling and data stream algorithms. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/55575

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

Chicago Manual of Style (16th Edition):

李立基. “New results on online job scheduling and data stream algorithms.” 2009. Thesis, University of Hong Kong. Accessed October 26, 2020. http://hdl.handle.net/10722/55575.

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

MLA Handbook (7th Edition):

李立基. “New results on online job scheduling and data stream algorithms.” 2009. Web. 26 Oct 2020.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

李立基. New results on online job scheduling and data stream algorithms. [Internet] [Thesis]. University of Hong Kong; 2009. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/10722/55575.

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

Council of Science Editors:

李立基. New results on online job scheduling and data stream algorithms. [Thesis]. University of Hong Kong; 2009. Available from: http://hdl.handle.net/10722/55575

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


University of Hong Kong

24. Ngai, Wang-kay. Cluster analysis on uncertain data.

Degree: 2008, University of Hong Kong

Subjects/Keywords: Data mining.; Algorithms.; Cluster analysis.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ngai, W. (2008). Cluster analysis on uncertain data. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/55577

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

Ngai, Wang-kay. “Cluster analysis on uncertain data.” 2008. Thesis, University of Hong Kong. Accessed October 26, 2020. http://hdl.handle.net/10722/55577.

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

MLA Handbook (7th Edition):

Ngai, Wang-kay. “Cluster analysis on uncertain data.” 2008. Web. 26 Oct 2020.

Vancouver:

Ngai W. Cluster analysis on uncertain data. [Internet] [Thesis]. University of Hong Kong; 2008. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/10722/55577.

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

Council of Science Editors:

Ngai W. Cluster analysis on uncertain data. [Thesis]. University of Hong Kong; 2008. Available from: http://hdl.handle.net/10722/55577

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


University of Hong Kong

25. Zhang, Minghua. Sequence mining algorithms.

Degree: 2004, University of Hong Kong

Subjects/Keywords: Data mining.; Computer algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, M. (2004). Sequence mining algorithms. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/128700

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, Minghua. “Sequence mining algorithms.” 2004. Thesis, University of Hong Kong. Accessed October 26, 2020. http://hdl.handle.net/10722/128700.

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

MLA Handbook (7th Edition):

Zhang, Minghua. “Sequence mining algorithms.” 2004. Web. 26 Oct 2020.

Vancouver:

Zhang M. Sequence mining algorithms. [Internet] [Thesis]. University of Hong Kong; 2004. [cited 2020 Oct 26]. Available from: http://hdl.handle.net/10722/128700.

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

Council of Science Editors:

Zhang M. Sequence mining algorithms. [Thesis]. University of Hong Kong; 2004. Available from: http://hdl.handle.net/10722/128700

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

26. Jivani, Anjali Ganesh. A comparative study of text data mining algorithms and its applications; -.

Degree: Computer Science and Engineering, 2011, Maharaja Sayajirao University of Baroda

None

Appendix p.131-133 and Bibliography p.136-139

Advisors/Committee Members: Parekh, B S.

Subjects/Keywords: algorithms; applications; text data mining

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jivani, A. G. (2011). A comparative study of text data mining algorithms and its applications; -. (Thesis). Maharaja Sayajirao University of Baroda. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/34713

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

Jivani, Anjali Ganesh. “A comparative study of text data mining algorithms and its applications; -.” 2011. Thesis, Maharaja Sayajirao University of Baroda. Accessed October 26, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/34713.

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

MLA Handbook (7th Edition):

Jivani, Anjali Ganesh. “A comparative study of text data mining algorithms and its applications; -.” 2011. Web. 26 Oct 2020.

Vancouver:

Jivani AG. A comparative study of text data mining algorithms and its applications; -. [Internet] [Thesis]. Maharaja Sayajirao University of Baroda; 2011. [cited 2020 Oct 26]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/34713.

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

Council of Science Editors:

Jivani AG. A comparative study of text data mining algorithms and its applications; -. [Thesis]. Maharaja Sayajirao University of Baroda; 2011. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/34713

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


Anna University

27. 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 October 26, 2020. 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. 26 Oct 2020.

Vancouver:

R IM. Mining of projected clusters in high dimensional data using modified fuzzy C means algorithm. [Internet] [Thesis]. Anna University; 2013. [cited 2020 Oct 26]. 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


Anna University

28. Umarani V. On Developing Effectual Algorithms For Association Rule Discovery In Transaction Databases;.

Degree: Computer Science, 2013, Anna University

Association rule mining is the most important and well investigated data newlinemining technique used by an organizations decision makers to improve the newlineoverall profit It… (more)

Subjects/Keywords: Algorithms; Association Rule; data mining; scalability; Transaction Databases

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

V, U. (2013). On Developing Effectual Algorithms For Association Rule Discovery In Transaction Databases;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/24357

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

V, Umarani. “On Developing Effectual Algorithms For Association Rule Discovery In Transaction Databases;.” 2013. Thesis, Anna University. Accessed October 26, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/24357.

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

MLA Handbook (7th Edition):

V, Umarani. “On Developing Effectual Algorithms For Association Rule Discovery In Transaction Databases;.” 2013. Web. 26 Oct 2020.

Vancouver:

V U. On Developing Effectual Algorithms For Association Rule Discovery In Transaction Databases;. [Internet] [Thesis]. Anna University; 2013. [cited 2020 Oct 26]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/24357.

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

Council of Science Editors:

V U. On Developing Effectual Algorithms For Association Rule Discovery In Transaction Databases;. [Thesis]. Anna University; 2013. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/24357

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


North Carolina State University

29. Awekar, Amit Chintamani. Fast, Incremental, and Scalable All Pairs Similarity Search.

Degree: PhD, Computer Science, 2010, North Carolina State University

 Searching pairs of similar data records is an operation required for many data mining techniques like clustering and collaborative filtering. With emergence of the Web,… (more)

Subjects/Keywords: similarity search; parallel algorithms; data mining; inverted index

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Awekar, A. C. (2010). Fast, Incremental, and Scalable All Pairs Similarity Search. (Doctoral Dissertation). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/4205

Chicago Manual of Style (16th Edition):

Awekar, Amit Chintamani. “Fast, Incremental, and Scalable All Pairs Similarity Search.” 2010. Doctoral Dissertation, North Carolina State University. Accessed October 26, 2020. http://www.lib.ncsu.edu/resolver/1840.16/4205.

MLA Handbook (7th Edition):

Awekar, Amit Chintamani. “Fast, Incremental, and Scalable All Pairs Similarity Search.” 2010. Web. 26 Oct 2020.

Vancouver:

Awekar AC. Fast, Incremental, and Scalable All Pairs Similarity Search. [Internet] [Doctoral dissertation]. North Carolina State University; 2010. [cited 2020 Oct 26]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/4205.

Council of Science Editors:

Awekar AC. Fast, Incremental, and Scalable All Pairs Similarity Search. [Doctoral Dissertation]. North Carolina State University; 2010. Available from: http://www.lib.ncsu.edu/resolver/1840.16/4205


University of Miami

30. Quirino, Thiago S. Improving Search In Genetic Algorithms Through Instinct-Based Mating Strategies.

Degree: PhD, Electrical and Computer Engineering (Engineering), 2012, University of Miami

 The Genetic Algorithm (GA) is a popular approach to search and optimization that has been applied to hundreds of real-world optimization problems across numerous domains… (more)

Subjects/Keywords: Genetic Algorithms; Mating Strategies; Machine Learning; Optimization; Data Mining; Supervised Classification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Quirino, T. S. (2012). Improving Search In Genetic Algorithms Through Instinct-Based Mating Strategies. (Doctoral Dissertation). University of Miami. Retrieved from https://scholarlyrepository.miami.edu/oa_dissertations/737

Chicago Manual of Style (16th Edition):

Quirino, Thiago S. “Improving Search In Genetic Algorithms Through Instinct-Based Mating Strategies.” 2012. Doctoral Dissertation, University of Miami. Accessed October 26, 2020. https://scholarlyrepository.miami.edu/oa_dissertations/737.

MLA Handbook (7th Edition):

Quirino, Thiago S. “Improving Search In Genetic Algorithms Through Instinct-Based Mating Strategies.” 2012. Web. 26 Oct 2020.

Vancouver:

Quirino TS. Improving Search In Genetic Algorithms Through Instinct-Based Mating Strategies. [Internet] [Doctoral dissertation]. University of Miami; 2012. [cited 2020 Oct 26]. Available from: https://scholarlyrepository.miami.edu/oa_dissertations/737.

Council of Science Editors:

Quirino TS. Improving Search In Genetic Algorithms Through Instinct-Based Mating Strategies. [Doctoral Dissertation]. University of Miami; 2012. Available from: https://scholarlyrepository.miami.edu/oa_dissertations/737

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

.