222 search results - page 22 / 45 » Mining the network value of customers |
141
click to vote
SIGMOD
2005
ACM
15 years 10 months ago
2005
ACM
The goal is to monitor multiple numerical streams, and determine which pairs are correlated with lags, as well as the value of each such lag. Lag correlations (and anticorrelation...
PODS
2005
ACM
15 years 10 months ago
2005
ACM
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
ECAI
2010
Springer
14 years 10 months ago
2010
Springer
Recently the efficiency of an outlier detection algorithm ORCA was improved by RCS (Randomization with faster Cutoff update and Space utilization after pruning), which changes the ...
ICDM
2008
IEEE
15 years 4 months ago
2008
IEEE
We present a new visualization of the distance and cluster structure of high dimensional data. It is particularly well suited for analysis tasks of users unfamiliar with complex d...
107
click to vote
NETWORKS
2002
14 years 9 months ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...