Sciweavers

134 search results - page 14 / 27
» Identifying non-actionable association rules
Sort
View
ICDE
2008
IEEE
125views Database» more  ICDE 2008»
14 years 9 months ago
RAD: A Scalable Framework for Annotator Development
Developments in semantic search technology have motivated the need for efficient and scalable entity annotation techniques. We demonstrate RAD: a tool for Rapid Annotator Developme...
Sanjeet Khaitan, Ganesh Ramakrishnan, Sachindra Jo...
JMLR
2008
117views more  JMLR 2008»
13 years 7 months ago
Closed Sets for Labeled Data
Closed sets have been proven successful in the context of compacted data representation for association rule learning. However, their use is mainly descriptive, dealing only with ...
Gemma C. Garriga, Petra Kralj, Nada Lavrac
ADC
2003
Springer
182views Database» more  ADC 2003»
14 years 25 days ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
KDD
2004
ACM
171views Data Mining» more  KDD 2004»
14 years 8 months ago
Integrating Web Conceptual Modeling and Web Usage Mining
We present a case study about the application of the inductive database approach to the analysis of Web logs. We consider rich XML Web logs ? called conceptual logs ? that are gen...
Rosa Meo, Pier Luca Lanzi, Maristella Matera, Robe...
DEXAW
1999
IEEE
322views Database» more  DEXAW 1999»
13 years 12 months ago
The Process of Inconsistency Management: A Framework for Understanding
The process of managing inconsistency is a fundamental activity that permeates a large part of the systems development process. Failure to identify inconsistencies may lead to maj...
Bashar Nuseibeh, Steve M. Easterbrook