Sciweavers

484 search results - page 67 / 97
» Special Track on Data Mining
Sort
View
ISMIS
2009
Springer
14 years 2 months ago
Discovering Relevant Cross-Graph Cliques in Dynamic Networks
Abstract. Several algorithms, namely CubeMiner, Trias, and DataPeeler, have been recently proposed to mine closed patterns in ternary relations. We consider here the specific cont...
Loïc Cerf, Tran Bao Nhan Nguyen, Jean-Fran&cc...
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
14 years 8 months ago
SCAN: a structural clustering algorithm for networks
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, Thomas A. J...
ADMA
2009
Springer
142views Data Mining» more  ADMA 2009»
14 years 2 months ago
Crawling Deep Web Using a New Set Covering Algorithm
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...
Yan Wang, Jianguo Lu, Jessica Chen
NN
2008
Springer
152views Neural Networks» more  NN 2008»
13 years 7 months ago
Analysis of the IJCNN 2007 agnostic learning vs. prior knowledge challenge
We organized a challenge for IJCNN 2007 to assess the added value of prior domain knowledge in machine learning. Most commercial data mining programs accept data pre-formatted in ...
Isabelle Guyon, Amir Saffari, Gideon Dror, Gavin C...
AIED
2009
Springer
14 years 2 months ago
Intelligent Learning Object Guide (iLOG): A Framework for Automatic Empirically-Based Metadata Generation
Abstract. We present a framework for the automatic annotation of learning objects (LOs) with empirical usage metadata. Our implementation of the Intelligent Learning Object Guide (...
S. A. Riley, Lee Dee Miller, Leen-Kiat Soh, Ashok ...