Sciweavers

4 search results - page 1 / 1
» LAW: A Workbench for Approximate Pattern Matching in Relatio...
Sort
View
IAAI
2003
13 years 5 months ago
LAW: A Workbench for Approximate Pattern Matching in Relational Data
Pattern matching for intelligence organizations is a challenging problem. The data sets are large and noisy, and there is a flexible and constantly changing notion of what consti...
Michael Wolverton, Pauline Berry, Ian W. Harrison,...
AICOM
2004
118views more  AICOM 2004»
13 years 4 months ago
Qualitative pattern matching with linguistic terms
Abstract. In the framework of possibility theory, a tool named `fuzzy pattern matching' (FPM) has been proposed in the eighties and since successfully used in flexible queryin...
Yannick Loiseau, Henri Prade, Mohand Boughanem
PODS
2010
ACM
213views Database» more  PODS 2010»
13 years 9 months ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 4 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos