應用區域敏感雜湊進行中文文獻分類之研究

謝祥榆

3.237.71.247，Hello！

Close
Search Quick Search Advanced Search Publication Search	Personal Service Member Login Searching History Use Bonus Card SYMSKAN
Browse Browse by University of Graduate Thesis Browse by Pinyin of Graduate Thesis Browse by Conference Proceedings Topic Browse by Conference Proceedings Publisher Browse by Pinyin of Conference Proceedings Browse by eBook Category Browse by eBook Topic Browse by eBook Publisher
Customer Services Authorize Airiti Recommend a Journal

Search Symbol (Half-width)	Description of Search Symbols
Space	"AND" indicates the intertwining of key terms used in a search
Double Quotation Marks ("") ( " " )	Double quotation marks indicate the beginning and end of a phrase, and the search will only include terms that appear in the same order of those within the quotations. Example: "image process" ： " image process "
?	Indicates a variable letter. Entering two ? will indicate two variable letters, and so on. Example: "Appl?", search results will yield apple, apply… e , appl y … ( (often used to English word searches) )
*	Indicates an unlimited number of variable letters to follow, from 1~n. Example: Enter "appl*", search results will yield apple, apples, apply, applied, application…(often used in English word searches) e , appl es , appl y , appl ied , appl ication … ( (often used to English word searches) )
AND、OR、NOT	Boolean logic combinations of key words is a skill used to expand or refine search parameters. (1) AND (1) AND: Refines search parameters (2) OR (2) OR: Expands search parameters (3) NOT: Excludes irrelevant parameters

DOI stands for Digital Object Identifier （ D igital O bject I dentifier ） ,
and is the unique identifier for objects on the internet. It can be used to create persistent link and to cite articles.

Using DOI as a persistent link

To create a persistent link, add「http://dx.doi.org/」「 http://dx.doi.org/ 」 before a DOI.
For instance, if the DOI of an article is 10.5297/ser.1201.002 , you can link persistently to the article by entering the following link in your browser: http://dx.doi.org/ 10.5297/ser.1201.002 。
The DOI link will always direct you to the most updated article page no matter how the publisher changes the document's position, avoiding errors when engaging in important research.

Cite a document with DOI

When citing references, you should also cite the DOI if the article has one. If your citation guideline does not include DOIs, you may cite the DOI link.

DOIs allow accurate citations, improve academic contents connections, and allow users to gain better experience across different platforms. Currently, there are more than 70 million DOIs registered for academic contents. If you want to understand more about DOI, please visit airiti DOI Registration （ doi.airiti.com ）。

Data Source

College of Business > Graduate School of Information Management
Social Sciences > Management

Bibliography Management Tool

Related Links

Report an Issue

Search in Library

There is no full-text available at the moment. Airiti would like to request author's authorization. I would like to provide authorization.

應用區域敏感雜湊進行中文文獻分類之研究

Classification of Chinese Document Corpora Using Locality Sensitive Hashing

謝祥榆 , Masters　　Advisor：陳宗天;何善輝　　

繁體中文

中文文獻分類；中文斷詞；區域敏感雜湊； Text Classification ； Chinese Tokenization ； Locality Sensitive Hashing ； Chinese Document Corpora

Abstract │ Reference (25) │ Times Cited (1) │ Altmetrics

Abstract 〈TOP〉

Parallel Abstract 〈TOP〉

Documents classification is an important technique that usually utilizes traditional text mining methods, which often involve several text pre-processing steps such as stop words removal and tokenization. However, text mining technique was developed to process English corpora, it is not directly applicable to process Chinese corpora. For example, terms or words are separated by leading and trailing spaces in English that makes the work of tokenizing English corpora straightforward. However, there are no spaces between words in Chinese corpora that makes tokenizing the Chinese corpora a daunting task. To overcome the difficulties of Chinese tokenization, we utilize an algorithm that doesn’t need tokenization called Locality Sensitive Hashing (LSH). It breaks a text file into strings (shinglings) of fixed length which is a language-neutral method.

We classified research papers from different research fields using LSH and VSM algorithm in conjunction with KNN method respectively, and compared their classification results. First, we collected 6 different topics, each topic includes 60 Chinese articles. And then we randomly chose 10 to 50 articles as the model training data, and the remaining articles as the test data. We calculated the accuracy of both classification methods and found their accuracy on par, which provides empirical evidence that the LSH algorithm could be used to classify Chinese papers properly.

Reference ( 25 ) 〈TOP〉

Andoni, A., & Indyk, P. (2006). Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Paper presented at the Foundations of Computer Science, 2006. FOCS'06. 47th Annual IEEE Symposium on.
連結：
Boyack, K. W., & Klavans, R. (2010). Co‐citation analysis, bibliographic coupling, and direct citation: Which citation approach represents the research front most accurately? Journal of the American Society for Information Science and Technology, 61(12), 2389-2404.
連結：
Chowdhury, G. (2010). Introduction to modern information retrieval: Facet publishing.
連結：
Chum, O., Philbin, J., & Zisserman, A. (2008). Near Duplicate Image Detection: min-Hash and tf-idf Weighting. Paper presented at the BMVC.
連結：
Hubert, L., & Arabie, P. (1985). Comparing partitions. Journal of classification, 2(1), 193-218.
連結：

Times Cited (1) 〈TOP〉

李治平(2016)。應用區域敏感雜湊對文獻進行分類之研究。臺北大學資訊管理研究所學位論文。2016。1-92。

Altmetrics

〈TOP〉

E-mail ：

When an article is available to download, a notice will be sent to your mailbox address.

E-mail ：