scholarly journals Module library development via graph mining

2021 ◽  
Author(s):  
Jianpeng Cao ◽  
Daniel Hall
Keyword(s):  
Graph Mining ◽  
Library Development

Understanding the Roles of Public Libraries in (Inter)National Development: Lessons from India

2013 ◽  
Author(s):  
Ajit K Pyati
Keyword(s):  
Public Libraries ◽  
National Development ◽  
Public Library ◽  
Information Policy ◽  
Library Development ◽  
State Actors

This paper focuses on the roles of public libraries in overall plans and schemes for Indian national development, focusing on issues of power and representation. The roles of state and non-state actors in Indian public library development are explored within the context of larger international information policy and development debates.Cet article porte sur les rôles des bibliothèques publiques dans les plans et les schémas globaux du développement national de l'Inde, et plus précisément sur les enjeux de pouvoir et de représentation. Seront explorés les rôles de l'état et des autres intervenants dans le développement des bibliothèques publiques indiennes dans le contexte de politiques d'information plus vastes et des débats sur le développement. 

Production of regional encyclopedias by the library science as an important way of library development in regions

2017 ◽  
pp. 93-102
Author(s):  
Viktor Sokolov
Keyword(s):  
Library Science ◽  
Current State ◽  
Library Development

The study describes general issues in regional encyclopedia publishing. Some problems of making of the regional encyclopedias by library science were analyzed in connection with the development of a library policy in Ukrainian regions; the current state of development the encyclopedia publishing and making of the library encyclopedias in Ukraine is highlighted.

Dynamic Graph Mining for Multi-weight Multi-destination Route Planning with Deadlines Constraints

2021 ◽  
Vol 15 (1) ◽  
pp. 1-32
Author(s):  
Yu Huang ◽  
Josh Jia-Ching Ying ◽  
Philip S. Yu ◽  
Vincent S. Tseng
Keyword(s):  
Graph Mining ◽  
Route Planning ◽  
Dynamic Graph

Scalable mining of maximal quasi-cliques

2020 ◽  
Vol 14 (4) ◽  
pp. 573-585
Author(s):  
Guimu Guo ◽  
Da Yan ◽  
M. Tamer Özsu ◽  
Zhe Jiang ◽  
Jalal Khalil
Keyword(s):  
Graph Mining ◽  
State Of The Art ◽  
Minimum Degree ◽  
The Other ◽  
Dense Subgraph ◽  
Load Imbalance ◽  
Subgraph Mining ◽  
Execution Engine ◽  
Clique Algorithm ◽  
Dense Subgraph Mining

Given a user-specified minimum degree threshold γ , a γ -quasiclique is a subgraph g = (V g , E g ) where each vertex ν ∈ V g connects to at least γ fraction of the other vertices (i.e., ⌈ γ · (| V g |- 1)⌉ vertices) in g. Quasi-clique is one of the most natural definitions for dense structures useful in finding communities in social networks and discovering significant biomolecule structures and pathways. However, mining maximal quasi-cliques is notoriously expensive. In this paper, we design parallel algorithms for mining maximal quasi-cliques on G-thinker, a distributed graph mining framework that decomposes mining into compute-intensive tasks to fully utilize CPU cores. We found that directly using G-thinker results in the straggler problem due to (i) the drastic load imbalance among different tasks and (ii) the difficulty of predicting the task running time. We address these challenges by redesigning G-thinker's execution engine to prioritize long-running tasks for execution, and by utilizing a novel timeout strategy to effectively decompose long-running tasks to improve load balancing. While this system redesign applies to many other expensive dense subgraph mining problems, this paper verifies the idea by adapting the state-of-the-art quasi-clique algorithm, Quick, to our redesigned G-thinker. Extensive experiments verify that our new solution scales well with the number of CPU cores, achieving 201× runtime speedup when mining a graph with 3.77M vertices and 16.5M edges in a 16-node cluster.

Sign in / Sign up

Export Citation Format

Share Document