• Journal of Nutrition and Health
• /
• v.41 no.8
• /
• pp.797-808
• /
• 2008

This study has been carried out to obtain information related to food habits and snacking behaviors including health related behaviors. The subjects were 300 middle school students (144 boys and 156 girls). The results were as follows: Average height and weight of boys were 162.3 cm and 54.1 kg respectively. Those of girls were 159.8 cm and 49.0 kg respectively. 59.0% of the subjects of the subjects had 10,000-30,000 won as monthly allowances and their subjective health condition was good (55.7%). In the regularity of meal, 47.0% of the subjects had twice a day, the main reason for skipping meal was insufficient time to eat due to oversleep (54.3%). Most of the subjects (75.0%) had a prejudice in food selection because of a bad taste. 62.0% of the subjects ate snack between meals more than three times a week, because they were hungry, good taste and habitual. The criteria of choosing snack were taste, nutrition and quality of food. Food as snacks they frequently had fruits, milk and milk products, cookies, chocolate in order. Boys had more french fries than girls, girls had more fruits, cookies and chocolate than boys. Average food habit score of boys (49.27 ${\pm}$ 7.53) was higher than that of girls (48.54 ${\pm}$ 7.81). The group who had a higher food habit score, they had more fruits and less soft drink as snacks, lower BMI, and also less monthly allowance than the group who had a lower food habit score. This study may provide basic information on eating habits of middle school students, suggests that nutrition education or counseling can improve food habits and develop positive behaviors toward healthy diets.

• Journal of Intelligence and Information Systems
• /
• v.26 no.2
• /
• pp.27-42
• /
• 2020

Traditional companies with offline stores were unable to secure large display space due to the problems of cost. This limitation inevitably allowed limited kinds of products to be displayed on the shelves, which resulted in consumers being deprived of the opportunity to experience various items. Taking advantage of the virtual space called the Internet, online shopping goes beyond the limits of limitations in physical space of offline shopping and is now able to display numerous products on web pages that can satisfy consumers with a variety of needs. Paradoxically, however, this can also cause consumers to experience the difficulty of comparing and evaluating too many alternatives in their purchase decision-making process. As an effort to address this side effect, various kinds of consumer's purchase decision support systems have been studied, such as keyword-based item search service and recommender systems. These systems can reduce search time for items, prevent consumer from leaving while browsing, and contribute to the seller's increased sales. Among those systems, recommender systems based on association rule mining techniques can effectively detect interrelated products from transaction data such as orders. The association between products obtained by statistical analysis provides clues to predicting how interested consumers will be in another product. However, since its algorithm is based on the number of transactions, products not sold enough so far in the early days of launch may not be included in the list of recommendations even though they are highly likely to be sold. Such missing items may not have sufficient opportunities to be exposed to consumers to record sufficient sales, and then fall into a vicious cycle of a vicious cycle of declining sales and omission in the recommendation list. This situation is an inevitable outcome in situations in which recommendations are made based on past transaction histories, rather than on determining potential future sales possibilities. This study started with the idea that reflecting the means by which this potential possibility can be identified indirectly would help to select highly recommended products. In the light of the fact that the attributes of a product affect the consumer's purchasing decisions, this study was conducted to reflect them in the recommender systems. In other words, consumers who visit a product page have shown interest in the attributes of the product and would be also interested in other products with the same attributes. On such assumption, based on these attributes, the recommender system can select recommended products that can show a higher acceptance rate. Given that a category is one of the main attributes of a product, it can be a good indicator of not only direct associations between two items but also potential associations that have yet to be revealed. Based on this idea, the study devised a recommender system that reflects not only associations between products but also categories. Through regression analysis, two kinds of associations were combined to form a model that could predict the hit rate of recommendation. To evaluate the performance of the proposed model, another regression model was also developed based only on associations between products. Comparative experiments were designed to be similar to the environment in which products are actually recommended in online shopping malls. First, the association rules for all possible combinations of antecedent and consequent items were generated from the order data. Then, hit rates for each of the associated rules were predicted from the support and confidence that are calculated by each of the models. The comparative experiments using order data collected from an online shopping mall show that the recommendation accuracy can be improved by further reflecting not only the association between products but also categories in the recommendation of related products. The proposed model showed a 2 to 3 percent improvement in hit rates compared to the existing model. From a practical point of view, it is expected to have a positive effect on improving consumers' purchasing satisfaction and increasing sellers' sales.

• Journal of Intelligence and Information Systems
• /
• v.18 no.1
• /
• pp.23-38
• /
• 2012

There is a large difference between purchasing patterns in an online shopping mall and in an offline market. This difference may be caused mainly by the difference in accessibility of online and offline markets. It means that an interval between the initial purchasing decision and its realization appears to be relatively short in an online shopping mall, because a customer can make an order immediately. Because of the short interval between a purchasing decision and its realization, an online shopping mall transaction usually contains fewer items than that of an offline market. In an offline market, customers usually keep some items in mind and buy them all at once a few days after deciding to buy them, instead of buying each item individually and immediately. On the contrary, more than 70% of online shopping mall transactions contain only one item. This statistic implies that traditional data mining techniques cannot be directly applied to online market analysis, because hardly any association rules can survive with an acceptable level of Support because of too many Null Transactions. Most market basket analyses on online shopping mall transactions, therefore, have been performed by expanding the co-occurrence criteria of traditional association rule mining. While the traditional co-occurrence criteria defines items purchased in one transaction as concurrently purchased items, the expanded co-occurrence criteria regards items purchased by a customer during some predefined period (e.g., a day) as concurrently purchased items. In studies using expanded co-occurrence criteria, however, the criteria has been defined arbitrarily by researchers without any theoretical grounds or agreement. The lack of clear grounds of adopting a certain co-occurrence criteria degrades the reliability of the analytical results. Moreover, it is hard to derive new meaningful findings by combining the outcomes of previous individual studies. In this paper, we attempt to compare expanded co-occurrence criteria and propose a guideline for selecting an appropriate one. First of all, we compare the accuracy of association rules discovered according to various co-occurrence criteria. By doing this experiment we expect that we can provide a guideline for selecting appropriate co-occurrence criteria that corresponds to the purpose of the analysis. Additionally, we will perform similar experiments with several groups of customers that are segmented by each customer's average duration between orders. By this experiment, we attempt to discover the relationship between the optimal co-occurrence criteria and the customer's average duration between orders. Finally, by a series of experiments, we expect that we can provide basic guidelines for developing customized recommendation systems. Our experiments use a real dataset acquired from one of the largest internet shopping malls in Korea. We use 66,278 transactions of 3,847 customers conducted during the last two years. Overall results show that the accuracy of association rules of frequent shoppers (whose average duration between orders is relatively short) is higher than that of causal shoppers. In addition we discover that with frequent shoppers, the accuracy of association rules appears very high when the co-occurrence criteria of the training set corresponds to the validation set (i.e., target set). It implies that the co-occurrence criteria of frequent shoppers should be set according to the application purpose period. For example, an analyzer should use a day as a co-occurrence criterion if he/she wants to offer a coupon valid only for a day to potential customers who will use the coupon. On the contrary, an analyzer should use a month as a co-occurrence criterion if he/she wants to publish a coupon book that can be used for a month. In the case of causal shoppers, the accuracy of association rules appears to not be affected by the period of the application purposes. The accuracy of the causal shoppers' association rules becomes higher when the longer co-occurrence criterion has been adopted. It implies that an analyzer has to set the co-occurrence criterion for as long as possible, regardless of the application purpose period.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.6
• /
• pp.571-576
• /
• 2002

There have been a lot of considerations dealing with improving the performance of neuro-fuzzy system. The studies on the neuro-fuzzy modeling have largely been devoted to two approaches. First is to improve performance index of system. The other is to reduce the structure size. In spite of its satisfactory result, it should be noted that these are difficult to extend to high dimensional input or to increase the membership functions. We propose a novel neuro-fuzzy system based on the efficient clustering method for initializing the parameters of the premise part. It is a very useful method that maintains a few number of rules and improves the performance. It combine the various algorithms to improve the performance. The Expectation-Maximization algorithm of Gaussian mixture model is an efficient estimation method for unknown parameter estimation of mirture model. The obtained parameters are used for fuzzy clustering method. The proposed method satisfies these two requirements using the Gaussian mixture model and neuro-fuzzy modeling. Experimental results indicate that the proposed method is capable of giving reliable performance.

• Journal of Intelligence and Information Systems
• /
• v.8 no.1
• /
• pp.119-139
• /
• 2002

In electronic catalogs, each item is represented as an independent unit while the parts of the item can be composed of a higher level of functionality. Thus, the search for this kind of product database is limited to the retrieval of most similar standard commodities. However, many industrial products need to configure optional parts to fulfill the required specifications. Since there are many paths in finding the required specifications, we need to develop a search system via the configuration process. In this system, we adopt a two-phased approach. The first phase finds the most similar template, and the second phase adjusts the template specifications toward the required set of specifications by the Constraint and Rule Satisfaction Problem approach. There is no guarantee that the most similar template can find the most desirable configuration. The search system needs backtracking capability, so the search can stop at a satisfied local optimal satisfaction. This framework is applied to the configuration of computers and peripherals. Template-based reasoning is basically the same as case-based reasoning. The required set of specifications is represented by a list of criteria, and matched with the product specifications to find the closest ones. To measure the distance, we develop a thesaurus of values, which can identify the meaning of numbers, symbols, and words. With this configuration, the performance of the search by configuration algorithm is evaluated in terms of feasibility and admissibility.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1239-1251
• /
• 1999

In this paper a scalable QoS-based hierarchical inter-domain routing scheme for distributed multimedia applications in a high speed wide area network. The problem of QoS-based routing is formulated as a multicriteria shortest path problem, known as NP-complete[21,30]. Our routing scheme consists of two phases. In Phase 1, two graph construction algorithms are performed to model the network under consideration as a graph. The graph contains a part of the network topology which is completely neglected or partially considered by existing routing schemes, thus maintaining more accurate topology information. In Phase 2, a heuristic call-by-call algorithm is performed for selecting a feasible path efficiently in depth first search-like manner on the graph and tailoring to each application's QoS requirements, beginning at a vertex that represents the source node. In this paper, a simple rule is also produced, by which the visiting order of outgoing edges at each vertex on the graph is determined. The rule is based on each edge's the minimum normalized slackness to the QoS requested. The proposed routing scheme extends the PNNI-type hierarchical routing framework. Note that our routing scheme is one of a few QoS-based hierarchical routing schemes that address explicitly the issue of selecting a path with multiple metrics.

• Journal of the Korean Geophysical Society
• /
• v.9 no.4
• /
• pp.321-331
• /
• 2006

Recently, runoff characteristics of urban area are changing because of the increase of impervious area by rapidly increasing of population and industrialization, urbanization. It needs to extract the accurate topologic and hydrologic parameters of watershed in order to manage water resource efficiently. Thus, this study developed more precise input data and more improved parameter estimating procedures using GIS(Geographic Information System) and GA(Genetic Algorithm). For these purposes, XP-SWMM (EXPert-Storm Water Management Model) was used to simulate the urban runoff. The model was applied to An-Yang stream basin that is a typical Korean urban stream basin with several tributaries. The rules for parameter estimation were composed and applied based on quantity parameters that are investigated through the sensitivity analysis. GA algorithm is composed of these rules and facts. The conditions of urban flows are simulated using the rainfall-runoff data of the study area. The data of area, slope, width of each subcatchment and length, slope of each stream reach were acquired from topographic maps, and imperviousness rate, land use types, infiltration capacities of each subcatchment from land use maps, soil maps using GIS. Also we gave the management scheme of urbanization runoff using XP-SWMM. The parameters are estimated by GA from sensitivity analysis which is performed to analyze the runoff parameters.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.2
• /
• pp.155-160
• /
• 2014

There are many image processing based algorithms and applications that fail when illumination change occurs. Therefore, the illumination change has to be detected then the illumination change occurred images need to be enhanced in order to keep the appropriate algorithm processing in a reality. In this paper, a new method for detecting illumination changes efficiently in a real time by using local region information and fuzzy logic is introduced. The effective way for detecting illumination changes in lighting area and the edge of the area was selected to analyze the mean and variance of the histogram of each area and to reflect the changing trends on previous frame's mean and variance for each area of the histogram. The ways are used as an input. The changes of mean and variance make different patterns w hen illumination change occurs. Fuzzy rules were defined based on the patterns of the input for detecting illumination changes. Proposed method was tested with different dataset through the evaluation metrics; in particular, the specificity, recall and precision showed high rates. An automatic parameter selection method was proposed for contrast limited adaptive histogram equalization method by using entropy of image through adaptive neural fuzzy inference system. The results showed that the contrast of images could be enhanced. The proposed algorithm is robust to detect global illumination change, and it is also computationally efficient in real applications.

• Journal of Korea Water Resources Association
• /
• v.31 no.6
• /
• pp.821-832
• /
• 1998

This study investigates the prediction of daily water supply, which is a necessary for the efficient management of water distribution system. Fuzzy neuron, namely artificial intelligence, is a neural network into which fuzzy information is inputted and then processed. In this study, daily water supply was predicted through an adaptive learning method by which a membership function and fuzzy rules were adapted for daily water supply prediction. This study was investigated methods for predicting water supply based on data about the amount of water supplied to the city of Kwangju. For variables choice, four analyses of input data were conducted: correlation analysis, autocorrelation analysis, partial autocorrelation analysis, and cross-correlation analysis. Input variables were (a) the amount of water supplied (b) the mean temperature, and (c)the population of the area supplied with water. Variables were combined in an integrated model. Data of the amount of daily water supply only was modelled and its validity was verified in the case that the meteorological office of weather forecast is not always reliable. Proposed models include accidental cases such as a suspension of water supply. The maximum error rate between the estimation of the model and the actual measurement was 18.35% and the average error was lower than 2.36%. The model is expected to be a real-time estimation of the operational control of water works and water/drain pipes.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.5
• /
• pp.148-154
• /
• 2008

In a ubiquitous computing environment, a ubiquitous smart space is required to help devices provide intelligent services. The smart space embedded with mobile devices should have the capabilities of collecting data and refining the data to contact. Unfortunately, the context information in a ubiquitous smart space has many ambiguous characteristics. Therefore, it is necessary to adapt a standard taxonomy for contact information in the smart space and to implement an inference technique of the context information based on taxonomy. Rule-based inference engine, such as CLIPS, Jess, was employed for providing situation-aware services. However, it is difficult for these engines to be used in resource limited mobile devices. In this paper, we propose a light-weight inference engine providing autonomous situation aware services in mobile environment. It can be utilized for personal mobile devices tuck as mobile phone, PMP and navigation. It can also support both generalized rules and specialized rules as using hierarchical taxonomy information.