• Title/Summary/Keyword: Cluster-based Search

Search Result 141, Processing Time 0.032 seconds

Storing Method of Learning Resources based on Cluster for e-Learning (이러닝을 위한 클러스터 기반 학습 자원의 저장 기법)

  • Yun, Hong-Won
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.1
    • /
    • pp.155-160
    • /
    • 2007
  • A learning resource is a SCO or a collection of on or more assets in the SCORM. A storage policy is required to search rapidly and reuse assets in e-learning environment. However there are not research results about it. In this paper, We propose a storing method for assets based on cluster and define the mathematical formulation of it. Also, we present criteria for assets evaluation and describe procedure to evaluate each asset. We show that the search based on proposed cluster storing method increase performance than the categorization search through performance evaluation.

Trust Predicated Routing Framework with Optimized Cluster Head Selection using Cuckoo Search Algorithm for MANET

  • Sekhar, J. Chandra;Prasad, Ramineni Sivarama
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.4 no.2
    • /
    • pp.115-125
    • /
    • 2015
  • This paper presents a Cuckoo search algorithm to secure adversaries misdirecting multi-hop routing in Mobile ad hoc networks (MANETs) using a robust Trust Predicated Routing Framework with an optimized cluster head selection. The clustering technique designed in this framework leads to efficient routing in MANETs. The heavy work load in the node causes an energy drop in cluster head, which leads to re-clustering of the group, and another cluster head is selected to avoid packet loss during data transmission. The problem in the re-clustering process is that the overall efficiency of the routing process is reduced and the processing time is increased. A Cuckoo search based optimization algorithm is proposed to solve the problem of re-clustering by selecting the secondary cluster head within the initially formed cluster group and eliminating the reclustering process. The proposed framework enables a node to select a reliable and secure route for MANET and the performance can be evaluated by comparing the simulated results with the AODV routing protocol, which shows that the performance of the proposed routing protocol are improved significantly.

Fast Search Algorithm for Determining the Optimal Number of Clusters using Cluster Validity Index (클러스터 타당성 평가기준을 이용한 최적의 클러스터 수 결정을 위한 고속 탐색 알고리즘)

  • Lee, Sang-Wook
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.9
    • /
    • pp.80-89
    • /
    • 2009
  • A fast and efficient search algorithm to determine an optimal number of clusters in clustering algorithms is presented. The method is based on cluster validity index which is a measure for clustering optimality. As the clustering procedure progresses and reaches an optimal cluster configuration, the cluster validity index is expected to be minimized or maximized. In this Paper, a fast non-exhaustive search method for finding the optimal number of clusters is designed and shown to work well in clustering. The proposed algorithm is implemented with the k-mean++ algorithm as underlying clustering techniques using CB and PBM as a cluster validity index. Experimental results show that the proposed method provides the computation time efficiency without loss of accuracy on several artificial and real-life data sets.

Configurations of Knowledge Search in Knowledge-Intensive Industries (지식기반산업에서 기업의 지식탐색 유형: 구성형태적 접근)

  • Huh, Moon-Goo;Lee, Jaegun
    • Journal of Technology Innovation
    • /
    • v.25 no.3
    • /
    • pp.299-331
    • /
    • 2017
  • This research details firm knowledge search types based on the locus and features for Korean firms in the knowledge-based industry, and then analyzes differences in innovation performance according to the types from the view of a configurational approach. Existing research has mainly concentrated on establishing a relation between knowledge search and outcome variables. Consequently, firms have relatively insufficient understanding of how to systematize knowledge search. Hence, this research classifies knowledge search into four dimensions-external search breadth, external search depth, internal search breadth, and internal search depth-by the locus and features of search. Furthermore, the research draws actual types of knowledge search of firms and analyzes differences in innovation performance. The main result of the research is as follows. First, the research reasons out six clusters of firms which have a dissimilar knowledge search type. Each cluster shows differences while participating in every dimension of knowledge search or few dimensions. Second, as for innovation performance, each cluster shows different exploitative and exploratory innovation performance according to their knowledge search type. This research applies a configurational approach while existing research applied a reductionistic approach, thereby establishing the major contribution which enables us to study a phenomenon as it comes, not to analyze variables and relationships of variables. Lastly, the research suggests a future direction of research based on the result of this research.

Known-Item Retrieval Performance of a PICO-based Medical Question Answering Engine

  • Vong, Wan-Tze;Then, Patrick Hang Hui
    • Asia pacific journal of information systems
    • /
    • v.25 no.4
    • /
    • pp.686-711
    • /
    • 2015
  • The performance of a novel medical question-answering engine called CliniCluster and existing search engines, such as CQA-1.0, Google, and Google Scholar, was evaluated using known-item searching. Known-item searching is a document that has been critically appraised to be highly relevant to a therapy question. Results show that, using CliniCluster, known-items were retrieved on average at rank 2 ($MRR@10{\approx}0.50$), and most of the known-items could be identified from the top-10 document lists. In response to ill-defined questions, the known-items were ranked lower by CliniCluster and CQA-1.0, whereas for Google and Google Scholar, significant difference in ranking was not found between well- and ill-defined questions. Less than 40% of the known-items could be identified from the top-10 documents retrieved by CQA-1.0, Google, and Google Scholar. An analysis of the top-ranked documents by strength of evidence revealed that CliniCluster outperformed other search engines by providing a higher number of recent publications with the highest study design. In conclusion, the overall results support the use of CliniCluster in answering therapy questions by ranking highly relevant documents in the top positions of the search results.

A Method of Clustering for SCOs in the SCORM (SCORM에서 SCO의 클러스터링 기법)

  • Yun, Hong-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.12
    • /
    • pp.2230-2234
    • /
    • 2006
  • A SCO is a learning resource that is retrieved by a learner in the SCORM. A storage policy is required a learner to search SCOs rapidly in e-learning environment. In this paper, We define the mathematical formulation of clustering method for SCOs. Also we present criteria for cluster evaluation and describe procedure to evaluate each SCO. We show the search based on proposed clustering method increase performance than the existing search though performance evaluation.

The Security Constrained Economic Dispatch with Line Flow Constraints using the Multi PSO Algorithm Based on the PC Cluster System (PC 클러스터 기반의 Multi-HPSO를 이용한 안전도 제약의 경제급전)

  • Jang, Se-Hwan;Kim, Jin-Ho;Park, Jong-Bae;Park, June-Ho
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.9
    • /
    • pp.1658-1666
    • /
    • 2009
  • This paper proposes an approach of Mult_HPSO based on the PC cluster system to reduce or remove the stagnation on an early convergence effect of PSO, reduce an execution time and improve a search ability on an optimal solution. Hybrid PSO(HPSO) is combines the PSO(Particle Swarm Optimization) with the mutation of conventional GA(Genetic Algorithm). The conventional PSO has operated a search process in a single swarm. However, Multi_PSO operates a search process through multiple swarms, which increments diversity of expected solutions and reduces the execution time. Multiple Swarms are composed of unsynchronized PC clusters. We apply to SCED(security constrained economic dispatch) problem, a nonlinear optimization problem, which considers line flow constraints and N-1 line contingency constraints. To consider N-1 line contingency in power system, we have chosen critical line contingency through a process of Screening and Selection based on PI(performace Index). We have applied to IEEE 118 bus system for verifying a usefulness of the proposed approaches.

A study on searching image by cluster indexing and sequential I/O (연속적 I/O와 클러스터 인덱싱 구조를 이용한 이미지 데이타 검색 연구)

  • Kim, Jin-Ok;Hwang, Dae-Joon
    • The KIPS Transactions:PartD
    • /
    • v.9D no.5
    • /
    • pp.779-788
    • /
    • 2002
  • There are many technically difficult issues in searching multimedia data such as image, video and audio because they are massive and more complex than simple text-based data. As a method of searching multimedia data, a similarity retrieval has been studied to retrieve automatically basic features of multimedia data and to make a search among data with retrieved features because exact match is not adaptable to a matrix of features of multimedia. In this paper, data clustering and its indexing are proposed as a speedy similarity-retrieval method of multimedia data. This approach clusters similar images on adjacent disk cylinders and then builds Indexes to access the clusters. To minimize the search cost, the hashing is adapted to index cluster. In addition, to reduce I/O time, the proposed searching takes just one I/O to look up the location of the cluster containing similar object and one sequential file I/O to read in this cluster. The proposed schema solves the problem of multi-dimension by using clustering and its indexing and has higher search efficiency than the content-based image retrieval that uses only clustering or indexing structure.

PC Cluster Based Parallel Genetic Algorithm-Tabu Search for Service Restoration of Distribution Systems (PC 클러스터 기반 병렬 유전 알고리즘-타부 탐색을 이용한 배전계통 고장 복구)

  • Mun Kyeong-Jun;Lee Hwa-Seok;Park June Ho
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.54 no.8
    • /
    • pp.375-387
    • /
    • 2005
  • This paper presents an application of parallel Genetic Algorithm-Tabu Search (GA-TS) algorithm to search an optimal solution of a service restoration in distribution systems. The main objective of service restoration of distribution systems is, when a fault or overload occurs, to restore as much load as possible by transferring the do-energized load in the out of service area via network reconfiguration to the appropriate adjacent feeders at minimum operational cost without violating operating constraints, which is a combinatorial optimization problem. This problem has many constraints with many local minima to solve the optimal switch position. This paper develops parallel GA-TS algorithm for service restoration of distribution systems. In parallel GA-TS, GA operators are executed for each processor. To prevent solutions of low fitness from appearing in the next generation, strings below the average fitness are saved in the tabu list. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper $10\%$ of the population to enhance the local searching capabilities. With migration operation, best string of each node is transferred to the neighboring node after predetermined iterations are executed. For parallel computing, we developed a PC cluster system consists of 8 PCs. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through ethernet switch based fast ethernet. To show the validity of the proposed method, proposed algorithm has been tested with a practical distribution system in Korea. From the simulation results, we can find that the proposed algorithm is efficient for the distribution system service restoration in terms of the solution quality, speedup, efficiency and computation time.

Cluster or Diversify? A Dilemma for Sustainable Local Techno-Economic Development

  • Phillips, Fred;Oh, Deog-Seong;Lee, Eung-Hyun
    • World Technopolis Review
    • /
    • v.5 no.2
    • /
    • pp.98-107
    • /
    • 2016
  • By highlighting the efficiencies gained from regional specialization, the cluster concept has distracted economic development officials from their traditional role of diversifying regional and local economies. Clustering was a viable strategy for much of the 18 years following its original appearance in the literature. Now, two events cast doubt on the continued viability of cluster-based specialization. First, the digital convergence has blurred the boundaries that once separated one industry from another. An industry cluster strategy becomes difficult when the industry cannot be defined. Second, many cluster initiatives fail. Combining literature search with the system-theoretic notions of efficiency and redundancy, we find many factors moderate cluster success. This implies regions facing uncertain success in their cluster-building efforts should thoroughly understand their unique circumstances and build upon them. Regions with successful clusters are advised to aim for multiple related clusters or superclusters.