Sciweavers

61 search results - page 6 / 13
» Mining Violations to Relax Relational Database Constraints
Sort
View
SDM
2004
SIAM
207views Data Mining» more  SDM 2004»
15 years 1 months ago
BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
Jianyong Wang, George Karypis
SAC
2004
ACM
15 years 5 months ago
A new algorithm for gap constrained sequence mining
The sequence mining problem consists in finding frequent sequential patterns in a database of time-stamped events. Several application domains require limiting the maximum tempor...
Salvatore Orlando, Raffaele Perego, Claudio Silves...
IDEAS
2003
IEEE
122views Database» more  IDEAS 2003»
15 years 5 months ago
Preferred Repairs for Inconsistent Databases
The objective of this paper is to investigate the problems related to the extensional integration of information sources. In particular, we propose an approach for managing incons...
Sergio Greco, Cristina Sirangelo, Irina Trubitsyna...
ICSE
2009
IEEE-ACM
15 years 6 months ago
Mining exception-handling rules as sequence association rules
Programming languages such as Java and C++ provide exception-handling constructs to handle exception conditions. Applications are expected to handle these exception conditions and...
Suresh Thummalapenta, Tao Xie
OWLED
2008
15 years 1 months ago
Opening, Closing Worlds - On Integrity Constraints
In many data-centric applications it is desirable to use OWL as an expressive schema language where one expresses constraints that need to be satisfied by the (instance) data. Howe...
Evren Sirin, Michael Smith, Evan Wallace