8021 search results - page 1481 / 1605 » Budget Management with Applications |
185
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
191
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
161
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
We present a detailed study of network evolution by analyzing four large online social networks with full temporal information about node and edge arrivals. For the first time at ...
173
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
Information-theoretic clustering aims to exploit information theoretic measures as the clustering criteria. A common practice on this topic is so-called INFO-K-means, which perfor...
199
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
This paper presents a new algorithm for sequence prediction over long categorical event streams. The input to the algorithm is a set of target event types whose occurrences we wis...