Sciweavers

288 search results - page 50 / 58
» A distributed algorithm for anytime coalition structure gene...
Sort
View
CIKM
2006
Springer
13 years 9 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
KDD
2012
ACM
242views Data Mining» more  KDD 2012»
11 years 10 months ago
Query-driven discovery of semantically similar substructures in heterogeneous networks
Heterogeneous information networks that contain multiple types of objects and links are ubiquitous in the real world, such as bibliographic networks, cyber-physical networks, and ...
Xiao Yu, Yizhou Sun, Peixiang Zhao, Jiawei Han
EDBT
2010
ACM
153views Database» more  EDBT 2010»
14 years 2 months ago
Suggestion of promising result types for XML keyword search
Although keyword query enables inexperienced users to easily search XML database with no specific knowledge of complex structured query languages or XML data schemas, the ambigui...
Jianxin Li, Chengfei Liu, Rui Zhou, Wei Wang
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
13 years 11 months ago
Sporadic model building for efficiency enhancement of hierarchical BOA
This paper describes and analyzes sporadic model building, which can be used to enhance the efficiency of the hierarchical Bayesian optimization algorithm (hBOA) and other advance...
Martin Pelikan, Kumara Sastry, David E. Goldberg
DEBU
2010
88views more  DEBU 2010»
13 years 7 months ago
SECONDO: A Platform for Moving Objects Database Research and for Publishing and Integrating Research Implementations
Databases supporting time dependent and continuously changing geometries, called moving objects databases, have been studied for about 15 years. The field has been flourishing and...
Ralf Hartmut Güting, Thomas Behr, Christian D...