• Journal of Intelligence and Information Systems
• /
• v.20 no.3
• /
• pp.1-18
• /
• 2014

Over the past years RFID/SN has been an elementary technology in a diversity of applications for the ubiquitous environments, especially for Internet of Things. However, one of obstacles for widespread deployment of RFID technology is the inherent unreliability of the RFID data streams by tag readers. In particular, the problem of false readings such as lost readings and mistaken readings needs to be treated by RFID middleware systems because false readings ultimately degrade the quality of application services due to the dirty data delivered by middleware systems. As a result, for the higher quality of services, an RFID middleware system is responsible for intelligently dealing with false readings for the delivery of clean data to the applications in accordance with the tag reading environment. One of popular techniques used to compensate false readings is a sliding window filter. In a sliding window scheme, it is evident that determining optimal window size intelligently is a nontrivial important task in RFID middleware systems in order to reduce false readings, especially in mobile environments. In this paper, for the purpose of reducing false readings by intelligent window adaption, we propose a new adaptive RFID data cleaning scheme based on window sliding for a single tag. Unlike previous works based on a binomial sampling model, we introduce the weight averaging. Our insight starts from the need to differentiate the past readings and the current readings, since the more recent readings may indicate the more accurate tag transitions. Owing to weight averaging, our scheme is expected to dynamically adapt the window size in an efficient manner even for non-homogeneous reading patterns in mobile environments. In addition, we analyze reading patterns in the window and effects of decreased window so that a more accurate and efficient decision on window adaption can be made. With our scheme, we can expect to obtain the ultimate goal that RFID middleware systems can provide applications with more clean data so that they can ensure high quality of intended services.

• Journal of Intelligence and Information Systems
• /
• v.21 no.1
• /
• pp.29-45
• /
• 2015

Response modeling is a well-known research issue for those who have tried to get more superior performance in the capability of predicting the customers' response for the marketing promotion. The response model for customers would reduce the marketing cost by identifying prospective customers from very large customer database and predicting the purchasing intention of the selected customers while the promotion which is derived from an undifferentiated marketing strategy results in unnecessary cost. In addition, the big data environment has accelerated developing the response model with data mining techniques such as CBR, neural networks and support vector machines. And CBR is one of the most major tools in business because it is known as simple and robust to apply to the response model. However, CBR is an attractive data mining technique for data mining applications in business even though it hasn't shown high performance compared to other machine learning techniques. Thus many studies have tried to improve CBR and utilized in business data mining with the enhanced algorithms or the support of other techniques such as genetic algorithm, decision tree and AHP (Analytic Process Hierarchy). Ahn and Kim(2008) utilized logit, neural networks, CBR to predict that which customers would purchase the items promoted by marketing department and tried to optimized the number of k for k-nearest neighbor with genetic algorithm for the purpose of improving the performance of the integrated model. Hong and Park(2009) noted that the integrated approach with CBR for logit, neural networks, and Support Vector Machine (SVM) showed more improved prediction ability for response of customers to marketing promotion than each data mining models such as logit, neural networks, and SVM. This paper presented an approach to predict customers' response of marketing promotion with Case Based Reasoning. The proposed model was developed by applying different weights to each feature. We deployed logit model with a database including the promotion and the purchasing data of bath soap. After that, the coefficients were used to give different weights of CBR. We analyzed the performance of proposed weighted CBR based model compared to neural networks and pure CBR based model empirically and found that the proposed weighted CBR based model showed more superior performance than pure CBR model. Imbalanced data is a common problem to build data mining model to classify a class with real data such as bankruptcy prediction, intrusion detection, fraud detection, churn management, and response modeling. Imbalanced data means that the number of instance in one class is remarkably small or large compared to the number of instance in other classes. The classification model such as response modeling has a lot of trouble to recognize the pattern from data through learning because the model tends to ignore a small number of classes while classifying a large number of classes correctly. To resolve the problem caused from imbalanced data distribution, sampling method is one of the most representative approach. The sampling method could be categorized to under sampling and over sampling. However, CBR is not sensitive to data distribution because it doesn't learn from data unlike machine learning algorithm. In this study, we investigated the robustness of our proposed model while changing the ratio of response customers and nonresponse customers to the promotion program because the response customers for the suggested promotion is always a small part of nonresponse customers in the real world. We simulated the proposed model 100 times to validate the robustness with different ratio of response customers to response customers under the imbalanced data distribution. Finally, we found that our proposed CBR based model showed superior performance than compared models under the imbalanced data sets. Our study is expected to improve the performance of response model for the promotion program with CBR under imbalanced data distribution in the real world.

• Journal of Intelligence and Information Systems
• /
• v.21 no.3
• /
• pp.101-116
• /
• 2015

Recently, due to the development of smart devices and social media, vast amounts of information with the various forms were accumulated. Particularly, considerable research efforts are being directed towards analyzing unstructured big data to resolve various social problems. Accordingly, focus of data-driven decision-making is being moved from structured data analysis to unstructured one. Also, in the field of recommendation system, which is the typical area of data-driven decision-making, the need of using unstructured data has been steadily increased to improve system performance. Approaches to improve the performance of recommendation systems can be found in two aspects- improving algorithms and acquiring useful data with high quality. Traditionally, most efforts to improve the performance of recommendation system were made by the former approach, while the latter approach has not attracted much attention relatively. In this sense, efforts to utilize unstructured data from variable sources are very timely and necessary. Particularly, as the interests of users are directly connected with their needs, identifying the interests of the user through unstructured big data analysis can be a crew for improving performance of recommendation systems. In this sense, this study proposes the methodology of improving recommendation system by measuring interests of the user. Specially, this study proposes the method to quantify interests of the user by analyzing user's internet usage patterns, and to predict user's repurchase based upon the discovered preferences. There are two important modules in this study. The first module predicts repurchase probability of each category through analyzing users' purchase history. We include the first module to our research scope for comparing the accuracy of traditional purchase-based prediction model to our new model presented in the second module. This procedure extracts purchase history of users. The core part of our methodology is in the second module. This module extracts users' interests by analyzing news articles the users have read. The second module constructs a correspondence matrix between topics and news articles by performing topic modeling on real world news articles. And then, the module analyzes users' news access patterns and then constructs a correspondence matrix between articles and users. After that, by merging the results of the previous processes in the second module, we can obtain a correspondence matrix between users and topics. This matrix describes users' interests in a structured manner. Finally, by using the matrix, the second module builds a model for predicting repurchase probability of each category. In this paper, we also provide experimental results of our performance evaluation. The outline of data used our experiments is as follows. We acquired web transaction data of 5,000 panels from a company that is specialized to analyzing ranks of internet sites. At first we extracted 15,000 URLs of news articles published from July 2012 to June 2013 from the original data and we crawled main contents of the news articles. After that we selected 2,615 users who have read at least one of the extracted news articles. Among the 2,615 users, we discovered that the number of target users who purchase at least one items from our target shopping mall 'G' is 359. In the experiments, we analyzed purchase history and news access records of the 359 internet users. From the performance evaluation, we found that our prediction model using both users' interests and purchase history outperforms a prediction model using only users' purchase history from a view point of misclassification ratio. In detail, our model outperformed the traditional one in appliance, beauty, computer, culture, digital, fashion, and sports categories when artificial neural network based models were used. Similarly, our model outperformed the traditional one in beauty, computer, digital, fashion, food, and furniture categories when decision tree based models were used although the improvement is very small.

• Journal of Intelligence and Information Systems
• /
• v.21 no.3
• /
• pp.79-99
• /
• 2015

The prediction of bankruptcy has been extensively studied in the accounting and finance field. It can have an important impact on lending decisions and the profitability of financial institutions in terms of risk management. Many researchers have focused on constructing a more robust bankruptcy prediction model. Early studies primarily used statistical techniques such as multiple discriminant analysis (MDA) and logit analysis for bankruptcy prediction. However, many studies have demonstrated that artificial intelligence (AI) approaches, such as artificial neural networks (ANN), decision trees, case-based reasoning (CBR), and support vector machine (SVM), have been outperforming statistical techniques since 1990s for business classification problems because statistical methods have some rigid assumptions in their application. In previous studies on corporate bankruptcy, many researchers have focused on developing a bankruptcy prediction model using financial ratios. However, there are few studies that suggest the specific types of bankruptcy. Previous bankruptcy prediction models have generally been interested in predicting whether or not firms will become bankrupt. Most of the studies on bankruptcy types have focused on reviewing the previous literature or performing a case study. Thus, this study develops a model using data mining techniques for predicting the specific types of bankruptcy as well as the occurrence of bankruptcy in Korean small- and medium-sized construction firms in terms of profitability, stability, and activity index. Thus, firms will be able to prevent it from occurring in advance. We propose a hybrid approach using two artificial neural networks (ANNs) for the prediction of bankruptcy types. The first is a back-propagation neural network (BPN) model using supervised learning for bankruptcy prediction and the second is a self-organizing map (SOM) model using unsupervised learning to classify bankruptcy data into several types. Based on the constructed model, we predict the bankruptcy of companies by applying the BPN model to a validation set that was not utilized in the development of the model. This allows for identifying the specific types of bankruptcy by using bankruptcy data predicted by the BPN model. We calculated the average of selected input variables through statistical test for each cluster to interpret characteristics of the derived clusters in the SOM model. Each cluster represents bankruptcy type classified through data of bankruptcy firms, and input variables indicate financial ratios in interpreting the meaning of each cluster. The experimental result shows that each of five bankruptcy types has different characteristics according to financial ratios. Type 1 (severe bankruptcy) has inferior financial statements except for EBITDA (earnings before interest, taxes, depreciation, and amortization) to sales based on the clustering results. Type 2 (lack of stability) has a low quick ratio, low stockholder's equity to total assets, and high total borrowings to total assets. Type 3 (lack of activity) has a slightly low total asset turnover and fixed asset turnover. Type 4 (lack of profitability) has low retained earnings to total assets and EBITDA to sales which represent the indices of profitability. Type 5 (recoverable bankruptcy) includes firms that have a relatively good financial condition as compared to other bankruptcy types even though they are bankrupt. Based on the findings, researchers and practitioners engaged in the credit evaluation field can obtain more useful information about the types of corporate bankruptcy. In this paper, we utilized the financial ratios of firms to classify bankruptcy types. It is important to select the input variables that correctly predict bankruptcy and meaningfully classify the type of bankruptcy. In a further study, we will include non-financial factors such as size, industry, and age of the firms. Thus, we can obtain realistic clustering results for bankruptcy types by combining qualitative factors and reflecting the domain knowledge of experts.

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

• Asia pacific journal of information systems
• /
• v.20 no.1
• /
• pp.127-140
• /
• 2010

The benefit that a consumer derives from the use of a good often depends on the number of other consumers purchasing the same goods or other compatible items. This property, which is known as network externality, is significant in many IT related industries. Over the past few decades, network externalities have been recognized in the context of physical networks such as the telephone and railroad industries. Today, as many products are provided as a form of system that consists of compatible components, the appreciation of network externality is becoming increasingly important. Network externalities have been extensively studied among economists who have been seeking to explain new phenomena resulting from rapid advancements in ICT (Information and Communication Technology). As a result of these efforts, a new body of theories for 'New Economy' has been proposed. The theoretical bottom-line argument of such theories is that technologies subject to network effects exhibit multiple equilibriums and will finally lock into a monopoly with one standard cornering the entire market. They emphasize that such "tippiness" is a typical characteristic in such networked markets, describing that multiple incompatible technologies rarely coexist and that the switch to a single, leading standard occurs suddenly. Moreover, it is argued that this standardization process is path dependent, and the ultimate outcome is unpredictable. With incomplete information about other actors' preferences, there can be excess inertia, as consumers only moderately favor the change, and hence are themselves insufficiently motivated to start the bandwagon rolling, but would get on it once it did start to roll. This startup problem can prevent the adoption of any standard at all, even if it is preferred by everyone. Conversely, excess momentum is another possible outcome, for example, if a sponsoring firm uses low prices during early periods of diffusion. The aim of this paper is to analyze the dynamics of the adoption process in markets exhibiting network effects by focusing on two factors; switching and agent heterogeneity. Switching is an important factor that should be considered in analyzing the adoption process. An agent's switching invokes switching by other adopters, which brings about a positive feedback process that can significantly complicate the adoption process. Agent heterogeneity also plays a important role in shaping the early development of the adoption process, which has a significant impact on the later development of the process. The effects of these two factors are analyzed by developing an agent-based simulation model. ABM is a computer-based simulation methodology that can offer many advantages over traditional analytical approaches. The model is designed such that agents have diverse preferences regarding technology and are allowed to switch their previous choice. The simulation results showed that the adoption processes in a market exhibiting networks effects are significantly affected by the distribution of agents and the occurrence of switching. In particular, it is found that both weak heterogeneity and strong network effects cause agents to start to switch early and this plays a role of expediting the emergence of 'lock-in.' When network effects are strong, agents are easily affected by changes in early market shares. This causes agents to switch earlier and in turn speeds up the market's tipping. The same effect is found in the case of highly homogeneous agents. When agents are highly homogeneous, the market starts to tip toward one technology rapidly, and its choice is not always consistent with the populations' initial inclination. Increased volatility and faster lock-in increase the possibility that the market will reach an unexpected outcome. The primary contribution of this study is the elucidation of the role of parameters characterizing the market in the development of the lock-in process, and identification of conditions where such unexpected outcomes happen.

• Asia pacific journal of information systems
• /
• v.24 no.4
• /
• pp.493-513
• /
• 2014

With the development of related technologies, Location-Based Services (LBS) are growing fast and being used in many ways. Past LBS studies have focused on adoption of LBS because of the fact that LBS users have privacy concerns regarding revealing their location information. Meanwhile, the number of LBS users and revenues from LBS are growing rapidly because users can get some benefits by revealing their location information. Little research has been done on how LBS affects consumers' information search behavior in product purchase. The purpose of this paper is examining the effect of LBS information filtering on buyers' uncertainty and their information search behavior. When consumers purchase a product, they try to reduce uncertainty by searching information. Generally, there are two types of uncertainties - knowledge uncertainty and choice uncertainty. Knowledge uncertainty refers to the lack of information on what kinds of alternatives are available in the market and/or their important attributes. Therefore, consumers having knowledge uncertainty will have difficulties in identifying what alternatives exist in the market to fulfil their needs. Choice uncertainty refers to the lack of information about consumers' own preferences and which alternative will fit in their needs. Therefore, consumers with choice uncertainty have difficulties selecting best product among available alternatives.. According to economics of information theory, consumers narrow the scope of information search when knowledge uncertainty is high. It is because consumers' information search cost is high when their knowledge uncertainty is high. If people do not know available alternatives and their attributes, it takes time and cognitive efforts for them to acquire information about available alternatives. Therefore, they will reduce search breadth. For people with high knowledge uncertainty, the information about products and their attributes is new and of high value for them. Therefore, they will conduct searches more in-depth because they have incentive to acquire more information. When people have high choice uncertainty, people tend to search information about more alternatives. It is because increased search breadth will improve their chances to find better alternative for them. On the other hand, since human's cognitive capacity is limited, the increased search breadth (more alternatives) will reduce the depth of information search for each alternative. Consumers with high choice uncertainty will spend less time and effort for each alternative because considering more alternatives will increase their utility. LBS provides users with the capability to screen alternatives based on the distance from them, which reduces information search costs. Therefore, it is expected that LBS will help users consider more alternatives even when they have high knowledge uncertainty. LBS provides distance information, which helps users choose alternatives appropriate for them. Therefore, users will perceive lower choice uncertainty when they use LBS. In order to test the hypotheses, we selected 80 students and assigned them to one of the two experiment groups. One group was asked to use LBS to search surrounding restaurants and the other group was asked to not use LBS to search nearby restaurants. The experimental tasks and measures items were validated in a pilot experiment. The final measurement items are shown in Appendix A. Each subject was asked to read one of the two scenarios - with or without LBS - and use a smartphone application to pick a restaurant. All behaviors on smartphone were recorded using a recording application. Search breadth was measured by the number of restaurants clicked by each subject. Search depths was measured by two metrics - the average number of sub-level pages each subject visited and the average time spent on each restaurant. The hypotheses were tested using SPSS and PLS. The results show that knowledge uncertainty reduces search breadth (H1a). However, there was no significant correlation between knowledge uncertainty and search depth (H1b). Choice uncertainty significantly reduces search depth (H2b), but no significant relationship was found between choice uncertainty and search breadth (H2a). LBS information filtering significantly reduces the buyers' choice uncertainty (H4) and reduces the negative relationship between knowledge uncertainty and search breadth (H3). This research provides some important implications for service providers. Service providers should use different strategies based on their service properties. For those service providers who are not well-known to consumers (high knowledge uncertainty) should encourage their customers to use LBS. This is because LBS would increase buyers' consideration sets when the knowledge uncertainty is high. Therefore, less known services have chances to be included in consumers' consideration sets with LBS. On the other hand, LBS information filtering decrease choice uncertainty and the near service providers are more likely to be selected than without LBS. Hence, service providers should analyze geographically approximate competitors' strength and try to reduce the gap so that they can have chances to be included in the consideration set.

• Journal of the Korean Institute of Traditional Landscape Architecture
• /
• v.31 no.4
• /
• pp.95-112
• /
• 2013

Jangchungdan Park is now perceived as a mere park at the foot of Namsan mountain, but originally it was created to commemorate soldiers of Korean Empire on a site which name was Namsoyeong(南小營) during Joseon Dynasty. During the period of Japanese colonial rule, it was transformed into a park due to the rapidly changing circumstances, so the components expressing the validity of the colonial rule were introduced into the park. This paper examines the time sequential changes of Jangchungdan Park during the period of Japanese colonial rule, and the conclusions can be summarized as given below. Firstly, the park originally was a space to commemorate the soldiers who fought for the Korean Empire. It was built on formerly restricted area at the foot of Namsan Mountain in 1900, and it was arranged putting the ceremonial shrine Dansa (壇祠) as a central building and the annexes in the surroundings of it. The memorial ceremonies were held regularly in spring and autumn until 1909. Secondly, it became a city park for citizens of Gyeongseong-bu(the name of Seoul under the Japanese colonial rule). The authorities of Gyeongseong-bu reorganized Jangchungdan as a park in 1919, prohibited the performance of memorial ceremonies, and the existing buildings except the ceremonial shrine Dansa began to be used as park management facilities. Resting areas and amenities were supplemented for the usage of people from various backgrounds, and the large scale planting of cherry trees made the park a famous place to enjoy cherry-blossoms and other flowers in spring. Thirdly, it was reconstructed as a space to honor the influential personalities of Japanese colonial system. In 1932, Bankmun temple (博文寺) to commemorate Ito Hirobumi was constructed at a location that made it possible for a number of people to overlook Jangchungdan area. During that time, the buildings of traditional Joseon architecture were removed and reconstructed to serve as annexes to Bankmun temple. Due to the strategy to make Jangchungdan park a tourist attraction, Bankmun temple was included into the Gyeongseong sightseeing course, since the wide panorama of Jangchungdan Park and the whole city of Gyeongseong was opening from the temple. Various different components were introduced into Jangchungdan Park due to the rapidly changing circumstances; therefore the nature of the park was either altered or reproduced. Hopefully, the park rearrangement works will be executed paying respects to the memories of the past hereafter.

• The KIPS Transactions:PartB
• /
• v.13B no.5 s.108
• /
• pp.561-568
• /
• 2006

WPS(Wearable Personal Station) for next generation PC can define as a core terminal of 'Ubiquitous Computing' that include information processing and network function and overcome spatial limitation in acquisition of new information. As a way to acquire significant dynamic gesture data of user from haptic devices, traditional gesture recognizer based on desktop-PC using wire communication module has several restrictions such as conditionality on space, complexity between transmission mediums(cable elements), limitation of motion and incommodiousness on use. Accordingly, in this paper, in order to overcome these problems, we implement hand gesture recognition system using fuzzy algorithm and neural network for Post PC(the embedded-ubiquitous environment using blue-tooth module and WPS). Also, we propose most efficient and reasonable hand gesture recognition interface for Post PC through evaluation and analysis of performance about each gesture recognition system. The proposed gesture recognition system consists of three modules: 1) gesture input module that processes motion of dynamic hand to input data 2) Relational Database Management System(hereafter, RDBMS) module to segment significant gestures from input data and 3) 2 each different recognition modulo: fuzzy max-min and neural network recognition module to recognize significant gesture of continuous / dynamic gestures. Experimental result shows the average recognition rate of 98.8% in fuzzy min-nin module and 96.7% in neural network recognition module about significantly dynamic gestures.

• Journal of Korean Society of Forest Science
• /
• v.47 no.1
• /
• pp.52-61
• /
• 1980

This study is carried out to learn the properties of forest soils in Korea and propose the reasonable management methods of forest land. Among 178 soil series surveyed until now in Korea forest soils include 64 series broken down according to the weathered products into 5 categories such as residual materials on mountain and hill, residual materials on rolling and hill, colluvial materials on local valley and fans, alluvial materials and volcanic ash soils. What discussed in this paper are classification system, parent rocks, texture class and drainage conditions of Korean forest soils. The characteristics of Korean forest soil properties classified in U.S.D.A. soil classification system are as follows: 1. Residual soils on mountain and hill (29 soil series) are almost Lithosols without any distinct soil profile development. They have loamy skeletal (11 series), coarse loamy (5 series), fine loamy (3 series), and fine clayey soils (3 series). Their drainage conditions are somewhat excessively drained in 16 series and well drained in 7 series. 2. Residual soils on rolling and hill (19 series) are Red-Yellow Podzolic soils with well developed soil profiles. They have coarse and fine loamy texture in 12 series and fine clayey texture in 5 series mostly with well drained condition. 3. Colluvial soils on local valley and fans (13 series) include mostly Regosols and some Red-Yellow Podzolic Soils and Acid Brown Forest Soils. They have loamy skeletal (4 series), coarse loamy (3 series), fine loamy (3 series), and fine clayey soils (2 series) with well drained condition. 4. Soil textures of weathered products of parent rocks are as follows: 1) Parent rocks producing coarse texture soils are rhyolite, granite gneiss, schist, shale, sandstone, siltstone, and conglomerate. 2) Parent rocks producing fine and heavy texture soils are limestone, basalt, gabbro, and andesite porphyry. 3) Granite is a parent rock producing various textured soils.