Filters








120,998 Hits in 4.4 sec

Graph Summarization with Quality Guarantees

Matteo Riondato, David Garcia-Soriano, Francesco Bonchi
2014 2014 IEEE International Conference on Data Mining  
We study the problem of graph summarization.  ...  By exposing a connection between graph summarization and geometric clustering problems (i.e., k-means and k-median), we develop the first polynomial-time approximation algorithm to compute the best possible  ...  Our algorithm exploits a novel connection between graph summarization and the k-median and k-means problems.  ... 
doi:10.1109/icdm.2014.56 dblp:conf/icdm/RiondatoGB14 fatcat:piay3unu7rc57g3uobu5jalzoy

Graph summarization with quality guarantees

Matteo Riondato, David García-Soriano, Francesco Bonchi
2016 Data mining and knowledge discovery  
We study the problem of graph summarization.  ...  By exposing a connection between graph summarization and geometric clustering problems (i.e., k-means and k-median), we develop the first polynomial-time approximation algorithm to compute the best possible  ...  Our algorithm exploits a novel connection between graph summarization and the k-median and k-means problems.  ... 
doi:10.1007/s10618-016-0468-8 fatcat:xfiqrq3fm5ehzen5h3imd6tgau

Mining Summaries for Knowledge Graph Search

Qi Song, Yinghui Wu, Xin Luna Dong
2016 2016 IEEE 16th International Conference on Data Mining (ICDM)  
Use summarization to facilitate query evaluation § Graph summarization: describe the data graph with a small amount of information F(S G ) = (1−α) I(P i ) P i ∈S G ∑ + α card(S G ) −1 diff (P i , P  ...  summarization approxDis streamDis Source code: https://github.com/songqi1990/KnowGraphSum • Faster convergence with larger cache size • Cache size in general small to guarantee fast convergence  ... 
doi:10.1109/icdm.2016.0162 dblp:conf/icdm/SongWD16 fatcat:xnmpqxkgyrdkjkh6hlzkvsttaq

Graph Embedding via Graph Summarization

Jingyanning Yang, Jinguo You, Xiaorong Wan
2021 IEEE Access  
To address this issue, we present the GSE (Graph Summarization Embedding) model, a more efficient model that computes the nodes' embeddings based on graph summarization.  ...  Moreover, our model can be coupled with the main graph embedding methods and improves the Macro-F1 scores and Micro-F1 scores for classification tasks on a variety of real-world graph data.  ...  The GSum_EG algorithm with the high quality on graph summarization is a first and key step in our GSE model, guarantees the higher-order structural feature extraction in the original graph, and improves  ... 
doi:10.1109/access.2021.3067901 fatcat:6h2xmr42cbgztmazzj7o6xzodu

Graph-based submodular selection for extractive summarization

Hui Lin, Jeff Bilmes, Shasha Xie
2009 2009 IEEE Workshop on Automatic Speech Recognition & Understanding  
We propose a novel approach for unsupervised extractive summarization. Our approach builds a semantic graph for the document to be summarized.  ...  The optimization is theoretically guaranteed to be near-optimal under the framework of submodularity.  ...  In this paper, we introduce a graph-based submodular selection approach with theoretical constant-factor approximation guarantees.  ... 
doi:10.1109/asru.2009.5373486 dblp:conf/asru/LinBX09 fatcat:cs3sovgmlbbtbkwlo57iduqgiq

Navigability Graph Extraction From Large-Scale 3D Point Cloud

Imeen Ben Salah, Sebastien Kramm, Cedric Demonceaux, Pascal Vasseur
2018 2018 21st International Conference on Intelligent Transportation Systems (ITSC)  
The information is combined into a set of optimized spheres in order to facilitate its use by systems with limited resources (smartphones, robots, UAVs, ...).  ...  The main contribution of this research is to provide a navigability graph that maximizes the significance of the contents of its nodes while maintaining the full visibility of the environment.  ...  This ensures a good localization in the sphere graph. Our algorithm guarantees maximum visibility and entropy of Fig. 8 .  ... 
doi:10.1109/itsc.2018.8569447 dblp:conf/itsc/SalahKDV18 fatcat:o2yu44f7rrajjp5uswwt7nowz4

Multi-document Summarization via Budgeted Maximization of Submodular Functions

Hui Lin, Jeff A. Bilmes
2010 North American Chapter of the Association for Computational Linguistics  
We treat the text summarization problem as maximizing a submodular function under a budget constraint.  ...  functions are well defined on a graph and can naturally be used in measuring the summary quality.  ...  In this paper, we study graph-based approaches for multi-document summarization. Indeed, several graph-based methods have been proposed for extractive summarization in the past.  ... 
dblp:conf/naacl/LinB10 fatcat:rgj554jy4zfvbokfhjmynikmvq

SUMMARIZED: Efficient Framework for Analyzing Multidimensional Process Traces under Edit-distance Constraint [article]

Phuong Nguyen and Vatche Ishakian and Vinod Muthusamy and Aleksander Slominski
2019 arXiv   pre-print
We introduce summarization schemes that provide tunable trade-offs between the quality and efficiency of analysis tasks and derive an error model for summary-based similarity under an edit-distance constraint  ...  In this work, we introduce Summarized, a framework for efficient analysis on sequence-based multi-dimensional data using intuitive and user-controlled summarizations.  ...  We define a set of summarization schemes that offer flexible trade-off between quality and efficiency of analysis tasks and derive an error model for summary-based similarity under an edit-distance constraint  ... 
arXiv:1905.00983v1 fatcat:dixw656yd5gsxda5gbi5usckli

Toward Improving b-Coloring Based Clustering Using a Greedy re-Coloring Algorithm [chapter]

Tetsuya Yoshida, Haytham Elghazel, Vronique Deslandres, Mohand-Said Hacid, Alain Dussauchoy
2008 Greedy Algorithms  
there can be other partitions for the same graph with better quality, while satisfying the constraints in bcoloring.  ...  The constructed graph G(V,E) is called a superior threshold graph. The above notations are summarized in Table 1 .  ...  The other side of our greedy algorithm is that, besides it tries to improve the quality of partition while satisfying the constraints, there can still be better solutions for the re-coloring problem.  ... 
doi:10.5772/6099 fatcat:u7v6nm3tkfcrhiio4nrpcwr5y4

Summarizing Graph Patterns

Yong Liu, Jianzhong Li, Hong Gao
2008 2008 IEEE 24th International Conference on Data Engineering  
When the number of closed graph patterns is very large, RP-GD is much more efficient than RP-FP, while achieving comparable summarization quality.  ...  In this paper, we propose to summarize frequent graph patterns by a much smaller number of representative graph patterns.  ...  To guarantee graphs summarization quality, we decide whether a graph pattern can well represent another one based on some distance measure between graph patterns.  ... 
doi:10.1109/icde.2008.4497499 dblp:conf/icde/LiuLG08 fatcat:tl74lvsqojeixkmroazarowaoy

HDAG-Explorer: A System for Hierarchical DAG Summarization and Exploration

Xuliang Zhu, Xin Huang, Jinbin Huang, Byron Choi, Jianliang Xu
2020 Proceedings of the VLDB Endowment  
In this demo, we develop an interactive system of HDAG-Explorer to help users summarize HDAG with highly important and diverse vertices.  ...  However, due to massive terminologies and complex structures in a HDAG, an end user might feel difficult to explore and summarize the whole graph, which is practically useful but less studied in the literature  ...  An efficient approach is developed to find k representative vertices with quality guarantee.  ... 
dblp:journals/pvldb/Zhu0HCX20 fatcat:etpvrpeiorgrpf4ywwidxtw5x4

Summarizing Large Scale 3D Mesh

Imeen Ben Salah, Sebastien Kramm, Cedric Demonceaux, Pascal Vasseur
2018 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)  
In this paper, we propose a new method for summarizing a 3D map (Mesh) as a set of compact spheres in order to facilitate its use by systems with limited resources (smartphones, robots, UAVs, ...).  ...  Experimental results in summarizing large-scale 3D map demonstrate the feasibility of our approach and evaluate the performance of the algorithm.  ...  With this intention, we propose to find a graph inside the navigability polygon which guarantees the total oversight of the visibility polygon.  ... 
doi:10.1109/iros.2018.8593372 dblp:conf/iros/SalahKDV18 fatcat:6edasruvnvguze5ftrklvhlr64

Spectral Measurement Sparsification for Pose-Graph SLAM [article]

Kevin J. Doherty and David M. Rosen and John J. Leonard
2022 arXiv   pre-print
In experiments on benchmark pose-graph SLAM datasets, we show that our approach quickly produces high-quality sparsification results which retain the connectivity of the graph and, in turn, the quality  ...  Our algorithm, MAC (for "maximizing algebraic connectivity"), which is based on convex relaxation, is simple and computationally inexpensive, and admits formal post hoc performance guarantees on the quality  ...  Critically, these suboptimality guarantees ensure the quality of the solutions of our approach not only with respect to the relaxation, but also with respect to the original problem. B.  ... 
arXiv:2203.13897v1 fatcat:eei6zu2lubecla7mnrksag5kke

Recursive partitioning and summarization

Wahbeh Qardaji, Ninghui Li
2012 Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security - ASIACCS '12  
We show that since each query only affects a sub linear number of tuples, we are able to guarantee differential privacy.  ...  In this paper we investigate Recursive Partitioning and Summarization (RPS), a practical framework for data publishing that satisfies differential privacy.  ...  This is even more the case with larger graphs.  ... 
doi:10.1145/2414456.2414477 dblp:conf/ccs/QardajiL12 fatcat:z2nui4m2lbdqngf2zfdno5rrpa

Equi-depth Histogram Construction for Big Data with Quality Guarantees [article]

Burak Yıldız, Tolga Büyüktanır, Fatih Emekci
2016 arXiv   pre-print
The proposed method constructs approximate equi-depth histograms by merging exact equi-depth histograms of partitioned data by guaranteeing a maximum error bound on the number of items in a bucket (bucket  ...  The proposed data processing techniques should be compatible with the above frameworks in order to be practical.  ...  QUALITY GUARANTEES 3 Fig. 1.  ... 
arXiv:1606.05633v1 fatcat:mpasfs5f5neybpgwyv7uzckqdu
« Previous Showing results 1 — 15 out of 120,998 results