[图书][B] An introduction to outlier analysis

CC Aggarwal, CC Aggarwal - 2017 - Springer
Outliers are also referred to as abnormalities, discordants, deviants, or anomalies in the data
mining and statistics literature. In most applications, the data is created by one or more …

Big graph analytics: The state of the art and future research agenda

A Cuzzocrea, IY Song - Proceedings of the 17th International Workshop …, 2014 - dl.acm.org
Analytics over big graphs is becoming a first-class challenge in database research, with fast-
growing interest from both the academia and the industrial community. This problem arises …

High fidelity data reduction for big data security dependency analyses

Z Xu, Z Wu, Z Li, K Jee, J Rhee, X Xiao, F Xu… - Proceedings of the …, 2016 - dl.acm.org
Intrusive multi-step attacks, such as Advanced Persistent Threat (APT) attacks, have plagued
enterprises with significant financial losses and are the top reason for enterprises to …

Automated personalized feedback in introductory Java programming MOOCs

VJ Marin, T Pereira, S Sridharan… - 2017 ieee 33rd …, 2017 - ieeexplore.ieee.org
Currently, there is a" boom" in introductory programming courses to help students develop
their computational thinking skills. Providing timely, personalized feedback that makes …

Multi-functional secure data aggregation schemes for WSNs

P Zhang, J Wang, K Guo, F Wu, G Min - Ad Hoc Networks, 2018 - Elsevier
Secure data aggregation schemes are widely adopted in wireless sensor networks, not only
to minimize the energy and bandwidth consumption, but also to enhance the security …

Diversified top-k subgraph querying in a large graph

Z Yang, AWC Fu, R Liu - … of the 2016 International Conference on …, 2016 - dl.acm.org
Subgraph querying in a large data graph is interesting for different applications. A recent
study shows that top-k diversified results are useful since the number of matching subgraphs …

Fast top-k search in knowledge graphs

S Yang, F Han, Y Wu, X Yan - 2016 IEEE 32nd international …, 2016 - ieeexplore.ieee.org
Given a graph query Q posed on a knowledge graph G, top-k graph querying is to find k
matches in G with the highest ranking score according to a ranking function. Fast top-k …

Efficient structure similarity searches: a partition-based approach

X Zhao, C Xiao, X Lin, W Zhang, Y Wang - The VLDB Journal, 2018 - Springer
Graphs are widely used to model complex data in many applications, such as bioinformatics,
chemistry, social networks, pattern recognition. A fundamental and critical query primitive is …

Ranked enumeration of conjunctive query results

S Deep, P Koutris - arXiv preprint arXiv:1902.02698, 2019 - arxiv.org
We investigate the enumeration of top-k answers for conjunctive queries against relational
databases according to a given ranking function. The task is to design data structures and …

Local learning for mining outlier subgraphs from network datasets

M Gupta, A Mallya, S Roy, JHD Cho, J Han - Proceedings of the 2014 SIAM …, 2014 - SIAM
In the real world, various systems can be modeled using entity-relationship graphs. Given
such a graph, one may be interested in identifying suspicious or anomalous subgraphs …