• 대한수학회지
• /
• 제40권6호
• /
• pp.943-950
• /
• 2003

The maximal column rank of an m by n matrix A over max algebra is the maximal number of the columns of A which are linearly independent. We compare the maximal column rank with rank of matrices over max algebra. We also characterize the linear operators which preserve the maximal column rank of matrices over max algebra.

• 전자공학회논문지CI
• /
• 제46권5호
• /
• pp.14-28
• /
• 2009

PageRank 알고리즘은 구글(Google)등의 검색 엔진에서 웹 페이지의 순위(rank)를 정하는 중요한 요소이다. PageRank 알고리즘의 순위 품질(ranking quality)을 향상시키기 위해 많은 변형 알고리즘들이 제안되었지만 어떤 변형 알고리즘(혹은 변형 알고리즘들간의 조합)이 가장 좋은 순위 품질을 제공하는지가 명확하지 않다. 본 논문에서는 PageRank 알고리즘의 잘 알려진 변형 알고리즘들과 그들 간의 조합들에 대해 순위 품질을 평가한다. 이를 위해, 먼저 변형 알고리즘들을 웹의 링크(link) 구조를 이용하는 링크기반 방법(Link-based approaches)과 웹의 의미 정보를 이용하는 지식기반 방법(Knowledge-based approaches)으로 분류한다. 다음으로, 이 두 가지 방법에 속하는 알고리즘들을 조합한 알고리즘들을 제안하고, 변형 알고리즘들과 그들을 조합한 알고리즘들을 구현한다. 백만 개의 웹 페이지들로 구성된 실제 데이터에 대한 실험을 통해 PageRank의 변형 알고리즘들과 그들 간의 조합들로부터 가장 좋은 순위 품질을 제공하는 알고리즘을 찾는다.

• 대한산업공학회지
• /
• 제40권1호
• /
• pp.18-33
• /
• 2014

A Word is the smallest unit for text analysis, and the premise behind most text-mining algorithms is that the words in given documents can be perfectly recognized. However, the newly coined words, spelling and spacing errors, and domain adaptation problems make it difficult to recognize words correctly. To make matters worse, obtaining a sufficient amount of training data that can be used in any situation is not only unrealistic but also inefficient. Therefore, an automatical word extraction method which does not require a training process is desperately needed. WordRank, the most widely used unsupervised word extraction algorithm for Chinese and Japanese, shows a poor word extraction performance in Korean due to different language structures. In this paper, we first discuss why WordRank has a poor performance in Korean, and propose a customized WordRank algorithm for Korean, named KR-WordRank, by considering its linguistic characteristics and by improving the robustness to noise in text documents. Experiment results show that the performance of KR-WordRank is significantly better than that of the original WordRank in Korean. In addition, it is found that not only can our proposed algorithm extract proper words but also identify candidate keywords for an effective document summarization.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제16권1호
• /
• pp.110-114
• /
• 2010

본 논문에서는 TextRank 알고리즘을 이용한 문서 범주화 방법에 대해 기술한다. TextRank 알고리즘은 그래프 기반의 순위화 알고리즘이다. 문서에서 나타나는 각각의 단어를 노드로, 단어들 사이의 동시출현성을 이용하여 간선을 만들면 문서로부터 그래프를 생성할 수 있다. TextRank 알고리즘을 이용하여 생성된 그래프로부터 중요도가 높은 단어를 선택하고, 그 단어와 인접한 단어를 묶어 하나의 자질로 사용하여 문서 분류를 수행하였다. 동시출현 자질(인접한 단어 쌍)은 단어 하나가 갖는 의미를 보다 명확하게 만들어주므로 문서 분류에 좋은 자질로 사용될 수 있을 것이라 가정하였다. 문서 분류기로는 지지 벡터 기계, 베이지언 분류기, 최대 엔트로피 모델, k-NN 분류기 등을 사용하였다. 20 Newsgroups 문서 집합을 사용한 실험에서 모든 분류기에서 제안된 방법을 사용했을 때, 문서 분류 성능이 향상된 결과를 확인할 수 있었다.

• Asia pacific journal of information systems
• /
• 제25권3호
• /
• pp.548-562
• /
• 2015

The growing popularity of mobile application has led to researchers and practitioners needing to understand users' mobile application download behaviors. Using large-scale transaction data obtained from a leading Korean telecommunications company, we empirically explore how application download rank, which appears to users when they decide to download a new application, affects their extended mobile application download. This terminology refers to downloading an additional application in the same category as those that they have already downloaded. We also consider IT characteristics, user characteristics, and application type that might be associated with the extended application download. The analysis generates the following result. Overall, a higher rank of a new application encourages the extended application download, but the linear relationship between the rank and the extended application download disappears when critical rank points are incorporated into the model. Further, no quadratic effect of rank is found in the extended application download. Based on the results, we suggest theoretical and managerial implications.

• Journal of the Korean Data and Information Science Society
• /
• 제15권3호
• /
• pp.617-624
• /
• 2004

In this article the fuzzy number rank and the fuzzy rank transformation method are introduced in order to analyse the non-parametric fuzzy regression model which cannot be described as a specific functional form such as the crisp data and fuzzy data as a independent and dependent variables respectively. The effectiveness of fuzzy rank transformation methods is compared with other methods through the numerical examples.

• 대한수학회지
• /
• 제41권2호
• /
• pp.397-406
• /
• 2004

For a Boolean rank-l matrix $A\;=\;ab^{t}$, we define the perimeter of A as the number of nonzero entries in both a and b. We characterize the Boolean linear operators that preserve rank and perimeter of Boolean rank-l matrices.

• 대한수학회지
• /
• 제52권3호
• /
• pp.625-636
• /
• 2015

The Boolean rank of a nonzero $m{\times}n$ Boolean matrix A is the least integer k such that there are an $m{\times}k$ Boolean matrix B and a $k{\times}n$ Boolean matrix C with A = BC. We investigate the structure of linear transformations T : $\mathbb{M}_{m,n}{\rightarrow}\mathbb{M}_{p,q}$ which preserve Boolean rank. We also show that if a linear transformation preserves the set of Boolean rank 1 matrices and the set of Boolean rank k matrices for any k, $2{\leq}k{\leq}$ min{m, n} (or if T strongly preserves the set of Boolean rank 1 matrices), then T preserves all Boolean ranks.

• Journal of applied mathematics & informatics
• /
• 제19권1_2호
• /
• pp.253-260
• /
• 2005

Denote the set of n ${\times}$ n complex Hermitian matrices by Hn. A pair of n ${\times}$ n Hermitian matrices (A, B) is said to be rank-additive if rank (A+B) = rank A+rank B. We characterize the linear maps from Hn into itself that preserve the set of rank-additive pairs. As applications, the linear preservers of adjoint matrix on Hn and the Jordan homomorphisms of Hn are also given. The analogous problems on the skew Hermitian matrix space are considered.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권1호
• /
• pp.1-19
• /
• 2021

The graph-based tag recommendation algorithm FolkRank can effectively utilize the relationships between three entities, namely users, items and tags, and achieve better tag recommendation performance. However, FolkRank does not consider the internal relationships of user-user, item-item and tag-tag. This leads to the failure of FolkRank to effectively map the tagging behavior which contains user neighbors and item neighbors to a tripartite graph. For item-item relationships, we can dig out items that are very similar to the target item, even though the target item may not have a strong connection to these similar items in the user-item-tag graph of FolkRank. Hence this paper proposes an improved FolkRank algorithm named FolkRank++, which fully considers the user-user and item-item internal relationships in tag recommendation by adding the correlation information between users or items. Based on the traditional FolkRank algorithm, an initial weight is also given to target user and target item's neighbors to supply the user-user and item-item relationships. The above work is mainly completed from two aspects: (1) Finding items similar to target item according to the attribute information, and obtaining similar users of the target user according to the history behavior of the user tagging items. (2) Calculating the weighted degree of items and users to evaluate their importance, then assigning initial weights to similar items and users. Experimental results show that this method has better recommendation performance.