Sciweavers

273 search results - page 53 / 55
» Mining association rules from imprecise ordinal data
Sort
View
IJFCS
2008
102views more  IJFCS 2008»
13 years 8 months ago
Succinct Minimal Generators: Theoretical Foundations and Applications
In data mining applications, highly sized contexts are handled what usually results in a considerably large set of frequent itemsets, even for high values of the minimum support t...
Tarek Hamrouni, Sadok Ben Yahia, Engelbert Mephu N...
DBSEC
2000
138views Database» more  DBSEC 2000»
13 years 10 months ago
Discovery of Multi-Level Security Policies
With the increasing complexity and dynamics of database and information systems, it becomes more and more di cult for administrative personnel to identify, specify and enforce sec...
Christina Yip Chung, Michael Gertz, Karl N. Levitt
KDD
2004
ACM
162views Data Mining» more  KDD 2004»
14 years 9 months ago
Discovering Links Between Lexical and Surface Features in Questions and Answers
Information retrieval systems, based on keyword match, are evolving to question answering systems that return short passages or direct answers to questions, rather than URLs point...
Soumen Chakrabarti
DATAMINE
1999
152views more  DATAMINE 1999»
13 years 8 months ago
Discovery of Frequent DATALOG Patterns
Discovery of frequent patterns has been studied in a variety of data mining settings. In its simplest form, known from association rule mining, the task is to discover all frequent...
Luc Dehaspe, Hannu Toivonen
CINQ
2004
Springer
157views Database» more  CINQ 2004»
14 years 8 days ago
Inductive Databases and Multiple Uses of Frequent Itemsets: The cInQ Approach
Inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. With an IDB the user/analyst performs a set of very different operat...
Jean-François Boulicaut