Sciweavers

4874 search results - page 766 / 975
» Information theory for data management
Sort
View
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
16 years 7 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
KDD
2007
ACM
154views Data Mining» more  KDD 2007»
16 years 7 months ago
An event-based framework for characterizing the evolutionary behavior of interaction graphs
Interaction graphs are ubiquitous in many fields such as bioinformatics, sociology and physical sciences. There have been many studies in the literature targeted at studying and m...
Sitaram Asur, Srinivasan Parthasarathy, Duygu Ucar
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
16 years 7 months ago
Scalable discovery of hidden emails from large folders
The popularity of email has triggered researchers to look for ways to help users better organize the enormous amount of information stored in their email folders. One challenge th...
Giuseppe Carenini, Raymond T. Ng, Xiaodong Zhou
CHI
2005
ACM
16 years 6 months ago
Using intimacy, chronology and zooming to visualize rhythms in email experience
Experiences of intimacy and connectedness through social networks are vital to human sense of well-being. We live in an electronic habitat. Electronic mail functions as a medium o...
Mirko Mandic, Andruid Kerne
DASFAA
2009
IEEE
133views Database» more  DASFAA 2009»
16 years 1 months ago
Probabilistic Ranking in Uncertain Vector Spaces
Abstract. In many application domains, e.g. sensor databases, traffic management or recognition systems, objects have to be compared based on positionally and existentially uncert...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...