• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.2
• /
• pp.141-147
• /
• 2001

소프트웨어의 측정값에 근거하여 소프트웨어 품질에 관한 의사결정을 할 때, 동치관계의 요구조건인 추이적(transitive) 특성이 항상 만족되는 것은 아니다. 순환수(cyclomatic number)가 거의 비슷한 프로그램에서, 하나의 \"구조적인\" 프로그램 범주에 속하고 또 다른 하나는 \"비구조적인\" 프로그램 범주에 속한다고 명확히 분류할 수 있는가하는 점이다. 따라서, 본 연구에서는 동치관계보다는 허용적 관계를 만족하는 허용적 러프집합에 근거한 소프트웨어 분류기준을 제시하고자 한다. 분류기준을 생성하기 위한 실험 데이터 집합을 수집하고, 집합 내의 각 원소에 관한 허용적 클래스들을 생성한 후, 각 허용적 클래스들의 중심값을 클러스터링하여 분류기준을 생성한다. 생성된 분류기준을 또 다른 실험 집합에 적용하여 비교 분석한 결과 생성된 분류기준이 타당함을 보여준다.생성된 분류기준이 타당함을 보여준다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.2
• /
• pp.249-253
• /
• 2004

When we decide the software quality on the basis of the software measurement, the transitive property which is a requirement for an equivalence relation is not always satisfied. Therefore, we propose a scheme for classifying the software quality that employs a tolerance relation instead of an equivalence relation. Given the experimental data set, the proposed scheme generates the tolerant classes for elements in the experiment data set, and generates the tolerant ranges for classifying the software quality by clustering the means of the tolerance classes. Through the experiment, we showed that the proposed scheme could product very useful and valid results. That is, it has no problems that we use as the criteria for classifying the software quality the tolerant ranges generated by the proposed scheme.

• Journal of KIISE:Software and Applications
• /
• v.32 no.9
• /
• pp.901-911
• /
• 2005

With the development of e-commerce and the proliferation of easily accessible information, information filtering has become a popular technique to prune large information spaces so that users are directed toward those items that best meet their needs and preferences. While many collaborative filtering systems have succeeded in capturing the similarities among users or items based on ratings to provide good recommendations, there are still some challenges for them to be more efficient, especially the user bias problem, non-transitive association problem and cold start problem. Those three problems impede us to capture more accurate similarities among users or items. In this paper, we provide probabilistic model approaches for UCHM and ICHM which are suggested to solve the addressed problems in hopes of achieving better performance. In this probabilistic model, objects (users or items) are classified into groups and predictions are made for users considering the Gaussian distribution of user ratings. Experiments on a real-word data set illustrate that our proposed approach is comparable with others.

• The Journal of Korean Association of Computer Education
• /
• v.5 no.2
• /
• pp.11-19
• /
• 2002

In this paper, we present a simple statistical method for performing word sense disambiguation(WSD), specially for Korean transitive verbs, based on a supervised learning algorithm. This approach combines a set of indicators based on syntactic relations between surrounding words and an ambiguous verb. Experiments with 10 Korean verbs show that accuracy performance of our WSD method using indicators based on syntactic relations is 27% higher than the baseline performance. Moreover, our method using weighting mechanism based on each indicator type is 12% higher than a method which uses only an unordered set of surrounding words in the context.

• Honam Mathematical Journal
• /
• v.42 no.2
• /
• pp.219-234
• /
• 2020

The fundamental relation on a fuzzy hyperring is defined as the smallest equivalence relation, such that the quotient would be the ring, that is not commutative necessarily. In this paper, we introduce a new fuzzy strongly regular equivalence on fuzzy hyperrings, where the ring is commutative with respect to both sum and product. With considering this relation on fuzzy hyperring, the set of the quotient is a commutative ring. Also, we introduce fundamental functor between the category of fuzzy hyperrings and category of commutative rings and some related properties. Eventually, we introduce α-part in fuzzy hyperring and determine some necessary and sufficient conditions so that the relation α is transitive.

• Bulletin of the Korean Mathematical Society
• /
• v.32 no.1
• /
• pp.35-43
• /
• 1995

IF R is a left Artinian ring with identity, G is the group of units of R and X is the set of nonzero, nonunits of R, then G acts naturally on X by conjugation. It is shown that if the conjugate action on X by G is trivial, that is, gx = xg for all $g \in G$ and all $x \in X$, then R is a commutative ring. It is also shown that if the conjegate action on X by G is transitive, then R is a local ring and $J^2 = (0)$ where J is the Jacobson radical of R. In addition, if G is a simple group, then R is isomorphic to $Z_2 [x]/(x^2 + 1) or Z_4$.

• Bulletin of the Korean Mathematical Society
• /
• v.42 no.4
• /
• pp.807-815
• /
• 2005

Let R be a ring with identity, X the set of all nonzero, nonunits of Rand G the group of all units of R. We will consider two group actions on X by G, the regular action and the conjugate action. In this paper, by investigating two group actions we can have some results as follows: First, if G is a finitely generated abelian group, then the orbit O(x) under the regular action on X by G is finite for all nilpotents x $\in$ X. Secondly, if F is a field in which 2 is a unit and F $\backslash\;\{0\}$ is a finitley generated abelian group, then F is finite. Finally, if G in a unit-regular ring R is a torsion group and 2 is a unit in R, then the conjugate action on X by G is trivial if and only if G is abelian if and only if R is commutative.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.443-446
• /
• 2007

A new association rule mining algorithm, which reflects the strategic importance of associative relationships between items, was developed and presented in this paper. This algorithm exploits the basic framework of Apriori procedures and TSAA(transitive support association Apriori) procedure developed by Hyun and Choi in evaluating non-frequent itemsets. The algorithm considers the strategic importance(weight) of feature variables in the association rule mining process. Sample feature variables of strategic importance include: profitability, marketing value, customer satisfaction, and frequency. A database with 730 transaction data set of a large scale discount store was used to compare and verify the performance of the presented algorithm against the existing Apriori and TSAA algorithms. The result clearly indicated that the new algorithm produced substantially different association itemsets according to the weights assigned to the strategic feature variables.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.05a
• /
• pp.307-310
• /
• 2000

소프트웨어의 측정값에 근거하여 소프트웨어 품질에 관한 의사결정을 할 때, 동치관계의 요구조건인 추이적(transitive) 특성이 항상 만족되는 것은 아니다. 순환수(cyclomatic number)가 거의 비슷한 프로그램에서, 하나는 "구조적인" 프로그램 범주에 속하고 또 다른 하나는 비구조적인 프로그램 범주에 속한다고 명확히 분류 할 수 있는가하는 점이다. 따라서, 본 연구에서는 동치관계보다는 허용적 관계를 만족하는 허용적 러프집합에 근거한 소프트웨어 분류 기준 제시하고자 한다. 분류기준을 생성하기 위한 실험 데이터 집합을 수집하고, 집합 내의 각 원소에 관한 허용적 클래스들을 생성한 후, 각 허용적 클래스들의 중심값을 클러스터링하여 분류기준을 생성한다. 생성된 분류기준을 또 다른 실험 집합에 적용하여 비교 분석하여 생성된 분류기준이 타당함을 보여준다.

• Journal of the Korean Society for Precision Engineering
• /
• v.13 no.7
• /
• pp.100-114
• /
• 1996

In order to create a solid model more efficiently for a plastic or sheet metal product with a thin and constant thickness, various methods have been proposed up to now. One of the most typical approaches is to create a sheet model initially and then transform it into a solid model automatically for a given thickness. The sheet model as well as the transitive model in sheet modeling procedure is a non-manifold model. However, the previous methods adopted the boundary representations for a solid model as their topological framework. Thus, it is difficult to represent the exact adjacency relationship between topological entities and to implement the topological operations for sheet modeling and the transformation procedure of a sheet into a solid. In this paper, we proposed a sheet modeling system based on a non-manifold topological representation which can represent solids, sheets, wireframes, and their mixture. A set of generalized Euler operators for non-manifold topology as well as the sheet modeling capabilities including adding, bending, and punching functions are provided for easy modeling of sheet objects, and they are perfomed interactively with a two dimensional curve editor. Once a sheet model is completed, it can be transformed into a solid automatically. The transformation procedure is composed of the offset functions and the Boolean operations of sheet models, and it is even more comprehensive and easier to be implemented than the precious methods.