Sciweavers

2600 search results - page 231 / 520
» Clustering with or without the Approximation
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, ...
IPPS
2006
IEEE
16 years 19 days ago
Monitoring remotely executing shared memory programs in software DSMs
Peer-to-Peer (P2P) cycle sharing over the Internet has become increasingly popular as a way to share idle cycles. A fundamental problem faced by P2P cycle sharing systems is how t...
Long Fei, Xing Fang, Y. Charlie Hu, Samuel P. Midk...
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
16 years 3 days ago
Combining partitions by probabilistic label aggregation
Data clustering represents an important tool in exploratory data analysis. The lack of objective criteria render model selection as well as the identification of robust solutions...
Tilman Lange, Joachim M. Buhmann
WEBDB
2010
Springer
168views Database» more  WEBDB 2010»
15 years 11 months ago
WikiAnalytics: Disambiguation of Keyword Search Results on Highly Heterogeneous Structured Data
Wikipedia infoboxes is an example of a seemingly structured, yet extraordinarily heterogeneous dataset, where any given record has only a tiny fraction of all possible fields. Su...
Andrey Balmin, Emiran Curtmola
COBUILD
1998
Springer
15 years 10 months ago
An Agent-Based Telecooperation Framework
Abstract. As the amount of information and communication increases dramatically new working environments must provide efficient mechanisms to maximize the benefits of these develop...
Albrecht Schmidt, Alexander Specker, Gerhard Parts...