Community search is a problem of finding densely connected subgraphs that satisfy the query conditions in network, which has attracted much attention recent years. However, all previous studies on community do not consider influence community. In this paper, we introduce novel model called k -influential based concept -core, can capture Based new model, propose linear-time online algorithm to find top- r communities network. To further speed up influential algorithm, devise linear-space...

Photocatalytic overall water splitting is a promising approach for sustainable hydrogen provision using solar energy. For sufficient energy utilization, this reaction ought to be operated based on visible-light-active semiconductors, which very challenging. In work, an F-expedited nitridation strategy applied modify the wide-bandgap semiconductor Sr2TiO4 visible-light-driven photocatalytic splitting. Compared conventional approach, introduces desirable integration of high concentration N...

The k-core decomposition in a graph is fundamental problem for social network analysis. of to calculate the core number every node graph. Previous studies mainly focus on static There exists linear time algorithm However, many real-world applications such as online networks and Internet, typically evolves overtime. In applications, key issue maintain numbers nodes when changes A simple implementation perform recompute after updated. Such expensive very large. this paper, we propose new...

Community search is a fundamental graph mining task. Unfortunately, most previous community studies focus mainly on identifying communities in network without temporal information. In this paper, we study the problem of finding persistent network, which every edge associated with timestamp. Our goal to identify that are over time. To end, propose novel model called (θ,τ) community. We prove maximum k-core NP-hard. solve problem, branch and bound algorithm several carefully-designed pruning...

Mining dense subgraphs from a large graph is fundamental mining task and can be widely applied in variety of application domains such as network science, biology, database, web mining, compression, micro-blogging systems. Here subgraph defined with high density (#.edge / #.node). Existing studies this problem either focus on finding the densest or identifying an optimal clique-like subgraph, they adopt simple greedy approach to find top-k subgraphs. However, their identified cannot used...

Random walk based graph sampling has been recognized as a fundamental technique to collect uniform node samples from large graph. In this paper, we first present comprehensive analysis of the drawbacks three widely-used random algorithms, called re-weighted (RW) algorithm, Metropolis-Hastings (MH) algorithm and maximum-degree (MD) algorithm. Then, address limitations these propose two general named rejection-controlled (RCMH) generalized (GMD) We show that RCMH balances tradeoff between RW...

Previous chapter Next Full AccessProceedings Proceedings of the 2012 SIAM International Conference on Data Mining (SDM)Robust Reputation-Based Ranking Bipartite Rating NetworksRong-Hua Li, Jeffery Xu Yu, Xin Huang, and Hong ChengRong-Hua Chengpp.612 - 623Chapter DOI:https://doi.org/10.1137/1.9781611972825.53PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstract With growth Internet E-commerce, bipartite rating networks are ubiquitous. In such...

Given a scientific collaboration network, how can we find group of collaborators with high research indicator (e.g., h-index) and diverse interests? social identify the communities that have influence PageRank) also similar interests to specified user? In such settings, network be modeled as multi-valued where each node has d ($d \ge 1$) numerical attributes (i.e., h-index, diversity, PageRank, similarity score, etc.). want are not dominated by other in terms attributes. Most existing...

Dual direction current modulation has been enabled in an asymmetric electrode configuration, which mediated by optoelectronic signals to emulate the important synaptic plasticity.

Temporal community search is an important task in graph analysis, which has been widely used many practical applications. However, existing methods suffer from two major defects: (i) they only require that the target result contains query vertex q , leading to temporal proximity between and other vertices being ignored. Thus, may find irrelevant (these are called query-drifted vertices) concerning for satisfying their objective functions; (ii) NP-hard, incurring high costs exact solutions or...

Link prediction is a fundamental problem in social network analysis. The key technique unsupervised link to find an appropriate similarity measure between nodes of network. A class wildly used measures are based on random walk graph. traditional (TRW) considers the structures by treating all equivalently, and ignores centrality However, many real networks, not only prefer similar node, but also central To address this issue, we use maximal entropy (MERW) for prediction, which incorporates...

The vehicle location prediction based on their spatial and temporal information is an important difficult task in many applications. In the last few years, devices, such as connected vehicles, smart phones, GPS navigation systems, home appliances, have amassed large stores of geographic data. leveraging this data by employing moving objects database techniques to predict spatio-temporal locations accurate efficient fashion, comprising a complete trajectory remains actively researched area....

Community discovery plays an essential role in the analysis of structural features complex networks. Since online networks grow increasingly large and over time, methods traditionally used for community cannot efficiently handle large-scale network data. This introduces important problem how to effectively discover communities from In this study, we propose a fast parallel model called picaso (a algorithm based on approximate optimization), which integrates two new techniques: (1) Mountain...

The Group Steiner Tree (GST) problem is a fundamental in database area that has been successfully applied to keyword search relational databases and team social networks. state-of-the-art algorithm for the GST parameterized dynamic programming (DP) algorithm, which finds optimal tree O(3kn+2k(n log n + m)) time, where k number of given groups, m are edges nodes graph respectively. major limitations DP twofold: (i) it intractable even very small values (e.g., k=8) large graphs due its...

Abstract Photocatalytic carbon‐carbon (C─C) coupling of benzyl alcohol is a promising means to coproduce the value‐added chemicals with H 2 but generally subject low efficiency in terms photon utilization. Here, efficient C─C achieved over Zn In S 5 containing tunable content vacancies ( V ). The tends form shallow defect states below conduction band that can expedite photocarrier separation by collecting photo‐generated electrons. ‐collected electrons are essential for high selectivity...

The paper is devoted to the construction of generalized difference methods on irregular meshes for second order nonlinear elliptic equations based Galerkin method. error estimate proved.

Social contagion depicts a process of information (e.g., fads, opinions, news) diffusion in the online social networks. A recent study reports that probability is tightly controlled by number connected components an individual's neighborhood. Such termed structural diversity individual and it shown to be key predictor process. Based on this, fundamental issue network find top- k users with highest diversities. In this paper, we, for first time, search problem large network. Specifically, we...

Periodicity is a frequently happening phenomenon for social interactions in temporal networks. Mining periodic communities are essential to understanding group behaviors Unfortunately, most previous studies community mining networks ignore the patterns of communities. In this paper, we study problem seeking network, where each edge associated with set timestamps. We propose novel model, called maximal σ-periodic k-clique, that represents Specifically, k-clique clique size larger than k...

Overall water splitting (OWS), liberating H2 and O2 in a 2:1 ratio, based on powdery photocatalysts, represents simple cost-effective means for solar hydrogen production. For an efficient energy harvest, the use of OWS reactions should be operated using narrow-band gap semiconductors, which remains great challenge. In this work, photocatalytic reactions, operable up to 600 nm, have been achieved over semiconductor LaTiO2N with single-crystalline nanosheet morphology. These nanosheets,...

Uncertainty in graph data occurs for a variety of reasons, such as noise and measurement errors. Recently, uncertain management analysis have attracted many research attentions. Among them, computing k-cores graphs (aka, (k, η)-cores) is an important problem has emerged applications, example, community detection, protein-protein interaction network influence maximization. Given graph, the η)-cores can be derived by iteratively removing vertex with η-degree less than k updating η-degrees its...