Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Taeho Jo has a total of 24 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Table based Version of K Nearest Neighbor used for Text Summarization

    by Taeho Jo

    This article proposes the modified KNN (K Nearest Neighbor)algorithm which receives a table as its input data and is applied tothe text summarization. The table based algorithms workedsuccessfully in text mining tasks such as text categorization andtext clustering in previous works, and the text summarization isable to be viewed into a binary classification where each paragraphis classified into summary or non-summary. In the proposed system, atext which is given as the input is partitioned into a list ofparagraphs, each paragraph is classified by the proposed KNNversion, and the paragraphs which are classified into summary areextracted ad the output. The proposed KNN version is empiricallyvalidated as the better approach in deciding whether each paragraphis essential or not in news articles and opinions. In using thetable based KNN algorithm, it is easier to trace results fromcategorizing paragraphs.

  • Open Access

    Graph based Version of AHC Algorithm for Document Clustering

    by Taeho Jo

    This article proposes the modified AHC (Agglomerative HierarchicalClustering) algorithm which clusters graphs, instead of numericalvectors, as the approach to the text clustering. The graph is moregraphical for representing a word and the synergy effect between thetext clustering and the word clustering is expected by combiningthem with each other. In this research, we propose the similaritymetric between two graphs representing texts, and modify the AHCalgorithm by adopting the proposed similarity metric as the approachto the text clustering. The proposed AHC algorithm is empiricallyvalidated as the better approach in clustering texts in newsarticles and opinions. In this article, a text is encoded into aweighted and undirected graph and it is represented into a list ofedges.

  • Open Access

    Similarity Metric between Tables for Modifying AHC Algorithm in Text Clustering

    by Taeho Jo

    This article proposes the modified AHC (Agglomerative HierarchicalClustering) algorithm which clusters tables, instead of numericalvectors, as the approach to the text clustering. The motivations ofthis research are the successful results from applying the tablebased algorithms to the text clustering tasks in previous works andthe expectation of synergy effect between the text clustering andthe word clustering. In this research, we define the similaritymetric between tables representing texts, and modify the AHCalgorithm by adopting the proposed similarity metric as the approachto the text clustering. The proposed AHC algorithm is empiricallyvalidated as the better approach in clustering texts in newsarticles and opinions. In using the table based AHC algorithm, it iseasier to trace results from clustering texts.

  • Open Access

    Text Summarization using Feature Similarity based K Nearest Neighbor

    by Taeho Jo

    This article proposes the modified KNN (K Nearest Neighbor)algorithm which considers the feature similarity and is applied tothe text summarization. The words which are given as features forencoding words into numerical vectors have their own meanings andsemantic relations with others, and the text summarization is ableto be viewed into a binary classification where each paragraph isclassified into summary or non-summary. In the proposed system, atext which is given as the input is partitioned into a list ofparagraphs, each paragraph is classified by the proposed KNNversion, and the paragraphs which are classified into summary areextracted ad the output. The proposed KNN version is empiricallyvalidated as the better approach in deciding whether each paragraphis essential or not in news articles and opinions. The significanceof this research is to improve the classification performance byutilizing the feature similarities.

  • Open Access

    Feature Similarity based K Nearest Neighbor for Optimizing of Text Indexes

    by Taeho Jo

    This article proposes the modified KNN (K Nearest Neighbor)algorithm which considers the feature similarity and is applied tothe index optimization. The texts which are given as features forencoding words into numerical vectors are semantic related entities,rather than independent ones, and the index optimization is able tobe viewed into a classification task where each word is classifiedinto expansion, inclusion, and removal. In the proposed system, eachword in the given text is classified into one of the threecategories by the proposed KNN algorithm, associates words are addedto ones which are classified into expansion, and ones which areclassified into inclusion are kept by themselves without adding anyword. The proposed KNN version is empirically validated as thebetter approach in deciding the importance level of words in newsarticles and opinions. The significance of this research is toimprove the classification performance by utilizing the featuresimilarities.

  • Open Access

    Table based K Nearest Neighbor for Text Classification

    by Taeho Jo

    This article proposes the modified KNN (K Nearest Neighbor)algorithm which receives a table as its input data and is applied tothe text categorization. The motivations of this research are thesuccessful results from applying the table based algorithms to thetext categorizations in previous works and the expectation ofsynergy effect between the text categorization and the wordcategorization. In this research, we define the similarity metricbetween two tables representing texts, modify the KNN algorithm byreplacing the exiting similarity metric by the proposed one, andapply it to the text categorization. The proposed KNN is empiricallyvalidated as the better approach in categorizing texts in newsarticles and opinions. In using the table based KNN algorithm, it iseasier to trace results from categorizing texts.

  • Open Access

    Keyword Selection from Textual Data using Table based K Nearest Neighbor

    by Taeho Jo

    This article proposes the modified KNN (K Nearest Neighbor)algorithm which receives a table as its input data and is applied tothe keyword extraction. The table based algorithms workedsuccessfully in text mining tasks such as text categorization andtext clustering in previous works, and the keyword extraction isable to be mapped into the binary classification where each word isclassified into keyword or non-keyword. In the proposed system, atext which is given as the input is indexed into a list of words,each word is classified by the proposed KNN version, and the wordswhich are classified into keyword are extracted ad the output. Theproposed KNN version is empirically validated as the better approachin deciding whether each word is a keyword or non-keyword in newsarticles and opinions. In using the table based KNN algorithm, it iseasier to trace results from categorizing words.

  • Open Access

    Modification of K Nearest Neighbor by Graph Similarity Metric for Keyword Extraction

    by Taeho Jo

    This article proposes the modified KNN (K Nearest Neighbor)algorithm which receives a graph as its input data and is applied tothe keyword extraction. The graph is more graphical for representinga word and the keyword extraction is able to be mapped into thebinary classification where each word is classified into keyword ornon-keyword. In the proposed system, a text which is given as theinput is indexed into a list of words, each word is classified bythe proposed KNN version, and the words which are classified intokeyword are extracted ad the output. The proposed KNN version isempirically validated as the better approach in deciding whethereach word is a keyword or non-keyword in news articles and opinions.In this article, a word is encoded into a weighted and undirectedgraph and it is represented into a list of edges.

  • Open Access

    K Nearest Neghbor modified into String Vector based Version for Keyword Extraction

    by Taeho Jo

    This article proposes the modified KNN (K Nearest Neighbor)algorithm which receives a string vector as its input data and isapplied to the keyword extraction. The results from applying thestring vector based algorithms to the text categorizations weresuccessful in previous works and the keyword extraction is able tobe mapped into the binary classification where each word isclassified into keyword or non-keyword. In the proposed system, atext which is given as the input is indexed into a list of words,each word is classified by the proposed KNN version, and the wordswhich are classified into keyword are extracted ad the output. Theproposed KNN version is empirically validated as the better approachin deciding whether each word is a keyword or non-keyword in newsarticles and opinions. We need to define and characterizemathematically more operations on string vectors for modifying moreadvanced machine learning algorithms.

  • Open Access

    Specializing K Nearest Neighbor into String Vector based Version using String Vector Operation in Index Optimization

    by Taeho Jo

    This article proposes the modified KNN (K Nearest Neighbor)algorithm which receives a string vector as its input data and isapplied to the index optimization. The results from applying thestring vector based algorithms to the text categorizations weresuccessful in previous works, and the index optimization is able tobe viewed into a classification task where each word is classifiedinto expansion, inclusion, and removal. In the proposed system, eachword in the given text is classified into one of the threecategories by the proposed KNN algorithm, associates words are addedto ones which are classified into expansion, and ones which areclassified into inclusion are kept by themselves without adding anyword. The proposed KNN version is empirically validated as thebetter approach in deciding the importance level of words in newsarticles and opinions. We need to define and characterizemathematically more operations on string vectors for modifying moreadvanced machine learning algorithms.