Sciweavers

155 search results - page 28 / 31
» An efficient algorithm for mining closed inter-transaction i...
Sort
View
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
15 years 9 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
PAKDD
2007
ACM
128views Data Mining» more  PAKDD 2007»
15 years 3 months ago
Selecting a Reduced Set for Building Sparse Support Vector Regression in the Primal
Recent work shows that Support vector machines (SVMs) can be solved efficiently in the primal. This paper follows this line of research and shows how to build sparse support vector...
Liefeng Bo, Ling Wang, Licheng Jiao
163
Voted
SIGMOD
2008
ACM
136views Database» more  SIGMOD 2008»
15 years 9 months ago
Mining relationships among interval-based events for classification
Existing temporal pattern mining assumes that events do not have any duration. However, events in many real world applications have durations, and the relationships among these ev...
Dhaval Patel, Wynne Hsu, Mong-Li Lee
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
15 years 1 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
PODS
2005
ACM
85views Database» more  PODS 2005»
15 years 9 months ago
Relative risk and odds ratio: a data mining perspective
We are often interested to test whether a given cause has a given effect. If we cannot specify the nature of the factors involved, such tests are called model-free studies. There ...
Haiquan Li, Jinyan Li, Limsoon Wong, Mengling Feng...