Sciweavers

748 search results - page 79 / 150
» Structural Discovery of E-lessons
Sort
View
ICDM
2009
IEEE
197views Data Mining» more  ICDM 2009»
14 years 7 months ago
A Linear-Time Graph Kernel
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
Shohei Hido, Hisashi Kashima
APLAS
2011
ACM
13 years 9 months ago
Solving Recursion-Free Horn Clauses over LI+UIF
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenk...
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
15 years 10 months ago
Identifying Similarities, Periodicities and Bursts for Online Search Queries
We present several methods for mining knowledge from the query logs of the MSN search engine. Using the query logs, we build a time series for each query word or phrase (e.g., `Th...
Michail Vlachos, Christopher Meek, Zografoula Vage...
IPPS
2008
IEEE
15 years 4 months ago
Parallel mining of closed quasi-cliques
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
Yuzhou Zhang, Jianyong Wang, Zhiping Zeng, Lizhu Z...
BPM
2007
Springer
130views Business» more  BPM 2007»
15 years 4 months ago
Process Mining Based on Clustering: A Quest for Precision
Process mining techniques attempt to extract non-trivial and useful information from event logs recorded by information systems. For example, there are many process mining techniqu...
Ana Karla Alves de Medeiros, Antonella Guzzo, Gian...