Filters








199 Hits in 6.2 sec

Subgraph Pattern Matching over Uncertain Graphs with Identity Linkage Uncertainty [article]

Walaa Eldin Moustafa, Angelika Kimmig, Amol Deshpande, Lise Getoor
2013 arXiv   pre-print
We introduce a general framework for constructing a PEG given uncertain data at the reference level and develop highly efficient algorithms to answer subgraph pattern matching queries in this setting.  ...  Two common types of uncertainty are uncertainty over the attribute values of nodes and uncertainty over the existence of edges. In this paper, we combine those with identity uncertainty.  ...  SUBGRAPH PATTERN MATCHING We now define the task of subgraph pattern matching over uncertain graphs.  ... 
arXiv:1305.7006v1 fatcat:6nii7uimsbec5l7pwybqh5iz3q

Subgraph pattern matching over uncertain graphs with identity linkage uncertainty

Walaa Eldin Moustafa, Angelika Kimmig, Amol Deshpande, Lise Getoor
2014 2014 IEEE 30th International Conference on Data Engineering  
We introduce a general framework for constructing a PEG given uncertain data at the reference level and develop efficient algorithms to answer subgraph pattern matching queries in this setting.  ...  A PEG is a probabilistic graph model that defines a distribution over possible graphs at the entity level.  ...  SUBGRAPH PATTERN MATCHING We now define the task of subgraph pattern matching over uncertain graphs based on the notion of match in graphs without uncertainty.  ... 
doi:10.1109/icde.2014.6816710 dblp:conf/icde/MoustafaKDG14 fatcat:22zqmlwttffarmgfvirlelocou

ICDE conference 2014 detailed author index

2014 2014 IEEE 30th International Conference on Data Engineering  
Efficient Instant-Fuzzy Search with Proximity Ranking Kimmig, Angelika 904 Subgraph Pattern Matching Over Uncertain Graphs with Identity Linkage Uncertainty Kllapi, Herald 1120 Near Neighbor  ...  Pattern Matching Over Uncertain Graphs with Identity Linkage Uncertainty Mühlbauer, Tobias 592 Locality-Sensitive Operators for Parallel Main-Memory Database Clusters [Search] A B C D E F G H  ... 
doi:10.1109/icde.2014.6816627 fatcat:bmnfkwqucfcmhet64s2o6ns5ky

ICDE conference 2014 table of contents

2014 2014 IEEE 30th International Conference on Data Engineering  
Over Uncertain Graphs with Identity Linkage Uncertainty (Walaa Eldin Moustafa, Angelika Kimmig, Amol Deshpande, Lise Getoor) 916 User-Driven Refinement of Imprecise Queries (Bahar Qarabaqi, Mirek  ...  and Probabilistic Data 892 Efficient and Accurate Query Evaluation on Uncertain Graphs via Recursive Stratified Sampling (Rong-Hua Li, Jeffrey Xu Yu, Rui Mao, Tan Jin) 904 Subgraph Pattern Matching  ... 
doi:10.1109/icde.2014.6816625 fatcat:pm3vcptvmvb6pcjrbq75awpvtq

Ranking queries on uncertain data

Ming Hua, Jian Pei, Xuemin Lin
2010 The VLDB journal  
Consequently, record linkages are often uncertain. Probabilistic record linkages are often used to model the uncertainty.  ...  A probability is associated with each linkage, representing the confidence of the match.  ... 
doi:10.1007/s00778-010-0196-4 fatcat:xogk2bxoyfbapdjvjdmrfdseua

Expert system for crop disease based on graph pattern matching: a proposal

Emmanuel Lasso, Juan Carlos Corrales
2016 Revista Ingenierías Universidad de Medellín  
Furthermore, graphs can be used to store different types of variables present in a crop environment, allowing the application of graph data mining techniques like graph pattern matching.  ...  In this paper, we present an overview of the above issues and the proposal of an expert system for crop disease based on graph pattern matching.  ...  ., [29] try to deal with the problem of uncertain graphs with identity linkage uncertainty through the creation of a set of algorithms based on two ideas: context-aware path indexing and reduction by  ... 
doi:10.22395/rium.v15n29a5 fatcat:nvnlsboud5eqlotaq6suwczebm

Domain-independent data cleaning via analysis of entity-relationship graph

Dmitri V. Kalashnikov, Sharad Mehrotra
2006 ACM Transactions on Database Systems  
Our extensive experiments over two real data sets and over synthetic datasets show that analysis of relationships significantly improves quality of the result.  ...  If unc 1 = 2.0, the uncertainty is very high: for any given author, there is exactly one other author with the identical authorName.  ...  In Pasula et al. [2002] , the authors study the problem of identity uncertainty (object consolidation, fuzzy grouping) and specifically its application to the problem of citation matching.  ... 
doi:10.1145/1138394.1138401 fatcat:l2encb2zhbbzrm7fwixzinjvjm

Linguagens de consulta para bases de dados em grafos: um mapeamento sistemático

Simone De Oliveira Santos, Martin Musicante, Mirian Halfeld Ferrari Alves
2016 Revista de Informática Teórica e Aplicada  
Subgraph pattern matching over uncertain graphs with identity linkage uncertainty. In IEEE 30th International Conference on Data Engineering (ICDE), pages 904-915, March 2014 -Jiwon Seo, S.  ...  Subgraph pattern matching over uncertain graphs with identity linkage uncertainty. In IEEE 30th International Conference on Data Engineering (ICDE), pages 904-915, March 2014. [69] A. Naseer, L.  ... 
doi:10.22456/2175-2745.54043 fatcat:djriqmqe2jd3ne3wtqdqbdjxle

29th International Conference on Data Engineering [book of abstracts]

2013 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW)  
Traditional subgraph querying based on subgraph isomorphism requires identical label matching, which is often too restrictive to capture the matches that are semantically close to the query graphs.  ...  pattern matching" over historical data.  ... 
doi:10.1109/icdew.2013.6547409 fatcat:wadzpuh3b5htli4mgb4jreoika

A survey of graph-modification techniques for privacy-preserving on networks

Jordi Casas-Roma, Jordi Herrera-Joancomartí, Vicenç Torra
2016 Artificial Intelligence Review  
These methods allow researchers and third-parties to apply all graph-mining processes on anonymous data, from local to global knowledge extraction.  ...  In this paper we summarize privacy-preserving techniques, focusing on graph-modification methods which alter graph's structure and release the entire anonymous network.  ...  An uncertain graph is (k, )-obfuscation with respect to property P if the entropy of the distribution Y P (v) over at least (1 − )n vertices of G is greater than or equal to log 2 (k), i.e.  ... 
doi:10.1007/s10462-016-9484-8 fatcat:urgdo2l35rag3bneqgmwyxnkhm

Exploiting relationships for object consolidation

Zhaoqi Chen, Dmitri V. Kalashnikov, Sharad Mehrotra
2005 Proceedings of the 2nd international workshop on Information quality in information systems - IQIS '05  
Our empirical study over real datasets shows that analyzing relationships significantly improves the quality of the result. * RelDC project  ...  The approach then applies graph partitioning techniques to accurately cluster object representations.  ...  In that situation there is no uncertainty associated with X: the value of X is always xi.  ... 
doi:10.1145/1077501.1077512 dblp:conf/iqis/ChenKM05 fatcat:77adln4ip5dspjfq5xht4cilci

Unstable Communities in Network Ensembles

Ahsanur Rahman, Steve T. K. Jan, Hyunju Kim, B. Aditya Prakash, T. M. Murali
2016 Proceedings of the 2016 SIAM International Conference on Data Mining  
We find several node sets that capture the uncertain connectivity of genes in relevant protein complexes, suggesting that further experiments may be required to precisely discern their interaction patterns  ...  We propose another algorithm, SDMiner, that can exactly enumerate all maximal unstable communities with small (scaled) subgraph divergence.  ...  subgraphs sharing a large fraction of edges to be identical.  ... 
doi:10.1137/1.9781611974348.57 dblp:conf/sdm/RahmanJKPM16 fatcat:zjbfunip2vc7pex5fqwye5j27a

Bargaining and network structure: An experiment

Gary Charness, Margarida Corominas-Bosch, Guillaume R. Fréchette
2007 Journal of Economic Theory  
We consider bargaining in a bipartite network of buyers and sellers, who can only trade with the limited number of people with whom they are connected.  ...  We perform an experimental test of a graph-theoretic model that yields unique predictions about equilibrium prices for the networks in our sessions.  ...  This research was undertaken while Charness was affiliated with Universitat Pompeu Fabra. Fréchette's research was partially supported by the Center for Experimental Social Science and the C.V.  ... 
doi:10.1016/j.jet.2005.06.009 fatcat:dlwwn6p2x5ecphfs65jgomqyby

Bargaining and Network Structure: An Experiment

Gary Charness, Margarida Corominas-Bosch, Guillaume R. Frechette
2000 Social Science Research Network  
We consider bargaining in a bipartite network of buyers and sellers, who can only trade with the limited number of people with whom they are connected.  ...  We perform an experimental test of a graph-theoretic model that yields unique predictions about equilibrium prices for the networks in our sessions.  ...  This research was undertaken while Charness was affiliated with Universitat Pompeu Fabra. Fréchette's research was partially supported by the Center for Experimental Social Science and the C.V.  ... 
doi:10.2139/ssrn.248669 fatcat:qaz4fzbvgbcp3hvaj4x3ohe5qe

Learning Language from a Large (Unannotated) Corpus [article]

Linas Vepstas, Ben Goertzel
2014 arXiv   pre-print
The suggested approach builds on the authors' prior work with the Link Grammar, RelEx and OpenCog systems, as well as on a number of prior papers and approaches from the statistical language learning literature  ...  With link types, there may be no valid linkage at all.  ...  Parsing establishes a graph that provides a context for differences in subgraphs.  ... 
arXiv:1401.3372v1 fatcat:cl7huumnvbfppottck6jldcyji
« Previous Showing results 1 — 15 out of 199 results