• KSCI Review
• /
• v.14 no.2
• /
• pp.177-183
• /
• 2006

Today, corporation's business support system is intending web environment. However difficulty by elements of tool that Hyeoneop can support web program development efficiently standing be and is. Specially, is suffering difficulty relation data base system and development of wormed web connection program. Because using candidate key attribute of database at web program development in this research hereupon, wish to computerize web development process, and present algorithm that can develop web program efficiently.

• Proceedings of the IEEK Conference
• /
• 2003.11b
• /
• pp.207-210
• /
• 2003

In this paper, we explore a new data mining capability that is based on Quantitative Attribute and Time Series. Our solution procedure consists of two steps. First, We derive an algorithm to contain the Quantitative Attribute into a set of candidate item. Second, We redefine the concepts of confidence and support for composite association rules. It is shown that proposed methode is very advantageous and can lead to prominent performance improvement.

• Korean Journal of Geomatics
• /
• v.1 no.1
• /
• pp.43-49
• /
• 2001

Although many kinds of stereo matching method have been developed in the field of computer vision and photogrammetry, wrong matches are not easy to avoid. This paper presents a new method to reduce wrong matches after matching, and experimental results are reported. The main idea is to analyze the histogram of the image attribute differences between each pair of image patches matched. Typical image attributes of image patch are the mean and the standard deviation of gray value for each image patch, but there could be other kinds of image attributes. Another idea is to check relative position among potential matches. This paper proposes to use Gaussian blunder filter to detect the suspicious pair of candidate match in relative position among neighboring candidate matches. If the suspicious candidate matches in image attribute difference or relative position are suppressed, then many wrong matches are removed, but minimizing the suppression of good matches. The proposed method is easy to implement, and also has potential to be applied as post processing after image matching for many kinds of matching methods such as area based matching, feature matching, relaxation matching, dynamic programming, and multi-channel image matching. Results show that the proposed method produces fewer wrong matches than before.

• Nuclear Engineering and Technology
• /
• v.48 no.1
• /
• pp.26-32
• /
• 2016

Research and development (R&D) methodology for the practical use of accident tolerant fuel (ATF) in commercial light water reactors is discussed in the present review. The identification and quantification of the R&D-metrics and the attribute of candidate ATF-concepts, recognition of the gap between the present R&D status and the targeted practical use, prioritization of the R&D, and technology screening schemes are important for achieving a common understanding on technology screening process among stakeholders in the near term and in developing an efficient R&D track toward practical use. Technology readiness levels and attribute guides are considered to be proper indices for these evaluations. In the midterm, the selected ATF-concepts will be developed toward the technology readiness level-5, at which stage the performance of the prototype fuel rods and the practicality of industrial scale fuel manufacturing will be verified and validated. Regarding the screened-out concepts, which are recognized to have attractive potentials, the fundamental R&D should be continued in the midterm to find ways of addressing showstoppers.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5229-5252
• /
• 2016

With proliferation of diverse network access technologies, users demands are also increasing and service providers are offering a Quality of Service (QoS) to satisfy their customers. In roaming, a mobile node (MN) traverses number of available networks in the heterogeneous wireless networks environment and a single operator is not capable to fulfill the demands of user. It is crucial task for MN for selecting a best network from the list of networks at any time anywhere. A MN undergoes a network selection situation frequently when it is becoming away from the home network. Multiple Attribute Group Decision (MAGD) method will be one of the best ways for selecting target network in heterogeneous wireless networks (4G). MAGD network selection process is predominantly dependent on two steps, i.e., attribute weight, decision maker's (DM's) weight and aggregation of opinion of DMs. This paper proposes Multi-Attribute Intuitionistic Fuzzy Group Decision Method (MAIFGDM) using TOPSIS for the selection of the suitable candidate network. It is scalable and is able to handle any number of networks with large set of attributes. This is a method of lower complexity and is useful for real time applications. It gives more accurate result because it uses Intuitionistic Fuzzy Sets (IFS) with an additional parameter intuitionistic fuzzy index or hesitant degree. MAIFGDM is simulated in MATLAB for its evaluation. A comparative study of MAIFDGM is also made with TOPSIS and Fuzzy-TOPSIS in respect to decision delay. It is observed that MAIFDGM have low values of decision time in comparison to TOPSIS and Fuzzy-TOPSIS methods.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.29 no.4
• /
• pp.413-420
• /
• 2011

This study is to extract landmark buildings for pedestrian navigation from the existing spatial data sets automatically. At first, we defined candidates for landmark based on sight of pedestrian, then extracted final landmark by evaluating attributes of each candidate. The attribute is evaluated with relative or absolute criteria depending on the nature of each attribute. Landmarks extracted through the proposed method are compared to existing landmarks for vehicle and assessment of the validity and the applicability is performed. As a result, extracted Landmarks are expected to help guiding pedestrian effectively.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.5
• /
• pp.575-580
• /
• 2011

With the increasing expectation on personalized medicine, it is getting importance to analyze medical information in molecular biology perspective. Gene expression data are one of representative ones to show the microscopic phenomena of biological activities. In gene expression data analysis, one of major concerns is to identify markers which can be used to predict disease occurrence, progression or recurrence in the molecular level. Existing markers candidate identification methods mainly depend on statistical hypothesis test methods. This paper proposes a search method based decision tree induction to identify candidate markers which consist of multiple genes. The propose method discretizes numeric expression level into three categorical values and allows candidate markers' genes to be expressed by their negation as well as categorical values. It is desirable to have some number of genes to be included in markers. Hence the method is devised to try to find candidate markers with restricted number of genes.

• Journal of Digital Convergence
• /
• v.11 no.8
• /
• pp.1-10
• /
• 2013

Even though the importance of reading voters' share of mind increases in political campaign, there is no research which analyzes engagement in perspective of political campaign. Therefore, the purpose of this research is to calculate political engagement index which is qualitative indicator about political campaign's immersion in candidate in perspective of engagement and provide scientific data for political advertisement and publicity strategy. For this purpose, A and B candidates who ran for 18th president in December 19th, 2012 are selected for subjects of the research. The young people whose voter participations are low in this presidential election are selected as subjects for responding questionnaire and are surveyed. This research is qualitative evaluation which tires to supplement a limit of qualitative analysis of content by surpassing quantitative evaluation including advertisement, promotion, public opinion on politics, ratings, etc. Evaluation attribute is designed to distribute 8 PEI into 0~100 score. If PEI is more than 50, then the score indicates immersion above average. If PEI is lower than 50, then the score indicates immersion below average. The model of the research will contribute to development of methodological research of political campaign strategy. Also, in the future, this model can be used as micro-targeting in each political campaign's election strategy.

• Journal of Computing Science and Engineering
• /
• v.1 no.2
• /
• pp.177-194
• /
• 2007

Index selection is one of the most important decisions to take in the physical design of relational data warehouses. Indices reduce significantly the cost of processing complex OLAP queries, but require storage cost and induce maintenance overhead. Two main types of indices are available: mono-attribute indices (e.g., B-tree, bitmap, hash, etc.) and multi-attribute indices (join indices, bitmap join indices). To optimize star join queries characterized by joins between a large fact table and multiple dimension tables and selections on dimension tables, bitmap join indices are well adapted. They require less storage cost due to their binary representation. However, selecting these indices is a difficult task due to the exponential number of candidate attributes to be indexed. Most of approaches for index selection follow two main steps: (1) pruning the search space (i.e., reducing the number of candidate attributes) and (2) selecting indices using the pruned search space. In this paper, we first propose a data mining driven approach to prune the search space of bitmap join index selection problem. As opposed to an existing our technique that only uses frequency of attributes in queries as a pruning metric, our technique uses not only frequencies, but also other parameters such as the size of dimension tables involved in the indexing process, size of each dimension tuple, and page size on disk. We then define a greedy algorithm to select bitmap join indices that minimize processing cost and verify storage constraint. Finally, in order to evaluate the efficiency of our approach, we compare it with some existing techniques.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.3
• /
• pp.360-366
• /
• 2008

The initial fuzzy partitions in fuzzy rule-based classification systems are determined by considering the domain region of each attribute with the given data, and the optimal classification boundaries within the fuzzy partitions can be discovered by tuning their parameters using various learning processes such as neural network, genetic algorithm, and so on. In this paper, we propose a selection method for fuzzy partition based on statistical information to maximize the performance of pattern classification without learning processes where statistical information is used to extract the uncertainty regions (i.e., the regions which the classification boundaries in pattern classification problems are determined) in each input attribute from the numerical data. Moreover the methods for extracting the candidate rules which are associated with the partition intervals generated by statistical information and for minimizing the coupling problem between the candidate rules are additionally discussed. In order to show the effectiveness of the proposed method, we compared the classification accuracy of the proposed with those of conventional methods on the IRIS and New Thyroid Cancer data. From experimental results, we can confirm the fact that the proposed method only considering statistical information of the numerical patterns provides equal to or better classification accuracy than that of the conventional methods.