Sciweavers

7865 search results - page 426 / 1573
» Peer-to-Peer Data Management
Sort
View
KDD
1997
ACM
92views Data Mining» more  KDD 1997»
15 years 11 months ago
Increasing the Efficiency of Data Mining Algorithms with Breadth-First Marker Propagation
This paper describes how to increase the efficiency of inductive data mining algorithms by replacing the central matching operation with a marker propagation technique. Breadth-fi...
John M. Aronis, Foster J. Provost
IPMU
2010
Springer
15 years 8 months ago
On Nonparametric Predictive Inference for Ordinal Data
Abstract. Nonparametric predictive inference (NPI) is a powerful frequentist statistical framework based only on an exchangeability assumption for future and past observations, mad...
Frank P. A. Coolen, Pauline Coolen-Schrijner, Taha...
FAST
2003
15 years 8 months ago
Data Staging on Untrusted Surrogates
We show how untrusted computers can be used to facilitate secure mobile data access. We discuss a novel architecture, data staging, that improves the performance of distributed ï¬...
Jason Flinn, Shafeeq Sinnamohideen, Niraj Tolia, M...
DATASCIENCE
2007
62views more  DATASCIENCE 2007»
15 years 6 months ago
How to Make the Dream Come True: The Astronomers' Data Manifesto
Astronomy is one of the most data-intensive of the sciences. Data technology is accelerating the quality and effectiveness of its research, and the rate of astronomical discovery ...
Ray P. Norris
WWW
2006
ACM
16 years 7 months ago
Online mining of frequent query trees over XML data streams
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data strea...
Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee