• Title/Summary/Keyword: Graph Search

Search Result 294, Processing Time 0.028 seconds

GO Guide : Browser & Query Translation for Biological Ontology (GO Guide : 생물학 온톨로지를 위한 브라우저 및 질의 변환)

  • Jung Jun-Won;Park Hyoung-Woo;Im Dong-Hhyuk;Lee Kang-Pyo;Kim Hyoung-Joo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.12 no.3
    • /
    • pp.183-191
    • /
    • 2006
  • As genetic research is getting more active, data construction of genes are needed in the field of biology. Therefore, Gene Ontology Consortium has constructed genetic information by OWL, which is Ontology description language published by W3C. However, previous browsers for Gene Ontology only support simple searching mechanisms based on keyword, tree, and graph, but it is not able to search high quality information considering various relationships. In this paper, we suggest browsing technique which integratesvarious searching methods to support researchers who are doing actually experiment in biology field. Also, instead of typing a query, we propose querv generation technique which constructs query while browsing and query translation technique which translate generated query into SeRQL query It is convenient for user and enables user to obtain high quality information. And by this GO Guide browser, it has been shown that the information of Gene Ontology could be used efficiently.

Analysis of Threshold Voltage Characteristics for FinFET Using Three Dimension Poisson's Equation (3차원 포아송방정식을 이용한 FinFET의 문턱전압특성분석)

  • Jung, Hak-Kee
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.11
    • /
    • pp.2373-2377
    • /
    • 2009
  • In this paper, the threshold voltage characteristics have been analyzed using three dimensional Poisson's equation for FinFET. The FinFET is extensively been studing since it can reduce the short channel effects as the nano device. We have presented the short channel effects such as subthreshold swing and threshold voltage for PinFET, using the analytical three dimensional Poisson's equation. We have analyzed for channel length, thickness and width to consider the structural characteristics for FinFET. Using this model, the subthreshold swing and threshold voltage have been analyzed for FinFET since the potential and transport model of this analytical three dimensional Poisson's equation is verified as comparing with those of the numerical three dimensional Poisson's equation.

A Refined Neighbor Selection Algorithm for Clustering-Based Collaborative Filtering (클러스터링기반 협동적필터링을 위한 정제된 이웃 선정 알고리즘)

  • Kim, Taek-Hun;Yang, Sung-Bong
    • The KIPS Transactions:PartD
    • /
    • v.14D no.3 s.113
    • /
    • pp.347-354
    • /
    • 2007
  • It is not easy for the customers to search the valuable information on the goods among countless items available in the Internet. In order to save time and efforts in searching the goods the customers want, it is very important for a recommender system to have a capability to predict accurately customers' preferences. In this paper we present a refined neighbor selection algorithm for clustering based collaborative filtering in recommender systems. The algorithm exploits a graph approach and searches more efficiently for set of influential customers with respect to a given customer; it searches with concepts of weighted similarity and ranked clustering. The experimental results show that the recommender systems using the proposed method find the proper neighbors and give a good prediction quality.

STK Feature Tracking Using BMA for Fast Feature Displacement Convergence (빠른 피쳐변위수렴을 위한 BMA을 이용한 STK 피쳐 추적)

  • Jin, Kyung-Chan;Cho, Jin-Ho
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.8
    • /
    • pp.81-87
    • /
    • 1999
  • In general, feature detection and tracking algorithms is classified by EBGM using Garbor-jet, NNC-R and STK algorithm using pixel eigenvalue. In those algorithms, EBGM and NCC-R detect features with feature model, but STK algorithm has a characteristics of an automatic feature selection. In this paper, to solve the initial problem of NR tracking in STK algorithm, we detected features using STK algorithm in modelled feature region and tracked features with NR method. In tracking, to improve the tracking accuracy for features by NR method, we proposed BMA-NR method. We evaluated that BMA-NR method was superior to NBMA-NR in that feature tracking accuracy, since BMA-NR method was able to solve the local minimum problem due to search window size of NR.

  • PDF

Effect of Carrot Intake in the Prevention of Gastric Cancer: A Meta-Analysis

  • Fallahzadeh, Hossein;Jalali, Ali;Momayyezi, Mahdieh;Bazm, Soheila
    • Journal of Gastric Cancer
    • /
    • v.15 no.4
    • /
    • pp.256-261
    • /
    • 2015
  • Purpose: Gastric cancer is the third leading cause of cancer-related mortality, with the incidence and mortality being higher in men than in women. Various studies have shown that eating carrots may play a major role in the prevention of gastric cancer. We conducted a meta-analysis to determine the relationship between carrot consumption and gastric cancer. Materials and Methods: We searched multiple databases including PubMed, Cochrane Library, Scopus, ScienceDirect, and Persian databases like Scientific Information Database (SID) and IranMedx. The following search terms were used: stomach or gastric, neoplasm or cancer, carcinoma or tumor, and carrot. Statistical analyses were performed using Comprehensive Meta Analysis/2.0 software. Results: We retrieved 81 articles by searching the databases. After considering the inclusion and exclusion criteria, 5 articles were included in this study. The odds ratio (OR) obtained by fixed effects model showed that a 26% reduction in the risk of gastric cancer has been associated with the consumption of carrots) OR=0.74; 95% confidence interval=0.68~0.81; P<0.0001). According to funnel graph, the results showed that the possibility of a publication bias does not exist in this study. Conclusions: The findings of this study showed an inverse relationship between the consumption of carrots and the risk of gastric cancer.

Design and Implementation of the Postal Route Optimization System Model (우편 경로 최적화 시스템 모델 설계 및 구현)

  • Nam, Sang-U
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.6
    • /
    • pp.1483-1492
    • /
    • 1996
  • In this paper, related on the postal business with the GIS(Geographics Information System), it discusses design and implementation of the PROS(Postal Route Optimization System) model and its main module, the shortest path generation algorithm, for supporting to postal route managements. It explains examples requirements of postal route system, and suggests the efficient PROS model using our developed shortest path generation algorithm. Because the shortest path algorithm adopts not only consider the Dijkstra algorithm of graph theory, but also the method with the direction property, PROS can be implemented with fast and efficient route search. PROS is mainly constituted of the Shortest Generator, the Isochronal Area Generator, and the Path Rearrangement Generator. It also exploits the GIS engine and the spatial DBMS (Data Base Management System) for processing coordinates in the map and geographical features. PROS can be used in the management of postal delivery business and delivery area and route, and in the rearrangement of route. In the near future, it can be also applied to commercial delivery businesses, guides of routs and traffic informations, and auto navigation system with GPS(Global Positioning System).

  • PDF

Enhancing the User Experience: A Research on China Mobile E-book App (사용자 경험 향상: 중국 모바일 독서어플 관한 연구)

  • Liang, Peipei;Pan, Young-Hwan
    • Journal of Digital Contents Society
    • /
    • v.18 no.8
    • /
    • pp.1475-1480
    • /
    • 2017
  • The flourishing China mobile e-book App market has caused a series of problems, for which enhancing the user experience become an urgent matter. As a whole, user experience is related to the five planes such as the device, platform, medium, form and content. However, to understand the user needs is the logical starting point of the whole process. Contextual interview has been conducted in this study, while four types of tasks such as discovering and accessing a target e-book, setting and experiencing the reading interface, listening to the e-book and reviewing and sharing were asked to perform during the process, which has resulted in relevant problems and unpleasant factors in user experience. Based on the aforementioned contents, guidelines for enhancing the user experience of China mobile e-book App has been summarized as a result.

Conversion of Large RDF Data using Hash-based ID Mapping Tables with MapReduce Jobs (맵리듀스 잡을 사용한 해시 ID 매핑 테이블 기반 대량 RDF 데이터 변환 방법)

  • Kim, InA;Lee, Kyu-Chul
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2021.10a
    • /
    • pp.236-239
    • /
    • 2021
  • With the growth of AI technology, the scale of Knowledge Graphs continues to be expanded. Knowledge Graphs are mainly expressed as RDF representations that consist of connected triples. Many RDF storages compress and transform RDF triples into the condensed IDs. However, if we try to transform a large scale of RDF triples, it occurs the high processing time and memory overhead because it needs to search the large ID mapping table. In this paper, we propose the method of converting RDF triples using Hash-based ID mapping tables with MapReduce, which is the software framework with a parallel, distributed algorithm. Our proposed method not only transforms RDF triples into Integer-based IDs, but also improves the conversion speed and memory overhead. As a result of our experiment with the proposed method for LUBM, the size of the dataset is reduced by about 3.8 times and the conversion time was spent about 106 seconds.

  • PDF

Multi-dimensional Contextual Conditions-driven Mutually Exclusive Learning for Explainable AI in Decision-Making

  • Hyun Jung Lee
    • Journal of Internet Computing and Services
    • /
    • v.25 no.4
    • /
    • pp.7-21
    • /
    • 2024
  • There are various machine learning techniques such as Reinforcement Learning, Deep Learning, Neural Network Learning, and so on. In recent, Large Language Models (LLMs) are popularly used for Generative AI based on Reinforcement Learning. It makes decisions with the most optimal rewards through the fine tuning process in a particular situation. Unfortunately, LLMs can not provide any explanation for how they reach the goal because the training is based on learning of black-box AI. Reinforcement Learning as black-box AI is based on graph-evolving structure for deriving enhanced solution through adjustment by human feedback or reinforced data. In this research, for mutually exclusive decision-making, Mutually Exclusive Learning (MEL) is proposed to provide explanations of the chosen goals that are achieved by a decision on both ends with specified conditions. In MEL, decision-making process is based on the tree-based structure that can provide processes of pruning branches that are used as explanations of how to achieve the goals. The goal can be reached by trade-off among mutually exclusive alternatives according to the specific contextual conditions. Therefore, the tree-based structure is adopted to provide feasible solutions with the explanations based on the pruning branches. The sequence of pruning processes can be used to provide the explanations of the inferences and ways to reach the goals, as Explainable AI (XAI). The learning process is based on the pruning branches according to the multi-dimensional contextual conditions. To deep-dive the search, they are composed of time window to determine the temporal perspective, depth of phases for lookahead and decision criteria to prune branches. The goal depends on the policy of the pruning branches, which can be dynamically changed by configured situation with the specific multi-dimensional contextual conditions at a particular moment. The explanation is represented by the chosen episode among the decision alternatives according to configured situations. In this research, MEL adopts the tree-based learning model to provide explanation for the goal derived with specific conditions. Therefore, as an example of mutually exclusive problems, employment process is proposed to demonstrate the decision-making process of how to reach the goal and explanation by the pruning branches. Finally, further study is discussed to verify the effectiveness of MEL with experiments.

Comparison of Deep Learning Frameworks: About Theano, Tensorflow, and Cognitive Toolkit (딥러닝 프레임워크의 비교: 티아노, 텐서플로, CNTK를 중심으로)

  • Chung, Yeojin;Ahn, SungMahn;Yang, Jiheon;Lee, Jaejoon
    • Journal of Intelligence and Information Systems
    • /
    • v.23 no.2
    • /
    • pp.1-17
    • /
    • 2017
  • The deep learning framework is software designed to help develop deep learning models. Some of its important functions include "automatic differentiation" and "utilization of GPU". The list of popular deep learning framework includes Caffe (BVLC) and Theano (University of Montreal). And recently, Microsoft's deep learning framework, Microsoft Cognitive Toolkit, was released as open-source license, following Google's Tensorflow a year earlier. The early deep learning frameworks have been developed mainly for research at universities. Beginning with the inception of Tensorflow, however, it seems that companies such as Microsoft and Facebook have started to join the competition of framework development. Given the trend, Google and other companies are expected to continue investing in the deep learning framework to bring forward the initiative in the artificial intelligence business. From this point of view, we think it is a good time to compare some of deep learning frameworks. So we compare three deep learning frameworks which can be used as a Python library. Those are Google's Tensorflow, Microsoft's CNTK, and Theano which is sort of a predecessor of the preceding two. The most common and important function of deep learning frameworks is the ability to perform automatic differentiation. Basically all the mathematical expressions of deep learning models can be represented as computational graphs, which consist of nodes and edges. Partial derivatives on each edge of a computational graph can then be obtained. With the partial derivatives, we can let software compute differentiation of any node with respect to any variable by utilizing chain rule of Calculus. First of all, the convenience of coding is in the order of CNTK, Tensorflow, and Theano. The criterion is simply based on the lengths of the codes and the learning curve and the ease of coding are not the main concern. According to the criteria, Theano was the most difficult to implement with, and CNTK and Tensorflow were somewhat easier. With Tensorflow, we need to define weight variables and biases explicitly. The reason that CNTK and Tensorflow are easier to implement with is that those frameworks provide us with more abstraction than Theano. We, however, need to mention that low-level coding is not always bad. It gives us flexibility of coding. With the low-level coding such as in Theano, we can implement and test any new deep learning models or any new search methods that we can think of. The assessment of the execution speed of each framework is that there is not meaningful difference. According to the experiment, execution speeds of Theano and Tensorflow are very similar, although the experiment was limited to a CNN model. In the case of CNTK, the experimental environment was not maintained as the same. The code written in CNTK has to be run in PC environment without GPU where codes execute as much as 50 times slower than with GPU. But we concluded that the difference of execution speed was within the range of variation caused by the different hardware setup. In this study, we compared three types of deep learning framework: Theano, Tensorflow, and CNTK. According to Wikipedia, there are 12 available deep learning frameworks. And 15 different attributes differentiate each framework. Some of the important attributes would include interface language (Python, C ++, Java, etc.) and the availability of libraries on various deep learning models such as CNN, RNN, DBN, and etc. And if a user implements a large scale deep learning model, it will also be important to support multiple GPU or multiple servers. Also, if you are learning the deep learning model, it would also be important if there are enough examples and references.