Sciweavers

1458 search results - page 130 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
DEXAW
1998
IEEE
116views Database» more  DEXAW 1998»
15 years 10 months ago
Data-Mining: A Tightly-Coupled Implementation on a Parallel Database Server
Due to the increasingly di culty of discovering patterns in real-world databases using only conventional OLAP tools, an automated process such as data mining is currently essentia...
Mauro Sousa, Marta Mattoso, Nelson F. F. Ebecken
DAWAK
2006
Springer
15 years 9 months ago
Learning Classifiers from Distributed, Ontology-Extended Data Sources
Abstract. There is an urgent need for sound approaches to integrative and collaborative analysis of large, autonomous (and hence, inevitably semantically heterogeneous) data source...
Doina Caragea, Jun Zhang 0002, Jyotishman Pathak, ...
CIKM
1993
Springer
15 years 10 months ago
Collection Oriented Match
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
Anurag Acharya, Milind Tambe
ACL
2006
15 years 7 months ago
Boosting Statistical Word Alignment Using Labeled and Unlabeled Data
This paper proposes a semi-supervised boosting approach to improve statistical word alignment with limited labeled data and large amounts of unlabeled data. The proposed approach ...
Hua Wu, Haifeng Wang, Zhan-yi Liu
DEXA
2009
Springer
88views Database» more  DEXA 2009»
15 years 10 months ago
Significance-Based Failure and Interference Detection in Data Streams
Detecting the failure of a data stream is relatively easy when the stream is continually full of data. The transfer of large amounts of data allows for the simple detection of inte...
Nickolas J. G. Falkner, Quan Z. Sheng