Sciweavers

1314 search results - page 85 / 263
» Approximate data mining in very large relational data
Sort
View
WSDM
2012
ACM
325views Data Mining» more  WSDM 2012»
13 years 9 months ago
Coupled temporal scoping of relational facts
Recent research has made significant advances in automatically constructing knowledge bases by extracting relational facts (e.g., Bill Clinton-presidentOf-US) from large text cor...
Partha Pratim Talukdar, Derry Tanti Wijaya, Tom Mi...
135
Voted
AIMSA
2010
Springer
15 years 3 months ago
Expressive Approximations in DL-Lite Ontologies
Abstract. Ontology based data access (OBDA) is concerned with providing access to typically very large data sources through a mediating conceptual layer that allows one to improve ...
Elena Botoeva, Diego Calvanese, Mariano Rodriguez-...
KDD
1998
ACM
148views Data Mining» more  KDD 1998»
15 years 5 months ago
Group Bitmap Index: A Structure for Association Rules Retrieval
Discovery of association rules from large databases of item sets is an important data mining problem. Association rules are usually stored in relational databases for future use i...
Tadeusz Morzy, Maciej Zakrzewicz
VLDB
1998
ACM
147views Database» more  VLDB 1998»
15 years 5 months ago
Scalable Techniques for Mining Causal Structures
Mining for association rules in market basket data has proved a fruitful areaof research. Measures such as conditional probability (confidence) and correlation have been used to i...
Craig Silverstein, Sergey Brin, Rajeev Motwani, Je...
AUSAI
2003
Springer
15 years 7 months ago
Efficiently Mining Frequent Patterns from Dense Datasets Using a Cluster of Computers
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...
Yudho Giri Sucahyo, Raj P. Gopalan, Amit Rudra