Sciweavers

6192 search results - page 996 / 1239
» Structure benefits all
Sort
View
KDD
2009
ACM
239views Data Mining» more  KDD 2009»
16 years 7 months ago
Tell me something I don't know: randomization strategies for iterative data mining
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
Heikki Mannila, Kai Puolamäki, Markus Ojala, ...
MOBIHOC
2009
ACM
16 years 7 months ago
Aging rules: what does the past tell about the future in mobile ad-hoc networks?
The study in mobile ad-hoc networks (MANET) is facing challenges brought by recent discovery of non-exponential behavior of the inter-contact time distribution of mobile nodes. In...
Han Cai, Do Young Eun
KDD
2008
ACM
184views Data Mining» more  KDD 2008»
16 years 7 months ago
Joint latent topic models for text and citations
In this work, we address the problem of joint modeling of text and citations in the topic modeling framework. We present two different models called the Pairwise-Link-LDA and the ...
Ramesh Nallapati, Amr Ahmed, Eric P. Xing, William...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 7 months ago
Assessing data mining results via swap randomization
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
Aristides Gionis, Heikki Mannila, Panayiotis Tsapa...
POPL
2008
ACM
16 years 7 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume