未下载到的论文

未下载到的论文

01—— Multi-fuzzy-objective graph pattern matching in big graph environments with reliability, trust and social relationship

World Wide Web volume 23, pages649–669 (2020)Cite this article

Abstract

随着大数据时代的到来，数据的规模急剧增长，海量的多源异构数据之间有着密切的关联，可以用一张大图来形象地描绘出来。大图，尤其是来自 Web 数据、社交网络或生物特征数据的大图越来越受到研究人员的关注，它通常包含复杂的关系和多个属性。如何对大图数据进行高效的查询和匹配，是分析大图的基本问题。使用多约束图模式匹配，我们可以设计出满足我们特定需求的模式，并找到匹配的子图来定位完成特定任务所需的模式。因此如何在大图中找到具有良好属性的匹配子图成为大图研究的关键问题。考虑到子图中某个节点可能因可靠性而失效的可能性，为了选择更多更好匹配的子图，本文将模糊性和可靠性引入多目标图模式匹配中，然后使用多目标遗传算法算法NSGA-II寻找具有更高可靠性和更好属性的子图，包括社会信任和社会关系。最后，提出了一种基于可靠性的多模糊目标图模式匹配方法（命名为RMFO-GPM）。在真实数据集上的实验结果表明，与其他最先进的方法相比，所提出的 RMFO-GPM 方法的有效性。

With the advent of the era of big data, the scale of data has grown dramatically, and there is a close correlation between massive multi-source heterogeneous data, which can be visually depicted by a big graph. Big graph, especially from Web data, social networks, or biometric data, has attracted more and more attention from researchers, which usually contains complex relationships and multiple attributes. How to perform efficient query and matching on big graph data is the basic problem on analyzing big graph. Using multi-constrained graph pattern matching, we can design patterns that meet our specific requirements, and find matched subgraphs to locate the required patterns to accomplish specific tasks. So how to find matched subgraphs with good attributes in big graph becomes the key problem on big graph research. Considering the possibility that a node in a subgraph may fail due to reliability, in order to select more and better matched subgraphs, in this paper, we introduce fuzziness and reliability into multi-objective graph pattern matching, and then use a multi-objective genetic algorithm NSGA-II to find the subgraphs with higher reliability and better attributes including social trust and social relationship. Finally, a reliability-based multi-fuzzy-objective graph pattern matching method (named as RMFO-GPM) is proposed. The experimental results on real data sets show the effectiveness of the proposed RMFO-GPM method comparing with other state-of-art methods.

02——Customer Relationship Management (CRM) in financial services

https://doi.org/10.1016/S0263-2373(00)00013-XGet rights and content

Abstract

如今，许多金融服务组织都急于变得更加以客户为中心。 许多计划的一个关键组成部分是客户关系管理 (CRM) 软件的实施。 我们的研究表明，大多数机构对 CRM 的看法相当狭隘，因此收益有限。 虽然第二代 CRM 已经出现以包含整个组织（因此是企业 CRM），但总体上的成功仍未广泛传播。 在本文中，提出了一个框架，该框架基于将电子商务活动、渠道管理、关系管理和后台/前台集成整合到以客户为中心的战略中。

Today, many financial services organisations are rushing to become more customer focused. A key component of many initiatives is the implementation of Customer Relationship Management (CRM) software. Our research has highlighted that most institutions take a rather narrow view of CRM and as such, benefits have been limited. While second generation CRM has emerged to embrace the total organisation (hence Enterprise CRM), success in general has still not been widespread. In the paper, a framework is presented which is based on incorporating ebusiness activities, channel management, relationship management and back-office/front-office integration within a customer centric strategy.

03——Dynamic constraint satisfaction problems over models

在设计复杂系统的早期阶段，模型不够详细，无法用作自动综合工具的输入。相反，设计空间由代表不同有效设计候选的多个模型构成。设计空间探索旨在搜索设计空间中定义的这些候选者，以找到满足结构和数字设计约束的解决方案，并针对各种质量指标提供平衡的选择。模型驱动工程 (MDE) 环境中的设计空间探索经常被视为特定类型的约束满足问题 (CSP)。在 CSP 中，声明性约束捕获对具有有限域的变量的限制，其中变量的数量及其域都需要是先验有限的。然而，约束满足问题的现有公式可能过于严格，无法在许多 MDE 应用程序中捕获设计空间探索，其中复杂的结构约束在基础模型上表达。在本文中，我们直接在模型的上下文中解释灵活和动态的约束满足问题。这些扩展允许在求解过程中放宽约束，并解决可能发生变化并需要增量重新评估的问题。此外，我们展示了我们的原型约束求解器，用于建立在 VIATRA2 模型转换框架上的图模型领域，并通过与相关工具的比较来评估其性能。

In early phases of designing complex systems, models are not sufficiently detailed to serve as an input for automated synthesis tools. Instead, a design space is constituted by multiple models representing different valid design candidates. Design space exploration aims at searching through these candidates defined in the design space to find solutions that satisfy the structural and numeric design constraints and provide a balanced choice with respect to various quality metrics. Design space exploration in an model-driven engineering (MDE) context is frequently tackled as specific sort of constraint satisfaction problem (CSP). In CSP, declarative constraints capture restrictions over variables with finite domains where both the number of variables and their domains are required to be a priori finite. However, the existing formulation of constraint satisfaction problems can be too restrictive to capture design space exploration in many MDE applications with complex structural constraints expressed over the underlying models. In this paper, we interpret flexible and dynamic constraint satisfaction problems directly in the context of models. These extensions allow the relaxation of constraints during a solving process and address problems that are subject to change and require incremental re-evaluation. Furthermore, we present our prototype constraint solver for the domain of graph models built upon the VIATRA2 model transformation framework and provide an evaluation of its performance with comparison to related tools.

04——Utilizing Constraint Satisfaction Techniques for Efficient Graph Pattern Matching

Abstract

本文提出了一种将图匹配问题（也称为子图同态问题）表示和解决为约束满足问题 (CSP) 的方法，从而可以直接访问有关 CSP 优化解决方案算法的大量研究成果。通过将求解算法与具体的图模型解耦，这种方法允许模型的变化而不影响算法。此外，作为对标准 CSP 定义的补充，引入了一个查询概念，以允许出于优化目的抽象表示具体实现属性。

This paper presents a way to represent and solve the problem of graph matching – also known as the subgraph homomorphism problem – as a constraint satisfaction problem (CSP), opening up direct access to the large variety of research findings on optimized solution algorithms for CSPs. By decoupling the solution algorithm from the concrete graph model, this approach allows for variations of the model without affecting the algorithm. Furthermore, complementing the standard CSP definition, a query concept is introduced to allow for abstract representation of concrete implementation properties for optimization purposes.

05—— Constraint satisfaction algorithms for graph pattern matching

Abstract

图模式匹配是许多应用领域的核心问题。由于它是 NP 完全的，我们不能指望找到具有良好最坏情况性能的算法。然而，具有良好平均性能的一般程序仍有空间。在本文中，我们在约束满足框架内探索了四种不同的求解方法，并介绍了一种新算法，我们称之为 nRF+。该算法是对真正完全向前看的改进，它利用问题结构来增强向前看过程。我们正式证明 nRF+ 在访问节点数量方面优于其他方法。本文的另一个贡献是为该领域的测试算法引入了新的基准。它由一组性质非常多样化的定义明确的图组成。在这个基准测试中，我们表明 nRF+ 可以有效地解决范围广泛的问题，同时仍有许多问题实例未解决。鼓励在未来的算法评估中使用这个具有挑战性的基准。

Graph pattern matching is a central problem in many application fields. Since it is NP-complete, we cannot expect to find algorithms with a good worst-case performance. However, there is still room for general procedures with a good average performance. In this paper we explore four different solving approaches within the constraint satisfaction framework, and introduce a new algorithm, which we call nRF+. The algorithm is a refinement of really full look ahead that takes advantage of the problem structure in order to enhance the look ahead procedure. We give a formal proof that nRF+ is superior to the other approaches in terms of number of visited nodes. An additional contribution of this paper is the introduction of a new benchmark for testing algorithms in this domain. It is formed by a large set of well-defined graphs of very diverse nature. In this benchmark, we show that nRF+ can efficiently solve a broad range of problems, while still leaving many problem instances unsolved. The use of this challenging benchmark is encouraged for future algorithms evaluation.

06——Context-aware graph pattern based top-k designated

原文链接：http://www.doc88.com/p-3159197571739.html

Abstract

图形模式匹配（GPM）在许多实际应用程序中起着重要作用，在这些应用程序中，许多应用程序通常需要根据模式图而不是整个图来查找特定节点（称为指定节点v d）的Top-K匹配。一组匹配。但是，用于匹配指定节点v d的现有GPM方法在社交图中，不考虑实际应用中通常存在的社交环境，例如社交关系，社交信任和社交位置，例如社交图中的专家推荐，从而导致交付质量低下的指定节点。在本文中，我们首先提出基于conText-Aware Graph模式的Top-K设计的节点发现问题（TAG-K），其中涉及NP-完全多重约束GPM问题，因此它是NP-完全。为了解决大规模社会图中TAG-K的效率和有效性问题，我们提出了两个索引MA-Tree和SSC-Index，它们可以帮助有效地找到Top-K匹配。此外，我们提出了一种近似算法A-TAG-K。使用真实的社交网络数据集，我们通过实验验证了 A-TAG-K 在解决 TAG-K 问题的效率和有效性方面均优于现有方法。

Graph Pattern Matching (GPM) plays a significant role in many real applications, where many applications often need to find Top-K matches of a specific node, (named as the designated node v**d) based on a pattern graph, rather than the entire set of matching. However, the existing GPM methods for matching the designated node v**d in social graphs do not consider the social contexts like the social relationships, the social trust and the social positions which commonly exist in real applications, like the experts recommendation in social graphs, leading to deliver low quality designated nodes. In this paper, we first propose the conText-Aware Graph pattern based Top-K designed nodes finding problem (TAG-K), which involves the NP-Complete Multiple Constrained GPM problem, and thus it is NP-Complete. To address the efficiency and effectiveness issues of TAG-K in large-scale social graphs, we propose two indices, MA-Tree and SSC-Index, which can help efficiently find the Top-K matching. Furthermore, we propose an approximation algorithm, A-TAG-K. Using real social network datasets, we experimentally verify that A-TAG-K outperforms the existing methods in both efficiency and effectiveness for solving the TAG-K problem.