• Communications for Statistical Applications and Methods
• /
• 제9권3호
• /
• pp.607-618
• /
• 2002

Crossover design is often used in clinical trials about chronic diseases like hypertension, asthma and arthritis. In this paper, we suggest nonparametric approaches of Friedman-type rank test based on Bernard-van Elteren test and of aligned method keeping the information of blocks based on the AB/BA/AA/BB crossover design. The simulation results are presented to compare experimental error and power of several methods.

• Communications for Statistical Applications and Methods
• /
• 제7권2호
• /
• pp.574-574
• /
• 2000

Consider the problem of estimating regression function from a set of data which is contaminated by a long-tailed error distribution. The linear smoother is a kind of a local weighted average of response, so it is not robust against outliers. The kernel M-smoother and the lowess attain robustness against outliers by down-weighting outliers. However, the kernel M-smoother and the lowess requires the iteration for computing the robustness weights, and as Wang and Scott(1994) pointed out, the requirement of iteration is not a desirable property. In this article, we propose the robust nonparametic regression method which does not require the iteration. Robustness can be achieved not only by down-weighting outliers but also by transforming outliers. The rank transformation is a simple procedure where the data are replaced by their corresponding ranks. Iman and Conover(1979) showed the fact that the rank transformation is a robust and powerful procedure in the linear regression. In this paper, we show that we can also use the rank transformation to nonparametric regression to achieve the robustness.

• Communications for Statistical Applications and Methods
• /
• 제7권2호
• /
• pp.575-583
• /
• 2000

Consider the problem of estimating regression function from a set of data which is contaminated by a long-tailed error distribution. The linear smoother is a kind of a local weighted average of response, so it is not robust against outliers. The kernel M-smoother and the lowess attain robustness against outliers by down-weighting outliers. However, the kernel M-smoother and the lowess requires the iteration for computing the robustness weights, and as Wang and Scott(1994) pointed out, the requirement of iteration is not a desirable property. In this article, we propose the robust nonparametic regression method which does not require the iteration. Robustness can be achieved not only by down-weighting outliers but also by transforming outliers. The rank transformation is a simple procedure where the data are replaced by their corresponding ranks. Iman and Conover(1979) showed the fact that the rank transformation is a robust and powerful procedure in the linear regression. In this paper, we show that we can also use the rank transformation to nonparametric regression to achieve the robustness.

• Journal of applied mathematics & informatics
• /
• 제23권1_2호
• /
• pp.113-126
• /
• 2007

Let A and E be $m{\times}n$ matrices and W an $n{\times}m$ matrix, and let $A_{d,w}$ denote the W-weighted Drazin inverse of A. In this paper, a new representation of the W-weighted Drazin inverse of A is given. Some new properties for the W-weighted Drazin inverse $A_{d,w}\;and\;B_{d,w}$ are investigated, where B=A+E. In addition, the Banach-type perturbation theorem for the W-weighted Drazin inverse of A and B are established, and the perturbation bounds for ${\parallel}B_{d,w}{\parallel}\;and\;{\parallel}B_{d,w}-A_{d,w}{\parallel}/{\parallel}A_{d,w}{\parallel}$ are also presented. When A and B are square matrices and W is identity matrix, some known results in the literature related to the Drazin inverse and the group inverse are directly reduced by the results in this paper as special cases.

• 한국멀티미디어학회논문지
• /
• 제21권7호
• /
• pp.772-778
• /
• 2018

We have previously proposed a preliminary cut-off indoor positioning scheme considering the reference point with the same signal similarity. This scheme estimates the position using the relative rank of the peak of received signal strength from the beacons around user. However, this scheme has a weak point with lower accuracy when there are more than one nearest reference points having the same signal similarity. In order to tackle this, we propose a weighted preliminary cut-off indoor positioning scheme. Firstly, if the above problem occurs, the similarity to the peak of signal strength is considered as well as the relative rank. Next, weights are assigned to the nearest reference points using the similarity to the peak of the received signal strength. Finally, the user's position is estimated by applying the weights. As a result, the weighted preliminary cut-off scheme improves the positioning accuracy by about 7.9% compared to the previous scheme.

• Journal of applied mathematics & informatics
• /
• 제22권1_2호
• /
• pp.95-112
• /
• 2006

In this paper, the authors investigate the condition number with their condition numbers for weighted Moore-Penrose inverse and weighted least squares solution of min /Ax - b/M, where A is a rank-deficient complex matrix in $C^{m{\times}n} $ and b a vector of length m in $C^m$, x a vector of length n in $C^n$. For the normwise condition number, the sensitivity of the relative condition number itself is studied, the componentwise perturbation is also investigated.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2014년도 춘계 종합학술대회 논문집
• /
• pp.21-22
• /
• 2014

• 정보관리학회지
• /
• 제31권3호
• /
• pp.153-179
• /
• 2014

이 연구의 목적은 공동연구 네트워크에서 연구자의 영향력과 입지를 분석하는데 사용되는 중심성 지수들의 특징에 대해서 고찰하는 것이다. 전통적인 이진 네트워크 중심성 지수로는 연결정도중심성, 매개중심성, 근접중심성, 페이지랭크를 다루었고, 공동연구 네트워크에서의 중심성을 측정하기 위해서 개발되었거나 사용된 가중 네트워크 중심성 지수로는 삼각매개중심성, 평균연관성, 가중페이지랭크, 공동연구 h-지수와 공동연구 hs-지수, 복합연결정도중심성, c-지수에 대해서 살펴보았으며, 새로운 지수로 제곱근합 지수 SSR을 제안하였다. 이들 12종의 중심성 지수를 건축학, 문헌정보학, 마케팅 분야의 세 가지 공동연구 네트워크에 적용해본 결과 각 지수들의 특성과 지수 간 관계를 파악할 수 있었다. 분석 결과 공동연구 네트워크에서 공동연구 범위와 공동연구 강도를 모두 고려하기 위해서는 가중 네트워크 중심성 지수를 사용해야 하는 것으로 나타났다. 특히 공동연구 범위와 강도를 모두 고려하는 전역중심성을 측정하기 위해서는 삼각매개중심성 지수를 사용하고, 지역중심성을 측정하기 위해서는 SSR 지수를 사용하는 것이 바람직하다고 제안하였다.

• Communications for Statistical Applications and Methods
• /
• 제3권3호
• /
• pp.195-204
• /
• 1996

Some rank tests for comparing r treatments against ordered alternatives are proposed when some of data are randomly cemsored, which are the weighted logrank tests based on pairwise-ranking scheme. The covariances of the proposed test statistics are explicitly obtained from the results of the counting process theory and the test procedures are illustrated by a numerical example. Simulation studies are also performed for comparing with the other well-known tests.

• 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.