Sciweavers

703 search results - page 106 / 141
» Efficient anonymity-preserving data collection
Sort
View
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
16 years 7 months ago
Fast Identification of Relational Constraint Violations
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
Amit Chandel, Nick Koudas, Ken Q. Pu, Divesh Sriva...
KDD
2005
ACM
122views Data Mining» more  KDD 2005»
16 years 6 months ago
Pattern lattice traversal by selective jumps
Regardless of the frequent patterns to discover, either the full frequent patterns or the condensed ones, either closed or maximal, the strategy always includes the traversal of t...
Osmar R. Zaïane, Mohammad El-Hajj
DEXAW
2005
IEEE
193views Database» more  DEXAW 2005»
15 years 11 months ago
Adaptive Distributed Indexing for Spatial Queries in Sensor Networks
Sensor networks have opened new horizons and opportunities for a variety of environmental monitoring, surveillance and healthcare applications. One of the major tasks of sensor ne...
Vladimir Dyo, Cecilia Mascolo
ADBIS
2000
Springer
111views Database» more  ADBIS 2000»
15 years 10 months ago
Discovering Frequent Episodes in Sequences of Complex Events
Data collected in many applications have a form of sequences of events. One of the popular data mining problems is discovery of frequently occurring episodes in such sequences. Eff...
Marek Wojciechowski
KDD
2005
ACM
92views Data Mining» more  KDD 2005»
16 years 6 months ago
Summarizing itemset patterns: a profile-based approach
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
Xifeng Yan, Hong Cheng, Jiawei Han, Dong Xin