Sciweavers

3146 search results - page 433 / 630
» Efficient Consequence Finding
Sort
View
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
16 years 4 months ago
GraphScope: parameter-free mining of large time-evolving graphs
How can we find communities in dynamic networks of social interactions, such as who calls whom, who emails whom, or who sells to whom? How can we spot discontinuity timepoints in ...
Jimeng Sun, Christos Faloutsos, Spiros Papadimitri...
126
Voted
KDD
2007
ACM
190views Data Mining» more  KDD 2007»
16 years 4 months ago
Model-shared subspace boosting for multi-label classification
Typical approaches to multi-label classification problem require learning an independent classifier for every label from all the examples and features. This can become a computati...
Rong Yan, Jelena Tesic, John R. Smith
KDD
2006
ACM
142views Data Mining» more  KDD 2006»
16 years 4 months ago
Mining distance-based outliers from large databases in any metric space
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
Yufei Tao, Xiaokui Xiao, Shuigeng Zhou
CHI
2007
ACM
16 years 4 months ago
Modeling the impact of shared visual information on collaborative reference
A number of recent studies have demonstrated that groups benefit considerably from access to shared visual information. This is due, in part, to the communicative efficiencies pro...
Darren Gergle, Carolyn Penstein Rosé, Rober...
CHI
2007
ACM
16 years 4 months ago
Modeling human performance of pen stroke gestures
This paper presents a quantitative human performance model of making single-stroke pen gestures within certain error constraints in terms of production time. Computed from the pro...
Xiang Cao, Shumin Zhai