Sciweavers

1778 search results - page 163 / 356
» The Theory of Probabilistic Databases
Sort
View
VLDB
2002
ACM
123views Database» more  VLDB 2002»
15 years 6 months ago
Maintaining Data Privacy in Association Rule Mining
Data mining services require accurate input data for their results to be meaningful, but privacy concerns may influence users to provide spurious information. We investigate here,...
Shariq Rizvi, Jayant R. Haritsa
DASFAA
2010
IEEE
169views Database» more  DASFAA 2010»
15 years 4 months ago
Fires on the Web: Towards Efficient Exploring Historical Web Graphs
Abstract. Discovery of evolving regions in large graphs is an important issue because it is the basis of many applications such as spam websites detection in the Web, community lif...
Zhenglu Yang, Jeffrey Xu Yu, Zheng Liu, Masaru Kit...
ICDAR
2011
IEEE
14 years 6 months ago
Evaluating the Rarity of Handwriting Formations
—Identifying unusual or unique characteristics of an observed sample in useful in forensics in general and handwriting analysis in particular. Rarity is formulated as the probabi...
Sargur N. Srihari
CORR
2010
Springer
168views Education» more  CORR 2010»
15 years 4 months ago
Adding HL7 version 3 data types to PostgreSQL
The HL7 standard is widely used to exchange medical information electronically. As a part of the standard, HL7 defines scalar communication data types like physical quantity, poin...
Yeb Havinga, Willem Dijkstra, Ander de Keijzer
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 6 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting