Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[BOG][B] Data mining: the textbook
CC Aggarwal - 2015 - Springer
This textbook explores the different aspects of data mining from the fundamentals to the
complex data types and their applications, capturing the wide diversity of problem domains …
complex data types and their applications, capturing the wide diversity of problem domains …
Graph-based text representation and matching: A review of the state of the art and future challenges
AH Osman, OM Barukub - IEEE Access, 2020 - ieeexplore.ieee.org
Graph-based text representation is one of the important preprocessing steps in data and text
mining, Natural Language Processing (NLP), and information retrieval approaches. The …
mining, Natural Language Processing (NLP), and information retrieval approaches. The …
Turboiso towards ultrafast and robust subgraph isomorphism search in large graph databases
WS Han, J Lee, JH Lee - Proceedings of the 2013 ACM SIGMOD …, 2013 - dl.acm.org
Given a query graph q and a data graph g, the subgraph isomorphism search finds all
occurrences of q in g and is considered one of the most fundamental query types for many …
occurrences of q in g and is considered one of the most fundamental query types for many …
Fennel: Streaming graph partitioning for massive scale graphs
Balanced graph partitioning in the streaming setting is a key problem to enable scalable and
efficient computations on massive graph data such as web graphs, knowledge graphs, and …
efficient computations on massive graph data such as web graphs, knowledge graphs, and …
An in-depth comparison of subgraph isomorphism algorithms in graph databases
J Lee, WS Han, R Kasperovics, JH Lee - Proceedings of the VLDB …, 2012 - dl.acm.org
Finding subgraph isomorphisms is an important problem in many applications which deal
with data modeled as graphs. While this problem is NP-hard, in recent years, many …
with data modeled as graphs. While this problem is NP-hard, in recent years, many …
Subgraph frequencies: Map** the empirical and extremal geography of large graph collections
A growing set of on-line applications are generating data that can be viewed as very large
collections of small, dense social graphs---these range from sets of social groups, events, or …
collections of small, dense social graphs---these range from sets of social groups, events, or …
Querying knowledge graphs by example entity tuples
We witness an unprecedented proliferation of knowledge graphs that record millions of
entities and their relationships. While knowledge graphs are structure-flexible and content …
entities and their relationships. While knowledge graphs are structure-flexible and content …
Nema: Fast graph search with label similarity
It is increasingly common to find real-life data represented as networks of labeled,
heterogeneous entities. To query these networks, one often needs to identify the matches of …
heterogeneous entities. To query these networks, one often needs to identify the matches of …
Knowledge graphs querying
A Khan - ACM SIGMOD Record, 2023 - dl.acm.org
Knowledge graphs (KGs) such as DBpedia, Freebase, YAGO, Wikidata, and NELL were
constructed to store large-scale, real-world facts as (subject, predicate, object) triples-that …
constructed to store large-scale, real-world facts as (subject, predicate, object) triples-that …
Fast and exact top-k search for random walk with restart
Graphs are fundamental data structures and have been employed for centuries to model
real-world systems and phenomena. Random walk with restart (RWR) provides a good …
real-world systems and phenomena. Random walk with restart (RWR) provides a good …