Sciweavers

732 search results - page 69 / 147
» Efficient Frequent Pattern Mining in Relational Databases
Sort
View
FSKD
2005
Springer
90views Fuzzy Logic» more  FSKD 2005»
14 years 1 months ago
Direct Candidates Generation: A Novel Algorithm for Discovering Complete Share-Frequent Itemsets
The value of the itemset share is one way of evaluating the magnitude of an itemset. From business perspective, itemset share values reflect more the significance of itemsets for m...
Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang
KBSE
2009
IEEE
14 years 2 months ago
Alattin: Mining Alternative Patterns for Detecting Neglected Conditions
—To improve software quality, static or dynamic verification tools accept programming rules as input and detect their violations in software as defects. As these programming rul...
Suresh Thummalapenta, Tao Xie
CAISE
2005
Springer
14 years 1 months ago
Bridging Relational Databases to Context-Aware Services
The provision of context-aware services in terms of the anytime/anywhere/anymedia paradigm requires the consideration of certain context properties in terms of time, location, devi...
Elisabeth Kapsammer, Wieland Schwinger, Werner Ret...
KDD
2005
ACM
89views Data Mining» more  KDD 2005»
14 years 8 months ago
Mining risk patterns in medical data
In this paper, we discuss a problem of finding risk patterns in medical data. We define risk patterns by a statistical metric, relative risk, which has been widely used in epidemi...
Jiuyong Li, Ada Wai-Chee Fu, Hongxing He, Jie Chen...
KDD
1998
ACM
145views Data Mining» more  KDD 1998»
14 years 1 days ago
Aggregation of Imprecise and Uncertain Information for Knowledge Discovery in Databases
We consider the problem of aggregation for uncertain and imprecise data. For such data, we define aggregation operators and use them to provide information on properties and patte...
Sally I. McClean, Bryan W. Scotney, Mary Shapcott