• The Journal of the Korea Contents Association
• /
• v.11 no.3
• /
• pp.73-83
• /
• 2011

The question answering system shows the answers that are input by other users for user's question. In spite of many researches to try to enhance the satisfaction level of answers for user question, there is a essential limitation. So, the question answering system provides users with the method of recommendation of another questions that can satisfy user's intention with high probability as an auxiliary function. The method using the fuzzy relational product operator was proposed for recommending the questions that can includes largely the contents of the user's question. The fuzzy relational product operator is composed of the Kleene-Dienes operator to measure the implication degree by contents between two questions. However, Kleene-Dienes operator is not fit to be the right operator for finding a question answers pair that semantically includes a user question, because it was not designed for the purpose of finding the degree of semantic inclusion between two documents. We present a novel fuzzy implication operator that is designed for the purpose of finding question answer pairs by considering implication relation. The new operator calculates a degree that the question semantically implies the other question. We show the experimental results that the probability that users are satisfied with the searched results is increased when the proposed operator is used for recommending of question answering system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.3
• /
• pp.424-431
• /
• 2012

In information retrieval, search engine provide the rank of web page and the summary of the web page information to user. Snippet is a summaries information of representing web pages. Visiting the web page by the user is affected by the snippet. User sometime visits the wrong page with respect to user intention when uses snippet. The snippet extraction method is difficult to accurate comprehending user intention. In order to solve above problem, this paper proposes a new snippet extraction method using fuzzy implication operator and relevance feedback. The proposed method uses relevance feedback to expand the use's query. The method uses the fuzzy implication operator between the expanded query and the web pages to extract snippet to be well reflected semantic user's intention. The experimental results demonstrate that the proposed method can achieve better snippet extraction performance than the other methods.

• Kyungpook Mathematical Journal
• /
• v.53 no.3
• /
• pp.435-457
• /
• 2013

Using the Lukasiewicz 3-valued implication operator, the notion of an (${\alpha},{\beta}$)-intuitionistic fuzzy left (right) $h$-ideal of a hemiring is introduced, where ${\alpha},{\beta}{\in}\{{\in},q,{\in}{\wedge}q,{\in}{\vee}q\}$. We define intuitionistic fuzzy left (right) $h$-ideal with thresholds ($s,t$) of a hemiring R and investigate their various properties. We characterize intuitionistic fuzzy left (right) $h$-ideal with thresholds ($s,t$) and (${\alpha},{\beta}$)-intuitionistic fuzzy left (right) $h$-ideal of a hemiring R by its level sets. We establish that an intuitionistic fuzzy set A of a hemiring R is a (${\in},{\in}$) (or (${\in},{\in}{\vee}q$) or (${\in}{\wedge}q,{\in}$)-intuitionistic fuzzy left (right) $h$-ideal of R if and only if A is an intuitionistic fuzzy left (right) $h$-ideal with thresholds (0, 1) (or (0, 0.5) or (0.5, 1)) of R respectively. It is also shown that A is a (${\in},{\in}$) (or (${\in},{\in}{\vee}q$) or (${\in}{\wedge}q,{\in}$))-intuitionistic fuzzy left (right) $h$-ideal if and only if for any $p{\in}$ (0, 1] (or $p{\in}$ (0, 0.5] or $p{\in}$ (0.5, 1] ), $A_p$ is a fuzzy left (right) $h$-ideal. Finally, we prove that an intuitionistic fuzzy set A of a hemiring R is an intuitionistic fuzzy left (right) $h$-ideal with thresholds ($s,t$) of R if and only if for any $p{\in}(s,t]$, the cut set $A_p$ is a fuzzy left (right) $h$-ideal of R.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.2
• /
• pp.222-230
• /
• 2003

Once the medical knowledge-based system has been developed, it is essential to investigate the knowledge sources of the system because knowledge sources can affect the performance of the system in great deal. This paper presents the method and the results of the reliability test done on the medical knowledge-based system CLINAID. A knowledge source tested is Cardiovascular body system data used in CLINAID. The reliability test will be done by investigating structural relationships revealed by fuzzy relational method between the components of the knowledge sources of individual body systems using syndromes as its main component. These partitions are going to be compared with the syndromes elicited from the medical experts. This paper also reports the outcome of the computations using 7 implication operators performed on Cardiovascular body system data.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.449-449
• /
• 2000

Many researchers have studied architectures for non-Neumann's computers because of escaping its bottleneck. To avoid the bottleneck, a neuron-based computer has been developed. The computer has only neurons and their connections, which are constructed of the learning. But still it has information processing facilities, and at the same time, it is like as a simplified brain to make inference; it is called "neuron-computer". No instructions are considered in any neural network usually; however, to complete complex processing on restricted computing resources, the processing must be reduced to primitive actions. Therefore, we introduce the instructions to the neuron-computer, in which the most important function is implications. There is an implication represented by binary-operators, but general implications for multi-value or fuzzy logics can't be done. Therefore, we need to use Lukasiewicz' operator at least. We investigated a neuron-computer having instructions for general implications. If we use the computer, the effective inferences base on multi-value logic is executed rapidly in a small logical unit.