Sciweavers

2932 search results - page 77 / 587
» Higher order mining
Sort
View
135
Voted
OSDI
2000
ACM
15 years 6 months ago
Towards Higher Disk Head Utilization: Extracting "Free" Bandwidth from Busy Disk Drives
Freeblock scheduling is a new approach to utilizing more of disks' potential media bandwidths. By filling rotational latency periods with useful media transfers, 20{50% of a ...
Christopher R. Lumb, Jiri Schindler, Gregory R. Ga...
139
Voted
ICDM
2003
IEEE
135views Data Mining» more  ICDM 2003»
15 years 10 months ago
An Algorithm for the Exact Computation of the Centroid of Higher Dimensional Polyhedra and its Application to Kernel Machines
The Support Vector Machine (SVM) solution corresponds to the centre of the largest sphere inscribed in version space. Alternative approaches like Bayesian Point Machines (BPM) and...
Frédéric Maire
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
16 years 5 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...
PAKDD
2010
ACM
215views Data Mining» more  PAKDD 2010»
15 years 6 months ago
Mining Closed Episodes from Event Sequences Efficiently
Recent studies have proposed different methods for mining frequent episodes. In this work, we study the problem of mining closed episodes based on minimal occurrences. We study the...
Wenzhi Zhou, Hongyan Liu, Hong Cheng
SBBD
2004
166views Database» more  SBBD 2004»
15 years 6 months ago
An Apriori-based Approach for First-Order Temporal Pattern Mining
Previous studies on mining sequential patterns have focused on temporal patterns specified by some form of propositional temporal logic. However, there are some interesting sequen...
Sandra de Amo, Daniel A. Furtado, Arnaud Giacomett...