Sciweavers

11573 search results - page 363 / 2315
» Designing Relational Databases
Sort
View
WWW
2006
ACM
16 years 7 months ago
Template guided association rule mining from XML documents
Compared with traditional association rule mining in the structured world (e.g. Relational Databases), mining from XML data is confronted with more challenges due to the inherent ...
Rahman Ali Mohammadzadeh, Sadegh Soltan, Masoud Ra...
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
16 years 7 months ago
Finding tribes: identifying close-knit individuals from employment patterns
We present a family of algorithms to uncover tribes--groups of individuals who share unusual sequences of affiliations. While much work inferring community structure describes lar...
Lisa Friedland, David Jensen
KDD
2005
ACM
137views Data Mining» more  KDD 2005»
16 years 7 months ago
Pattern-based similarity search for microarray data
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
Haixun Wang, Jian Pei, Philip S. Yu
SIGMOD
2006
ACM
232views Database» more  SIGMOD 2006»
16 years 7 months ago
High-performance complex event processing over streams
In this paper, we present the design, implementation, and evaluation of a system that executes complex event queries over real-time streams of RFID readings encoded as events. The...
Eugene Wu 0002, Yanlei Diao, Shariq Rizvi
SIGMOD
2005
ACM
105views Database» more  SIGMOD 2005»
16 years 7 months ago
Reference Reconciliation in Complex Information Spaces
Reference reconciliation is the problem of identifying when different references (i.e., sets of attribute values) in a dataset correspond to the same real-world entity. Most previ...
Xin Dong, Alon Y. Halevy, Jayant Madhavan