Sciweavers

404 search results - page 39 / 81
» Correlation search in graph databases
Sort
View
SSDBM
2010
IEEE
185views Database» more  SSDBM 2010»
13 years 7 months ago
DESSIN: Mining Dense Subgraph Patterns in a Single Graph
Currently, a large amount of data can be best represented as graphs, e.g., social networks, protein interaction networks, etc. The analysis of these networks is an urgent research ...
Shirong Li, Shijie Zhang, Jiong Yang
SIGMOD
2007
ACM
111views Database» more  SIGMOD 2007»
14 years 8 months ago
Query relaxation using malleable schemas
In contrast to classical databases and IR systems, real-world information systems have to deal increasingly with very vague and diverse structures for information management and s...
Xuan Zhou, Julien Gaugaz, Wolf-Tilo Balke, Wolfgan...
KDD
2010
ACM
244views Data Mining» more  KDD 2010»
13 years 7 months ago
Finding effectors in social networks
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
Theodoros Lappas, Evimaria Terzi, Dimitrios Gunopu...
CVPR
2001
IEEE
14 years 10 months ago
Understanding Popout through Repulsion
Perceptual popout is defined by both feature similarity and local feature contrast. We identify these two measures with attraction and repulsion, and unify the dual processes of a...
Stella X. Yu, Jianbo Shi
ICDE
2009
IEEE
135views Database» more  ICDE 2009»
14 years 10 months ago
Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
Alexander Behm, Shengyue Ji, Chen Li, Jiaheng Lu