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 +publisher:"NSYSU" +contributor:("Ye-In Chang"). Showing records 1 – 30 of 51 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

▼ Search Limiters


NSYSU

1. Lin, Shu-Yi. The GDense Algorithm for Clustering Data Streams with High Quality.

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

 In recent years, mining data streams has been widely studied. A data streams is a sequence of dynamic, continuous, unbounded and real time data items… (more)

Subjects/Keywords: density-based; grid-based; clustering; data streams

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lin, S. (2009). The GDense Algorithm for Clustering Data Streams with High Quality. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0625109-171938

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

Lin, Shu-Yi. “The GDense Algorithm for Clustering Data Streams with High Quality.” 2009. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0625109-171938.

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

MLA Handbook (7th Edition):

Lin, Shu-Yi. “The GDense Algorithm for Clustering Data Streams with High Quality.” 2009. Web. 09 May 2021.

Vancouver:

Lin S. The GDense Algorithm for Clustering Data Streams with High Quality. [Internet] [Thesis]. NSYSU; 2009. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0625109-171938.

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

Council of Science Editors:

Lin S. The GDense Algorithm for Clustering Data Streams with High Quality. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0625109-171938

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


NSYSU

2. Peng, Wei-hau. An Efficient Subset-Lattice Algorithm for Mining Closed Frequent Itemsets in Data Streams.

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

 Online mining association rules over data streams is an important issue in the area of data mining, where an association rule means that the presence… (more)

Subjects/Keywords: frequent itemset; closed frequent itemset; Data Streams; Association Rules

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Peng, W. (2009). An Efficient Subset-Lattice Algorithm for Mining Closed Frequent Itemsets in Data Streams. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0625109-204302

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

Peng, Wei-hau. “An Efficient Subset-Lattice Algorithm for Mining Closed Frequent Itemsets in Data Streams.” 2009. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0625109-204302.

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

MLA Handbook (7th Edition):

Peng, Wei-hau. “An Efficient Subset-Lattice Algorithm for Mining Closed Frequent Itemsets in Data Streams.” 2009. Web. 09 May 2021.

Vancouver:

Peng W. An Efficient Subset-Lattice Algorithm for Mining Closed Frequent Itemsets in Data Streams. [Internet] [Thesis]. NSYSU; 2009. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0625109-204302.

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

Council of Science Editors:

Peng W. An Efficient Subset-Lattice Algorithm for Mining Closed Frequent Itemsets in Data Streams. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0625109-204302

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


NSYSU

3. Chin, Tsz-lin. An Obstruction-Check Approach to Mining Closed Sequential Patterns in Data Streams.

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

 Online mining sequential patterns over data streams is an important problem in data mining. There are many applications of using sequential patterns in data streams,… (more)

Subjects/Keywords: Closed Sequential Pattern; Lattice; Sliding Window; Sequential Pattern; Data Stream

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chin, T. (2010). An Obstruction-Check Approach to Mining Closed Sequential Patterns in Data Streams. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0621110-150934

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

Chin, Tsz-lin. “An Obstruction-Check Approach to Mining Closed Sequential Patterns in Data Streams.” 2010. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0621110-150934.

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

MLA Handbook (7th Edition):

Chin, Tsz-lin. “An Obstruction-Check Approach to Mining Closed Sequential Patterns in Data Streams.” 2010. Web. 09 May 2021.

Vancouver:

Chin T. An Obstruction-Check Approach to Mining Closed Sequential Patterns in Data Streams. [Internet] [Thesis]. NSYSU; 2010. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0621110-150934.

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

Council of Science Editors:

Chin T. An Obstruction-Check Approach to Mining Closed Sequential Patterns in Data Streams. [Thesis]. NSYSU; 2010. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0621110-150934

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


NSYSU

4. Tsai, Meng-chang. A User-Interests Approach to Music Recommendation Systems.

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

 In recent years, music has become increasingly universal due to technological advances. All kinds of music have become more complex and a large amount around… (more)

Subjects/Keywords: Weight; Music Recommendation System; User Interest; Transaction; Count

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tsai, M. (2010). A User-Interests Approach to Music Recommendation Systems. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0618110-165220

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

Tsai, Meng-chang. “A User-Interests Approach to Music Recommendation Systems.” 2010. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0618110-165220.

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

MLA Handbook (7th Edition):

Tsai, Meng-chang. “A User-Interests Approach to Music Recommendation Systems.” 2010. Web. 09 May 2021.

Vancouver:

Tsai M. A User-Interests Approach to Music Recommendation Systems. [Internet] [Thesis]. NSYSU; 2010. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0618110-165220.

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

Council of Science Editors:

Tsai M. A User-Interests Approach to Music Recommendation Systems. [Thesis]. NSYSU; 2010. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0618110-165220

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


NSYSU

5. Chang, Hsi-mei. Hybrid Algorithms of Finding Features for Clustering Sequential Data.

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

 Proteins are the structural components of living cells and tissues, and thus an important building block in all living organisms. Patterns in proteins sequences are… (more)

Subjects/Keywords: Clustering; Protein databases; Sequential data; Features

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chang, H. (2010). Hybrid Algorithms of Finding Features for Clustering Sequential Data. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0708110-144724

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

Chang, Hsi-mei. “Hybrid Algorithms of Finding Features for Clustering Sequential Data.” 2010. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0708110-144724.

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

MLA Handbook (7th Edition):

Chang, Hsi-mei. “Hybrid Algorithms of Finding Features for Clustering Sequential Data.” 2010. Web. 09 May 2021.

Vancouver:

Chang H. Hybrid Algorithms of Finding Features for Clustering Sequential Data. [Internet] [Thesis]. NSYSU; 2010. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0708110-144724.

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

Council of Science Editors:

Chang H. Hybrid Algorithms of Finding Features for Clustering Sequential Data. [Thesis]. NSYSU; 2010. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0708110-144724

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


NSYSU

6. Chen, Tien-hsiu. A Position-Join Method for Finding Maximum-Length Repeating Patterns in Music Databases.

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

 In recent years, the music has become popular due to the evolution of the technology. Various kinds of music around us become complexities and huge.… (more)

Subjects/Keywords: Depth First Search; Repeating Pattern; Data Mining; Music Sequence; Music Database

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, T. (2011). A Position-Join Method for Finding Maximum-Length Repeating Patterns in Music Databases. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0712111-140138

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

Chen, Tien-hsiu. “A Position-Join Method for Finding Maximum-Length Repeating Patterns in Music Databases.” 2011. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0712111-140138.

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

MLA Handbook (7th Edition):

Chen, Tien-hsiu. “A Position-Join Method for Finding Maximum-Length Repeating Patterns in Music Databases.” 2011. Web. 09 May 2021.

Vancouver:

Chen T. A Position-Join Method for Finding Maximum-Length Repeating Patterns in Music Databases. [Internet] [Thesis]. NSYSU; 2011. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0712111-140138.

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

Council of Science Editors:

Chen T. A Position-Join Method for Finding Maximum-Length Repeating Patterns in Music Databases. [Thesis]. NSYSU; 2011. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0712111-140138

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


NSYSU

7. Wang, Cheng-Hung. The MCountP-Tree for Mining Maximal Spatial Co-Location Patterns from Spatial Data Sets.

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

 In recent years, the geographic information system (GIS) databases develop quickly and play a significant role in many applications. How to efficient mine the maximal… (more)

Subjects/Keywords: Spatial database; Spatial data mining; Spatial co-location rules; Spatial co-location patterns; Co-location rules

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, C. (2013). The MCountP-Tree for Mining Maximal Spatial Co-Location Patterns from Spatial Data Sets. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0527113-133645

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, Cheng-Hung. “The MCountP-Tree for Mining Maximal Spatial Co-Location Patterns from Spatial Data Sets.” 2013. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0527113-133645.

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

MLA Handbook (7th Edition):

Wang, Cheng-Hung. “The MCountP-Tree for Mining Maximal Spatial Co-Location Patterns from Spatial Data Sets.” 2013. Web. 09 May 2021.

Vancouver:

Wang C. The MCountP-Tree for Mining Maximal Spatial Co-Location Patterns from Spatial Data Sets. [Internet] [Thesis]. NSYSU; 2013. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0527113-133645.

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

Council of Science Editors:

Wang C. The MCountP-Tree for Mining Maximal Spatial Co-Location Patterns from Spatial Data Sets. [Thesis]. NSYSU; 2013. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0527113-133645

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


NSYSU

8. Lin, Shun-Yi. The Transation-ID-Time Algorithm for Mining Time-Interval Sequential Patterns in Sequence Databases.

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

 Data mining extracts implicit, previously unknown and potentially useful informationfrom databases. The discovered information and knowledge are useful forvarious applications, including market analysis, decision support,… (more)

Subjects/Keywords: Data mining; Time-interval sequential patterns; Sequential patterns; Terminal edge; Depth-first search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lin, S. (2013). The Transation-ID-Time Algorithm for Mining Time-Interval Sequential Patterns in Sequence Databases. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0527113-121634

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

Lin, Shun-Yi. “The Transation-ID-Time Algorithm for Mining Time-Interval Sequential Patterns in Sequence Databases.” 2013. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0527113-121634.

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

MLA Handbook (7th Edition):

Lin, Shun-Yi. “The Transation-ID-Time Algorithm for Mining Time-Interval Sequential Patterns in Sequence Databases.” 2013. Web. 09 May 2021.

Vancouver:

Lin S. The Transation-ID-Time Algorithm for Mining Time-Interval Sequential Patterns in Sequence Databases. [Internet] [Thesis]. NSYSU; 2013. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0527113-121634.

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

Council of Science Editors:

Lin S. The Transation-ID-Time Algorithm for Mining Time-Interval Sequential Patterns in Sequence Databases. [Thesis]. NSYSU; 2013. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0527113-121634

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


NSYSU

9. Tseng, Yu-Siang. Vertical-Line-Based Incremental Algorithms for Moving Objects of the Monochromatic and Bichromatic Reverse Nearest Neighbors.

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

 Due to wireless communication technologies, positioning technologies, and mobile computing develop quickly, mobile services are becoming important on the spatial database management. One of the… (more)

Subjects/Keywords: Spatial Database; Reverse Nearest Neighbor; Query Processing; Mobile Service; Business strategy

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tseng, Y. (2013). Vertical-Line-Based Incremental Algorithms for Moving Objects of the Monochromatic and Bichromatic Reverse Nearest Neighbors. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0527113-125844

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

Tseng, Yu-Siang. “Vertical-Line-Based Incremental Algorithms for Moving Objects of the Monochromatic and Bichromatic Reverse Nearest Neighbors.” 2013. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0527113-125844.

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

MLA Handbook (7th Edition):

Tseng, Yu-Siang. “Vertical-Line-Based Incremental Algorithms for Moving Objects of the Monochromatic and Bichromatic Reverse Nearest Neighbors.” 2013. Web. 09 May 2021.

Vancouver:

Tseng Y. Vertical-Line-Based Incremental Algorithms for Moving Objects of the Monochromatic and Bichromatic Reverse Nearest Neighbors. [Internet] [Thesis]. NSYSU; 2013. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0527113-125844.

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

Council of Science Editors:

Tseng Y. Vertical-Line-Based Incremental Algorithms for Moving Objects of the Monochromatic and Bichromatic Reverse Nearest Neighbors. [Thesis]. NSYSU; 2013. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0527113-125844

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


NSYSU

10. Tu, Ming-Hsuan. A Valid-Candidate Approach to Mining Frequent Patterns in Image Databases.

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

 In recent years, the image database systems develop quickly and play a significant role in many applications. To discover the useful information from these image… (more)

Subjects/Keywords: Frequent patterns; Spatial association rules; Image mining; Iconic index; Image database

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tu, M. (2014). A Valid-Candidate Approach to Mining Frequent Patterns in Image Databases. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0524114-165049

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

Tu, Ming-Hsuan. “A Valid-Candidate Approach to Mining Frequent Patterns in Image Databases.” 2014. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0524114-165049.

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

MLA Handbook (7th Edition):

Tu, Ming-Hsuan. “A Valid-Candidate Approach to Mining Frequent Patterns in Image Databases.” 2014. Web. 09 May 2021.

Vancouver:

Tu M. A Valid-Candidate Approach to Mining Frequent Patterns in Image Databases. [Internet] [Thesis]. NSYSU; 2014. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0524114-165049.

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

Council of Science Editors:

Tu M. A Valid-Candidate Approach to Mining Frequent Patterns in Image Databases. [Thesis]. NSYSU; 2014. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0524114-165049

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


NSYSU

11. Huang, Hsin-pao. The Earliest-Time-Point Approach to Mining Frequent Up-to-Date Patterns in Temporal Databases.

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

 ããRecently, temporal data mining has been considered as an important topic attracting many researchers. Analyzing temporal data and discovering temporal patterns are the main concerns… (more)

Subjects/Keywords: Frequent Patterns; Up-to-date Patterns; Temporal Patterns; Temporal Data Mining; Data Mining

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huang, H. (2014). The Earliest-Time-Point Approach to Mining Frequent Up-to-Date Patterns in Temporal Databases. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0523114-212312

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, Hsin-pao. “The Earliest-Time-Point Approach to Mining Frequent Up-to-Date Patterns in Temporal Databases.” 2014. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0523114-212312.

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

MLA Handbook (7th Edition):

Huang, Hsin-pao. “The Earliest-Time-Point Approach to Mining Frequent Up-to-Date Patterns in Temporal Databases.” 2014. Web. 09 May 2021.

Vancouver:

Huang H. The Earliest-Time-Point Approach to Mining Frequent Up-to-Date Patterns in Temporal Databases. [Internet] [Thesis]. NSYSU; 2014. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0523114-212312.

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

Council of Science Editors:

Huang H. The Earliest-Time-Point Approach to Mining Frequent Up-to-Date Patterns in Temporal Databases. [Thesis]. NSYSU; 2014. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0523114-212312

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


NSYSU

12. Chu, Che-min. An Incremental Approach to Reverse Nearest Neighbor Queries on the Moving Query in Road Networks.

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

 In recent years, the wireless communication technologies, mobile system, and Global Positioning System (GPS) are more important and develop quickly. Due to the mobile services… (more)

Subjects/Keywords: Spatial Database; Road Network; Reverse Nearest Neighbor; Mobile Service; Query Processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chu, C. (2014). An Incremental Approach to Reverse Nearest Neighbor Queries on the Moving Query in Road Networks. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0524114-165918

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

Chu, Che-min. “An Incremental Approach to Reverse Nearest Neighbor Queries on the Moving Query in Road Networks.” 2014. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0524114-165918.

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

MLA Handbook (7th Edition):

Chu, Che-min. “An Incremental Approach to Reverse Nearest Neighbor Queries on the Moving Query in Road Networks.” 2014. Web. 09 May 2021.

Vancouver:

Chu C. An Incremental Approach to Reverse Nearest Neighbor Queries on the Moving Query in Road Networks. [Internet] [Thesis]. NSYSU; 2014. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0524114-165918.

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

Council of Science Editors:

Chu C. An Incremental Approach to Reverse Nearest Neighbor Queries on the Moving Query in Road Networks. [Thesis]. NSYSU; 2014. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0524114-165918

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


NSYSU

13. Tang, Hsiu-Pei. An Inverted-File-based Algorithm for Efficient Mining High Utility Patterns.

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

 Recently, mining high utility patterns has a huge range of applications such as retail market analysis and stock market prediction. The high utility pattern mining… (more)

Subjects/Keywords: Transaction-Weighted Utilization; Reducing Search Space; High Utility Patterns; Frequent Patterns; Utility Mining

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tang, H. (2016). An Inverted-File-based Algorithm for Efficient Mining High Utility Patterns. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0504116-125702

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

Tang, Hsiu-Pei. “An Inverted-File-based Algorithm for Efficient Mining High Utility Patterns.” 2016. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0504116-125702.

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

MLA Handbook (7th Edition):

Tang, Hsiu-Pei. “An Inverted-File-based Algorithm for Efficient Mining High Utility Patterns.” 2016. Web. 09 May 2021.

Vancouver:

Tang H. An Inverted-File-based Algorithm for Efficient Mining High Utility Patterns. [Internet] [Thesis]. NSYSU; 2016. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0504116-125702.

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

Council of Science Editors:

Tang H. An Inverted-File-based Algorithm for Efficient Mining High Utility Patterns. [Thesis]. NSYSU; 2016. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0504116-125702

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


NSYSU

14. Wang, Syuan-Yun. A Subset-Lattice Algorithm for Mining Maximal Frequent Itemsets over a Data Stream Sliding Window.

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

 Online mining association rules in data streams is an important field in the data mining. Among them, mining the maximal frequent itemsets is also an… (more)

Subjects/Keywords: Maximal Frequent Itemset; Lattice; Sliding Window Model; Itemset; Data Stream

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, S. (2012). A Subset-Lattice Algorithm for Mining Maximal Frequent Itemsets over a Data Stream Sliding Window. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0709112-163748

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, Syuan-Yun. “A Subset-Lattice Algorithm for Mining Maximal Frequent Itemsets over a Data Stream Sliding Window.” 2012. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0709112-163748.

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

MLA Handbook (7th Edition):

Wang, Syuan-Yun. “A Subset-Lattice Algorithm for Mining Maximal Frequent Itemsets over a Data Stream Sliding Window.” 2012. Web. 09 May 2021.

Vancouver:

Wang S. A Subset-Lattice Algorithm for Mining Maximal Frequent Itemsets over a Data Stream Sliding Window. [Internet] [Thesis]. NSYSU; 2012. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0709112-163748.

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

Council of Science Editors:

Wang S. A Subset-Lattice Algorithm for Mining Maximal Frequent Itemsets over a Data Stream Sliding Window. [Thesis]. NSYSU; 2012. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0709112-163748

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


NSYSU

15. Liou, Yen-Guo. NAAK-Tree: An Index for Querying Spatial Approximate Keywords.

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

 ããIn recent years, the geographic information system (GIS) databases develop quickly and play a significant role in many applications. Many of these applications allow users… (more)

Subjects/Keywords: Signature; Index Structure; Approximate-Keyword; Spatial Database; Range Query

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liou, Y. (2012). NAAK-Tree: An Index for Querying Spatial Approximate Keywords. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0711112-160600

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

Liou, Yen-Guo. “NAAK-Tree: An Index for Querying Spatial Approximate Keywords.” 2012. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0711112-160600.

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

MLA Handbook (7th Edition):

Liou, Yen-Guo. “NAAK-Tree: An Index for Querying Spatial Approximate Keywords.” 2012. Web. 09 May 2021.

Vancouver:

Liou Y. NAAK-Tree: An Index for Querying Spatial Approximate Keywords. [Internet] [Thesis]. NSYSU; 2012. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0711112-160600.

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

Council of Science Editors:

Liou Y. NAAK-Tree: An Index for Querying Spatial Approximate Keywords. [Thesis]. NSYSU; 2012. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0711112-160600

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


NSYSU

16. Feng, Fei-Chung. A Hilbert Curve-Based Algorithm for Order-Sensitive Moving KNN Queries.

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

 ããDue to wireless communication technologies, positioning technologies, and mobile computing develop quickly, mobile services are becoming practical and important on big spatiotemporal databases management. Mobile… (more)

Subjects/Keywords: Spatial database; Real-Time Systems; Hilbert curve; K nearest neighbor; Mobile service

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Feng, F. (2012). A Hilbert Curve-Based Algorithm for Order-Sensitive Moving KNN Queries. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0711112-191009

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

Feng, Fei-Chung. “A Hilbert Curve-Based Algorithm for Order-Sensitive Moving KNN Queries.” 2012. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0711112-191009.

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

MLA Handbook (7th Edition):

Feng, Fei-Chung. “A Hilbert Curve-Based Algorithm for Order-Sensitive Moving KNN Queries.” 2012. Web. 09 May 2021.

Vancouver:

Feng F. A Hilbert Curve-Based Algorithm for Order-Sensitive Moving KNN Queries. [Internet] [Thesis]. NSYSU; 2012. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0711112-191009.

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

Council of Science Editors:

Feng F. A Hilbert Curve-Based Algorithm for Order-Sensitive Moving KNN Queries. [Thesis]. NSYSU; 2012. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0711112-191009

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


NSYSU

17. Lin, Pei-Ying. A Set-Checking Algorithm for Mining Maximal Frequent Itemsets from Data Streams.

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

 Online mining the maximal frequent itemsets over data streams is an important problem in data mining. The maximal frequent itemset is the itemset which the… (more)

Subjects/Keywords: Itemset; Landmark Window Model; Lattice; Maximal Frequent Itemset; Data Stream

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lin, P. (2011). A Set-Checking Algorithm for Mining Maximal Frequent Itemsets from Data Streams. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0715111-180126

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

Lin, Pei-Ying. “A Set-Checking Algorithm for Mining Maximal Frequent Itemsets from Data Streams.” 2011. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0715111-180126.

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

MLA Handbook (7th Edition):

Lin, Pei-Ying. “A Set-Checking Algorithm for Mining Maximal Frequent Itemsets from Data Streams.” 2011. Web. 09 May 2021.

Vancouver:

Lin P. A Set-Checking Algorithm for Mining Maximal Frequent Itemsets from Data Streams. [Internet] [Thesis]. NSYSU; 2011. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0715111-180126.

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

Council of Science Editors:

Lin P. A Set-Checking Algorithm for Mining Maximal Frequent Itemsets from Data Streams. [Thesis]. NSYSU; 2011. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0715111-180126

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


NSYSU

18. Chiou, Tzung-je. A Weight-Order-Based Lattice Algorithm for Mining Maximal Weighted Frequent Patterns over a Data Stream Sliding Window.

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

 Weighted frequent pattern mining in data streams is an important field for the real world, such as the supermarket. Moreover, mining the weighted maximal frequent… (more)

Subjects/Keywords: Sliding Window Model; Lattice; Weighted Maximal Frequent Itemset; Data Stream; Itemset

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chiou, T. (2015). A Weight-Order-Based Lattice Algorithm for Mining Maximal Weighted Frequent Patterns over a Data Stream Sliding Window. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0525115-120601

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

Chiou, Tzung-je. “A Weight-Order-Based Lattice Algorithm for Mining Maximal Weighted Frequent Patterns over a Data Stream Sliding Window.” 2015. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0525115-120601.

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

MLA Handbook (7th Edition):

Chiou, Tzung-je. “A Weight-Order-Based Lattice Algorithm for Mining Maximal Weighted Frequent Patterns over a Data Stream Sliding Window.” 2015. Web. 09 May 2021.

Vancouver:

Chiou T. A Weight-Order-Based Lattice Algorithm for Mining Maximal Weighted Frequent Patterns over a Data Stream Sliding Window. [Internet] [Thesis]. NSYSU; 2015. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0525115-120601.

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

Council of Science Editors:

Chiou T. A Weight-Order-Based Lattice Algorithm for Mining Maximal Weighted Frequent Patterns over a Data Stream Sliding Window. [Thesis]. NSYSU; 2015. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0525115-120601

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


NSYSU

19. Wang, Hsin-yi. A Restriction-Based Algorithm for Mining Interesting Frequent Periodic Patterns in Time Series Databases.

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

 In recent years, time-series data mining has been considered as an important topic attracting many researchers. One of the most important topics in the time-series… (more)

Subjects/Keywords: Frequent Patterns; Data Mining; Time-series Data Mining; Time-series Patterns; Periodicity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, H. (2015). A Restriction-Based Algorithm for Mining Interesting Frequent Periodic Patterns in Time Series Databases. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0525115-130621

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, Hsin-yi. “A Restriction-Based Algorithm for Mining Interesting Frequent Periodic Patterns in Time Series Databases.” 2015. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0525115-130621.

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

MLA Handbook (7th Edition):

Wang, Hsin-yi. “A Restriction-Based Algorithm for Mining Interesting Frequent Periodic Patterns in Time Series Databases.” 2015. Web. 09 May 2021.

Vancouver:

Wang H. A Restriction-Based Algorithm for Mining Interesting Frequent Periodic Patterns in Time Series Databases. [Internet] [Thesis]. NSYSU; 2015. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0525115-130621.

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

Council of Science Editors:

Wang H. A Restriction-Based Algorithm for Mining Interesting Frequent Periodic Patterns in Time Series Databases. [Thesis]. NSYSU; 2015. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0525115-130621

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


NSYSU

20. Yang, Kai-ning. A KSNA-Tree Algorithm for the Top-k Exact Keyword Search in Spatial Databases.

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

 In recent years, the geographic information system (GIS) develops quickly and plays a significant role in many applications and websites. Many websites and applications allow… (more)

Subjects/Keywords: Top-k; Spatial Index Structure; Spatial Database; Keyword Matching; Inverted Index

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yang, K. (2015). A KSNA-Tree Algorithm for the Top-k Exact Keyword Search in Spatial Databases. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0523115-195758

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

Yang, Kai-ning. “A KSNA-Tree Algorithm for the Top-k Exact Keyword Search in Spatial Databases.” 2015. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0523115-195758.

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

MLA Handbook (7th Edition):

Yang, Kai-ning. “A KSNA-Tree Algorithm for the Top-k Exact Keyword Search in Spatial Databases.” 2015. Web. 09 May 2021.

Vancouver:

Yang K. A KSNA-Tree Algorithm for the Top-k Exact Keyword Search in Spatial Databases. [Internet] [Thesis]. NSYSU; 2015. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0523115-195758.

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

Council of Science Editors:

Yang K. A KSNA-Tree Algorithm for the Top-k Exact Keyword Search in Spatial Databases. [Thesis]. NSYSU; 2015. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0523115-195758

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


NSYSU

21. Su Wang, I-Hsiang. ICQ-Tree: An Inverted Code Quadtree for the Top-K Spatial Keyword Query over the Incremental Database.

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

 With the rapid development of geo-spatial data, the use of spatial databases has become more and more widespread. For example, if we enter the keyword… (more)

Subjects/Keywords: Spatial Database; Top-k; Quadtree; Keyword Search; Inverted Index

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Su Wang, I. (2018). ICQ-Tree: An Inverted Code Quadtree for the Top-K Spatial Keyword Query over the Incremental Database. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627118-203130

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

Su Wang, I-Hsiang. “ICQ-Tree: An Inverted Code Quadtree for the Top-K Spatial Keyword Query over the Incremental Database.” 2018. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627118-203130.

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

MLA Handbook (7th Edition):

Su Wang, I-Hsiang. “ICQ-Tree: An Inverted Code Quadtree for the Top-K Spatial Keyword Query over the Incremental Database.” 2018. Web. 09 May 2021.

Vancouver:

Su Wang I. ICQ-Tree: An Inverted Code Quadtree for the Top-K Spatial Keyword Query over the Incremental Database. [Internet] [Thesis]. NSYSU; 2018. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627118-203130.

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

Council of Science Editors:

Su Wang I. ICQ-Tree: An Inverted Code Quadtree for the Top-K Spatial Keyword Query over the Incremental Database. [Thesis]. NSYSU; 2018. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0627118-203130

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


NSYSU

22. Chen, Rong-Fu. A Subset-Lattice Algorithm for Mining High Utility Patterns over the Data Stream Sliding Window.

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

 For the real world, high utility pattern mining over data streams is an important issue in the data mining field such as the supermarket. The… (more)

Subjects/Keywords: Data Stream; Utility Mining; High Utility Patterns; Sliding Window Model; Lattice

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, R. (2017). A Subset-Lattice Algorithm for Mining High Utility Patterns over the Data Stream Sliding Window. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0519117-171805

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

Chen, Rong-Fu. “A Subset-Lattice Algorithm for Mining High Utility Patterns over the Data Stream Sliding Window.” 2017. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0519117-171805.

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

MLA Handbook (7th Edition):

Chen, Rong-Fu. “A Subset-Lattice Algorithm for Mining High Utility Patterns over the Data Stream Sliding Window.” 2017. Web. 09 May 2021.

Vancouver:

Chen R. A Subset-Lattice Algorithm for Mining High Utility Patterns over the Data Stream Sliding Window. [Internet] [Thesis]. NSYSU; 2017. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0519117-171805.

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

Council of Science Editors:

Chen R. A Subset-Lattice Algorithm for Mining High Utility Patterns over the Data Stream Sliding Window. [Thesis]. NSYSU; 2017. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0519117-171805

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


NSYSU

23. Chung, Wen-hsiu. The Count-Ordered Instances-Tree for Discovering Maximal Co-Location Patterns in Spatial Databases.

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

 In recent years, the accumulation of information bursts in an amazing speed. It is important and necessary to discover the potential information that would be… (more)

Subjects/Keywords: Spatial Data Mining; Spatial Database; Spatial Co-location Rules; Maximal Co-location Patterns; Spatial Co-location Patterns

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chung, W. (2017). The Count-Ordered Instances-Tree for Discovering Maximal Co-Location Patterns in Spatial Databases. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0522117-094303

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

Chung, Wen-hsiu. “The Count-Ordered Instances-Tree for Discovering Maximal Co-Location Patterns in Spatial Databases.” 2017. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0522117-094303.

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

MLA Handbook (7th Edition):

Chung, Wen-hsiu. “The Count-Ordered Instances-Tree for Discovering Maximal Co-Location Patterns in Spatial Databases.” 2017. Web. 09 May 2021.

Vancouver:

Chung W. The Count-Ordered Instances-Tree for Discovering Maximal Co-Location Patterns in Spatial Databases. [Internet] [Thesis]. NSYSU; 2017. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0522117-094303.

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

Council of Science Editors:

Chung W. The Count-Ordered Instances-Tree for Discovering Maximal Co-Location Patterns in Spatial Databases. [Thesis]. NSYSU; 2017. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0522117-094303

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


NSYSU

24. Liu, Hung-ze. AKDB-Tree: An Adjustable KDB-tree for Efficiently Supporting Nearest Neighbor Queries in P2P Systems.

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

 In the future, more data intensive applications, such as P2P auction networks, P2P job – search networks, P2P multi – player games, will require the capability to… (more)

Subjects/Keywords: Spatial Data; Hashing Function; Nearest Neighbor Query; P2P Systems; Tree Structure

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, H. (2008). AKDB-Tree: An Adjustable KDB-tree for Efficiently Supporting Nearest Neighbor Queries in P2P Systems. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0706108-230108

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

Liu, Hung-ze. “AKDB-Tree: An Adjustable KDB-tree for Efficiently Supporting Nearest Neighbor Queries in P2P Systems.” 2008. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0706108-230108.

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

MLA Handbook (7th Edition):

Liu, Hung-ze. “AKDB-Tree: An Adjustable KDB-tree for Efficiently Supporting Nearest Neighbor Queries in P2P Systems.” 2008. Web. 09 May 2021.

Vancouver:

Liu H. AKDB-Tree: An Adjustable KDB-tree for Efficiently Supporting Nearest Neighbor Queries in P2P Systems. [Internet] [Thesis]. NSYSU; 2008. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0706108-230108.

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

Council of Science Editors:

Liu H. AKDB-Tree: An Adjustable KDB-tree for Efficiently Supporting Nearest Neighbor Queries in P2P Systems. [Thesis]. NSYSU; 2008. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0706108-230108

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


NSYSU

25. Jeng, Yin-han. An Efficient Bit-Pattern-Based Algorithm for Mining Sequential Patterns in Protein Databases.

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

 Proteins are the structural components of living cells and tissues, and thus an important building block in all living organisms. Patterns in proteins sequences are… (more)

Subjects/Keywords: Sequential Patterns; Protein Databases; Bit-Pattern-Based

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jeng, Y. (2009). An Efficient Bit-Pattern-Based Algorithm for Mining Sequential Patterns in Protein Databases. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0626109-152123

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

Jeng, Yin-han. “An Efficient Bit-Pattern-Based Algorithm for Mining Sequential Patterns in Protein Databases.” 2009. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0626109-152123.

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

MLA Handbook (7th Edition):

Jeng, Yin-han. “An Efficient Bit-Pattern-Based Algorithm for Mining Sequential Patterns in Protein Databases.” 2009. Web. 09 May 2021.

Vancouver:

Jeng Y. An Efficient Bit-Pattern-Based Algorithm for Mining Sequential Patterns in Protein Databases. [Internet] [Thesis]. NSYSU; 2009. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0626109-152123.

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

Council of Science Editors:

Jeng Y. An Efficient Bit-Pattern-Based Algorithm for Mining Sequential Patterns in Protein Databases. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0626109-152123

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


NSYSU

26. Lin, Chi-Chih. A Weight-based Approach to the Classification of Uroflowmetry Curves.

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

 Uroflowmetry, which measures the flow and volume of urine during urination, is a common, noninvasive urinary test to diagnose symptoms. The uroflowmetry results can help… (more)

Subjects/Keywords: Uroflowmetry Curves; Classification; Uroflow Pattern; Flow Index; Weighted Grade

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lin, C. (2016). A Weight-based Approach to the Classification of Uroflowmetry Curves. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0411116-205333

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

Lin, Chi-Chih. “A Weight-based Approach to the Classification of Uroflowmetry Curves.” 2016. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0411116-205333.

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

MLA Handbook (7th Edition):

Lin, Chi-Chih. “A Weight-based Approach to the Classification of Uroflowmetry Curves.” 2016. Web. 09 May 2021.

Vancouver:

Lin C. A Weight-based Approach to the Classification of Uroflowmetry Curves. [Internet] [Thesis]. NSYSU; 2016. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0411116-205333.

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

Council of Science Editors:

Lin C. A Weight-based Approach to the Classification of Uroflowmetry Curves. [Thesis]. NSYSU; 2016. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0411116-205333

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


NSYSU

27. Yen, Ching-Yi. A Non-overlapping Approach to Mining Spatial Co-location Patterns in the Incremental Spatial Database.

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

 With the explosive increase of the amount of information in recent years, the research on the big data has become an inevitable topic of the… (more)

Subjects/Keywords: Spatial Database; Incremental Database; Spatial Co-location Patterns; Spatial Co-location Rules; Spatial Data Mining

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yen, C. (2018). A Non-overlapping Approach to Mining Spatial Co-location Patterns in the Incremental Spatial Database. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0525118-085901

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

Yen, Ching-Yi. “A Non-overlapping Approach to Mining Spatial Co-location Patterns in the Incremental Spatial Database.” 2018. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0525118-085901.

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

MLA Handbook (7th Edition):

Yen, Ching-Yi. “A Non-overlapping Approach to Mining Spatial Co-location Patterns in the Incremental Spatial Database.” 2018. Web. 09 May 2021.

Vancouver:

Yen C. A Non-overlapping Approach to Mining Spatial Co-location Patterns in the Incremental Spatial Database. [Internet] [Thesis]. NSYSU; 2018. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0525118-085901.

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

Council of Science Editors:

Yen C. A Non-overlapping Approach to Mining Spatial Co-location Patterns in the Incremental Spatial Database. [Thesis]. NSYSU; 2018. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0525118-085901

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


NSYSU

28. Du, Siang-Jia. An InvP-List Algorithm with the Local Estimated Factor for Mining Weighted Erasable Itemsets over the Incremental Database.

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

 An erasable itemset is the low profit itemset in the product database, and it is strongly concerned in some applications, including retail market analysis and… (more)

Subjects/Keywords: Local Estimated; Weight Constraint; Erasable Itemset; Frequent Patterns; Itemset Pruning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Du, S. (2018). An InvP-List Algorithm with the Local Estimated Factor for Mining Weighted Erasable Itemsets over the Incremental Database. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0603118-162333

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

Du, Siang-Jia. “An InvP-List Algorithm with the Local Estimated Factor for Mining Weighted Erasable Itemsets over the Incremental Database.” 2018. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0603118-162333.

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

MLA Handbook (7th Edition):

Du, Siang-Jia. “An InvP-List Algorithm with the Local Estimated Factor for Mining Weighted Erasable Itemsets over the Incremental Database.” 2018. Web. 09 May 2021.

Vancouver:

Du S. An InvP-List Algorithm with the Local Estimated Factor for Mining Weighted Erasable Itemsets over the Incremental Database. [Internet] [Thesis]. NSYSU; 2018. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0603118-162333.

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

Council of Science Editors:

Du S. An InvP-List Algorithm with the Local Estimated Factor for Mining Weighted Erasable Itemsets over the Incremental Database. [Thesis]. NSYSU; 2018. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0603118-162333

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


NSYSU

29. Chen, Huei-Yang. Automatic Detection of the Asymmetric Intervals of EEG by Using the Correlation Analysis of Amplitudes.

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

 The electroencephalography is a common and valuable tool for research and diagnosis, especially when millisecond-range temporal resolution is required. EEG is usually used to diagnose… (more)

Subjects/Keywords: SVM; Frontal Asymmetry; EEG; Detection; Asymmetric Intervals

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, H. (2017). Automatic Detection of the Asymmetric Intervals of EEG by Using the Correlation Analysis of Amplitudes. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0518117-170526

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

Chen, Huei-Yang. “Automatic Detection of the Asymmetric Intervals of EEG by Using the Correlation Analysis of Amplitudes.” 2017. Thesis, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0518117-170526.

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

MLA Handbook (7th Edition):

Chen, Huei-Yang. “Automatic Detection of the Asymmetric Intervals of EEG by Using the Correlation Analysis of Amplitudes.” 2017. Web. 09 May 2021.

Vancouver:

Chen H. Automatic Detection of the Asymmetric Intervals of EEG by Using the Correlation Analysis of Amplitudes. [Internet] [Thesis]. NSYSU; 2017. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0518117-170526.

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

Council of Science Editors:

Chen H. Automatic Detection of the Asymmetric Intervals of EEG by Using the Correlation Analysis of Amplitudes. [Thesis]. NSYSU; 2017. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0518117-170526

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

30. Wu, Chen-Chang. Efficient Access Methods on the Hilbert Curve.

Degree: PhD, Computer Science and Engineering, 2012, NSYSU

 The design of multi-dimensional access methods is difficult as compared to those of one-dimensional case because of no total ordering that preserves spatial locality. One… (more)

Subjects/Keywords: Image Processing; Hilbert Curve; Space Filling Curve; Window Query; Image Compression

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wu, C. (2012). Efficient Access Methods on the Hilbert Curve. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0618112-141752

Chicago Manual of Style (16th Edition):

Wu, Chen-Chang. “Efficient Access Methods on the Hilbert Curve.” 2012. Doctoral Dissertation, NSYSU. Accessed May 09, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0618112-141752.

MLA Handbook (7th Edition):

Wu, Chen-Chang. “Efficient Access Methods on the Hilbert Curve.” 2012. Web. 09 May 2021.

Vancouver:

Wu C. Efficient Access Methods on the Hilbert Curve. [Internet] [Doctoral dissertation]. NSYSU; 2012. [cited 2021 May 09]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0618112-141752.

Council of Science Editors:

Wu C. Efficient Access Methods on the Hilbert Curve. [Doctoral Dissertation]. NSYSU; 2012. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0618112-141752

[1] [2]

.