• Title/Summary/Keyword: Feature Profile

Search Result 205, Processing Time 0.032 seconds

Personalized and Social Search by Finding User Similarity based on Social Networks (소셜 네트워크 기반 사용자 유사성 발견을 통한 개인화 및 소셜 검색)

  • Park, Gun-Woo;Oh, Jung-Woon;Lee, Sang-Hoon
    • The KIPS Transactions:PartD
    • /
    • v.16D no.5
    • /
    • pp.683-690
    • /
    • 2009
  • Social Networks which is composed of network with an individual in the center in a web support mutual-understanding of information by searching user profile and forming new link. Therefore, if we apply the Social Network which consists of web users who have similar immanent information to web search, we can improve efficiency of web search and satisfaction of web user about search results. In this paper, first, we make a Social Network using web users linked directly or indirectly. Next, we calculate Similarity among web users using their immanent information according to topics, and then reconstruct Social Network based on varying Similarity according to topics. Last, we compare Similarity with Search Pattern. As a result of this test, we can confirm a result that among users who have high relationship index, that is, who have strong link strength according to personal attributes have similar search pattern. If such fact is applied to search algorithm, it can be possible to improve search efficiency and reliability in personalized and social search.

cmicroRNA prediction using Bayesian network with biologically relevant feature set (생물학적으로 의미 있는 특질에 기반한 베이지안 네트웍을 이용한 microRNA의 예측)

  • Nam, Jin-Wu;Park, Jong-Sun;Zhang, Byoung-Tak
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10a
    • /
    • pp.53-58
    • /
    • 2006
  • MicroRNA (miRNA)는 약 22 nt의 작은 RNA 조각으로 이루어져 있으며 stem-loop 구조의 precursor 형태에서 최종적으로 만들어 진다. miRNA는 mRNA의 3‘UTR에 상보적으로 결합하여 유전자의 발현을 억제하거나 mRNA의 분해를 촉진한다. miRNA를 동정하기 위한 실험적인 방법은 조직 특이적인 발현, 적은 발현양 때문에 방법상 한계를 가지고 있다. 이러한 한계는 컴퓨터를 이용한 방법으로 어느 정도 해결될 수 있다. 하지만 miRNA의 서열상의 낮은 보존성은 homology를 기반으로 한 예측을 어렵게 한다. 또한 기계학습 방법인 support vector machine (SVM) 이나 naive bayes가 적용되었지만, 생물학적인 의미를 해석할 수 있는 generative model을 제시해 주지 못했다. 본 연구에서는 우수한 miRNA 예측을 보일 뿐만 아니라 학습된 모델로부터 생물학적인 지식을 얻을 수 있는 Bayesian network을 적용한다. 이를 위해서는 생물학적으로 의미 있는 특질들의 선택이 중요하다. 여기서는 position weighted matrix (PWM)과 Markov chain probability (MCP), Loop 크기, Bulge 수, spectrum, free energy profile 등을 특질로서 선택한 후 Information gain의 특질 선택법을 통해 예측에 기여도가 높은 특질 25개 와 27개를 최종적으로 선택하였다. 이로부터 Bayesian network을 학습한 후 miRNA의 예측 성능을 10 fold cross-validation으로 확인하였다. 그 결과 pre-/mature miRNA 각 각에 대한 예측 accuracy가 99.99% 100.00%를 보여, SVM이나 naive bayes 방법보다 높은 결과를 보였으며, 학습된 Bayesian network으로부터 이전 연구 결과와 일치하는 pre-miRNA 상의 의존관계를 분석할 수 있었다.

  • PDF

Local/Spatial Variation of Settling Velocities of Cohesive Sediments from Han Estuary (한강 하구역 점착성 퇴적물 침강속도의 지엽적/공간적 변화)

  • Seo, Young-Deok;Jin, Jae-Youll;Hwang, Kyu-Nam
    • Journal of Ocean Engineering and Technology
    • /
    • v.22 no.1
    • /
    • pp.37-45
    • /
    • 2008
  • The purpose of this study is to quantify the settling velocities of cohesive sediments from Han estuary and to evaluate their local variation within Han estuary. This study also includes an estimation of their spatial variation, for which the settling velocities of cohesive sediments from Han estuary arecompared with those for sediments from other regions. At the same time, physical-chemical properties, such as grain size distribution, the percentage of organic contents, mineralogical composition etc are measured in this study in order to examine their correlation with settling velocities and their effect on settling velocities. Results from settling tests shaw that the settling velocities of Han estuary mud varies in the range of two orders of magnitude(from 0.01 to 1.5 mm/sec) over the corresponding concentration range of 0.1 to 80 g/L, and a feature of the settling velocity profile is quite different in quantity as compared to those of previous studies for muds from other regions. Particularly in the flocculated settling region, the settling velocity for Han estuary muds is shown to be larger than that of Saemankeum and Keum estuary sediments, while in the hindered settling region all three sediments are shown to have a similar settling velocity. However, local variability of the settling velocities within Han estuary is shown to be insignificant.

The conversion of ammonium uranate prepared via sol-gel synthesis into uranium oxides

  • Schreinemachers, Christian;Leinders, Gregory;Modolo, Giuseppe;Verwerft, Marc;Binnemans, Koen;Cardinaels, Thomas
    • Nuclear Engineering and Technology
    • /
    • v.52 no.5
    • /
    • pp.1013-1021
    • /
    • 2020
  • A combination of simultaneous thermal analysis, evolved gas analysis and non-ambient XRD techniques was used to characterise and investigate the conversion reactions of ammonium uranates into uranium oxides. Two solid phases of the ternary system NH3 - UO3 - H2O were synthesised under specified conditions. Microspheres prepared by the sol-gel method via internal gelation were identified as 3UO3·2NH3·4H2O, whereas the product of a typical ammonium diuranate precipitation reaction was associated to the composition 3UO3·NH3·5H2O. The thermal decomposition profile of both compounds in air feature distinct reaction steps towards the conversion to U3O8, owing to the successive release of water and ammonia molecules. Both compounds are converted into α-U3O8 above 550 ℃, but the crystallographic transition occurs differently. In compound 3UO3·NH3·5H2O (ADU) the transformation occurs via the crystalline β-UO3 phase, whereas in compound 3UO3·2NH3·4H2O (microspheres) an amorphous UO3 intermediate was observed. The new insights obtained on these uranate systems improve the information base for designing and synthesising minor actinide-containing target materials in future applications.

Simultaneous monitoring of motion ECG of two subjects using Bluetooth Piconet and baseline drift

  • Dave, Tejal;Pandya, Utpal
    • Biomedical Engineering Letters
    • /
    • v.8 no.4
    • /
    • pp.365-371
    • /
    • 2018
  • Uninterrupted monitoring of multiple subjects is required for mass causality events, in hospital environment or for sports by medical technicians or physicians. Movement of subjects under monitoring requires such system to be wireless, sometimes demands multiple transmitters and a receiver as a base station and monitored parameter must not be corrupted by any noise before further diagnosis. A Bluetooth Piconet network is visualized, where each subject carries a Bluetooth transmitter module that acquires vital sign continuously and relays to Bluetooth enabled device where, further signal processing is done. In this paper, a wireless network is realized to capture ECG of two subjects performing different activities like cycling, jogging, staircase climbing at 100 Hz frequency using prototyped Bluetooth module. The paper demonstrates removal of baseline drift using Fast Fourier Transform and Inverse Fast Fourier Transform and removal of high frequency noise using moving average and S-Golay algorithm. Experimental results highlight the efficacy of the proposed work to monitor any vital sign parameters of multiple subjects simultaneously. The importance of removing baseline drift before high frequency noise removal is shown using experimental results. It is possible to use Bluetooth Piconet frame work to capture ECG simultaneously for more than two subjects. For the applications where there will be larger body movement, baseline drift removal is a major concern and hence along with wireless transmission issues, baseline drift removal before high frequency noise removal is necessary for further feature extraction.

Student Group Division Algorithm based on Multi-view Attribute Heterogeneous Information Network

  • Jia, Xibin;Lu, Zijia;Mi, Qing;An, Zhefeng;Li, Xiaoyong;Hong, Min
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.12
    • /
    • pp.3836-3854
    • /
    • 2022
  • The student group division is benefit for universities to do the student management based on the group profile. With the widespread use of student smart cards on campus, especially where students living in campus residence halls, students' daily activities on campus are recorded with information such as smart card swiping time and location. Therefore, it is feasible to depict the students with the daily activity data and accordingly group students based on objective measuring from their campus behavior with some regular student attributions collected in the management system. However, it is challenge in feature representation due to diverse forms of the student data. To effectively and comprehensively represent students' behaviors for further student group division, we proposed to adopt activity data from student smart cards and student attributes as input data with taking account of activity and attribution relationship types from different perspective. Specially, we propose a novel student group division method based on a multi-view student attribute heterogeneous information network (MSA-HIN). The network nodes in our proposed MSA-HIN represent students with their multi-dimensional attribute information. Meanwhile, the edges are constructed to characterize student different relationships, such as co-major, co-occurrence, and co-borrowing books. Based on the MSA-HIN, embedded representations of students are learned and a deep graph cluster algorithm is applied to divide students into groups. Comparative experiments have been done on a real-life campus dataset collected from a university. The experimental results demonstrate that our method can effectively reveal the variability of student attributes and relationships and accordingly achieves the best clustering results for group division.

Development of device for cat healthcare monitoring using Smartphone

  • Nam, Heung Sik;Lee, Moon Joo;Kim, Geon A
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.11
    • /
    • pp.157-163
    • /
    • 2022
  • In this paper, we propose to develop a Bluetooth Health Device Profile (HDP)-based smartphone system to utilize it for early detection of urinary tracts diseases that occur a lot in cats. Therefore, based on Bluetooth HDP, we developed a device and mobile application system (Mycatner®) that can monitor cat activity, toilet usage, urinary disease, and health status, and evaluated its availability to monitor cat health status. The specific feature of this system is that it can measure the number of cat urination frequencies to identify abnormal conditions suspected of urinary tract diseases early, and second, it can be tested with urine test paper and shared with animal hospitals, reducing time and cost. As a result, it is evaluated that the developed device capable of wireless monitoring the urinary system health status of cats is the first in our knowledge.

Comparison of Association Rule Learning and Subgroup Discovery for Mining Traffic Accident Data (교통사고 데이터의 마이닝을 위한 연관규칙 학습기법과 서브그룹 발견기법의 비교)

  • Kim, Jeongmin;Ryu, Kwang Ryel
    • Journal of Intelligence and Information Systems
    • /
    • v.21 no.4
    • /
    • pp.1-16
    • /
    • 2015
  • Traffic accident is one of the major cause of death worldwide for the last several decades. According to the statistics of world health organization, approximately 1.24 million deaths occurred on the world's roads in 2010. In order to reduce future traffic accident, multipronged approaches have been adopted including traffic regulations, injury-reducing technologies, driving training program and so on. Records on traffic accidents are generated and maintained for this purpose. To make these records meaningful and effective, it is necessary to analyze relationship between traffic accident and related factors including vehicle design, road design, weather, driver behavior etc. Insight derived from these analysis can be used for accident prevention approaches. Traffic accident data mining is an activity to find useful knowledges about such relationship that is not well-known and user may interested in it. Many studies about mining accident data have been reported over the past two decades. Most of studies mainly focused on predict risk of accident using accident related factors. Supervised learning methods like decision tree, logistic regression, k-nearest neighbor, neural network are used for these prediction. However, derived prediction model from these algorithms are too complex to understand for human itself because the main purpose of these algorithms are prediction, not explanation of the data. Some of studies use unsupervised clustering algorithm to dividing the data into several groups, but derived group itself is still not easy to understand for human, so it is necessary to do some additional analytic works. Rule based learning methods are adequate when we want to derive comprehensive form of knowledge about the target domain. It derives a set of if-then rules that represent relationship between the target feature with other features. Rules are fairly easy for human to understand its meaning therefore it can help provide insight and comprehensible results for human. Association rule learning methods and subgroup discovery methods are representing rule based learning methods for descriptive task. These two algorithms have been used in a wide range of area from transaction analysis, accident data analysis, detection of statistically significant patient risk groups, discovering key person in social communities and so on. We use both the association rule learning method and the subgroup discovery method to discover useful patterns from a traffic accident dataset consisting of many features including profile of driver, location of accident, types of accident, information of vehicle, violation of regulation and so on. The association rule learning method, which is one of the unsupervised learning methods, searches for frequent item sets from the data and translates them into rules. In contrast, the subgroup discovery method is a kind of supervised learning method that discovers rules of user specified concepts satisfying certain degree of generality and unusualness. Depending on what aspect of the data we are focusing our attention to, we may combine different multiple relevant features of interest to make a synthetic target feature, and give it to the rule learning algorithms. After a set of rules is derived, some postprocessing steps are taken to make the ruleset more compact and easier to understand by removing some uninteresting or redundant rules. We conducted a set of experiments of mining our traffic accident data in both unsupervised mode and supervised mode for comparison of these rule based learning algorithms. Experiments with the traffic accident data reveals that the association rule learning, in its pure unsupervised mode, can discover some hidden relationship among the features. Under supervised learning setting with combinatorial target feature, however, the subgroup discovery method finds good rules much more easily than the association rule learning method that requires a lot of efforts to tune the parameters.

A New Item Recommendation Procedure Using Preference Boundary

  • Kim, Hyea-Kyeong;Jang, Moon-Kyoung;Kim, Jae-Kyeong;Cho, Yoon-Ho
    • Asia pacific journal of information systems
    • /
    • v.20 no.1
    • /
    • pp.81-99
    • /
    • 2010
  • Lately, in consumers' markets the number of new items is rapidly increasing at an overwhelming rate while consumers have limited access to information about those new products in making a sensible, well-informed purchase. Therefore, item providers and customers need a system which recommends right items to right customers. Also, whenever new items are released, for instance, the recommender system specializing in new items can help item providers locate and identify potential customers. Currently, new items are being added to an existing system without being specially noted to consumers, making it difficult for consumers to identify and evaluate new products introduced in the markets. Most of previous approaches for recommender systems have to rely on the usage history of customers. For new items, this content-based (CB) approach is simply not available for the system to recommend those new items to potential consumers. Although collaborative filtering (CF) approach is not directly applicable to solve the new item problem, it would be a good idea to use the basic principle of CF which identifies similar customers, i,e. neighbors, and recommend items to those customers who have liked the similar items in the past. This research aims to suggest a hybrid recommendation procedure based on the preference boundary of target customer. We suggest the hybrid recommendation procedure using the preference boundary in the feature space for recommending new items only. The basic principle is that if a new item belongs within the preference boundary of a target customer, then it is evaluated to be preferred by the customer. Customers' preferences and characteristics of items including new items are represented in a feature space, and the scope or boundary of the target customer's preference is extended to those of neighbors'. The new item recommendation procedure consists of three steps. The first step is analyzing the profile of items, which are represented as k-dimensional feature values. The second step is to determine the representative point of the target customer's preference boundary, the centroid, based on a personal information set. To determine the centroid of preference boundary of a target customer, three algorithms are developed in this research: one is using the centroid of a target customer only (TC), the other is using centroid of a (dummy) big target customer that is composed of a target customer and his/her neighbors (BC), and another is using centroids of a target customer and his/her neighbors (NC). The third step is to determine the range of the preference boundary, the radius. The suggested algorithm Is using the average distance (AD) between the centroid and all purchased items. We test whether the CF-based approach to determine the centroid of the preference boundary improves the recommendation quality or not. For this purpose, we develop two hybrid algorithms, BC and NC, which use neighbors when deciding centroid of the preference boundary. To test the validity of hybrid algorithms, BC and NC, we developed CB-algorithm, TC, which uses target customers only. We measured effectiveness scores of suggested algorithms and compared them through a series of experiments with a set of real mobile image transaction data. We spilt the period between 1st June 2004 and 31st July and the period between 1st August and 31st August 2004 as a training set and a test set, respectively. The training set Is used to make the preference boundary, and the test set is used to evaluate the performance of the suggested hybrid recommendation procedure. The main aim of this research Is to compare the hybrid recommendation algorithm with the CB algorithm. To evaluate the performance of each algorithm, we compare the purchased new item list in test period with the recommended item list which is recommended by suggested algorithms. So we employ the evaluation metric to hit the ratio for evaluating our algorithms. The hit ratio is defined as the ratio of the hit set size to the recommended set size. The hit set size means the number of success of recommendations in our experiment, and the test set size means the number of purchased items during the test period. Experimental test result shows the hit ratio of BC and NC is bigger than that of TC. This means using neighbors Is more effective to recommend new items. That is hybrid algorithm using CF is more effective when recommending to consumers new items than the algorithm using only CB. The reason of the smaller hit ratio of BC than that of NC is that BC is defined as a dummy or virtual customer who purchased all items of target customers' and neighbors'. That is centroid of BC often shifts from that of TC, so it tends to reflect skewed characters of target customer. So the recommendation algorithm using NC shows the best hit ratio, because NC has sufficient information about target customers and their neighbors without damaging the information about the target customers.

A Study on Settling Properties of Fine-Cohesive Sediments in Keum Estuary (금강 하구역 미세-점착성 퇴적물의 침강특성에 관한 연구)

  • Ryu Hong-Ryul;Chun Min-Chul;Hwang Kyu-Nam
    • Journal of Korean Society of Coastal and Ocean Engineers
    • /
    • v.18 no.3
    • /
    • pp.251-261
    • /
    • 2006
  • The purpose of this study is to quantitatively estimate the settling property for fine-cohesive sediments in Keum Estuary and to evaluate the spatial variation by analyzing and comparing the local and seasonal variation of the settling properties in Keum Estuary with that of the settling properties in the other sites. After the spatial variation of physico-chemical properties such grain size distribution, the percentage of organic contents, mineralogical composition etc is investigated through experiments and analyses, interrelation between the physico-chemical properties and settling velocities and effect that the physico-chemical properties have on the quantitative variation of settling velocities were also analyzed in this study. Experimental results of settling tests shows that settling velocities of Keum Estuary mud vary in the range of two orders of magnitude (from 0.01 to 1mm/sec) over the corresponding concentration range of 0.1 to 80 g/L, and a feature of settling velocity profile is quite different in quantity as compared to those of previous studies with mud of other regions: Saemankuem, Tampa Bay, Sevem Estuary and lake Okeechobee. However, their local and seasonal variabilities within Keum Estuary appear to be insignificant.