Sciweavers

7864 search results - page 1118 / 1573
» Clustering Genetic Algorithm
Sort
View
EDBT
2012
ACM
228views Database» more  EDBT 2012»
13 years 9 months ago
Finding maximal k-edge-connected subgraphs from a large graph
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...
KDD
2005
ACM
91views Data Mining» more  KDD 2005»
16 years 7 months ago
On mining cross-graph quasi-cliques
Joint mining of multiple data sets can often discover interesting, novel, and reliable patterns which cannot be obtained solely from any single source. For example, in cross-marke...
Jian Pei, Daxin Jiang, Aidong Zhang
BIBE
2007
IEEE
128views Bioinformatics» more  BIBE 2007»
16 years 1 months ago
QOMA2: Optimizing the alignment of many sequences
Abstract—We consider the problem of aligning multiple protein sequences with the goal of maximizing the SP (Sum-of-Pairs) score, when the number of sequences is large. The QOMA (...
Xu Zhang, Tamer Kahveci
CLUSTER
2006
IEEE
16 years 22 days ago
MSSG: A Framework for Massive-Scale Semantic Graphs
This paper presents a middleware framework for storing, accessing and analyzing massive-scale semantic graphs. The framework, MSSG, targets scale-free semantic graphs with O(1012 ...
Timothy D. R. Hartley, Ümit V. Çataly&...
CIKM
2004
Springer
16 years 2 days ago
A practical web-based approach to generating topic hierarchy for text segments
It is crucial in many information systems to organize short text segments, such as keywords in documents and queries from users, into a well-formed topic hierarchy. In this paper,...
Shui-Lung Chuang, Lee-Feng Chien
« Prev « First page 1118 / 1573 Last » Next »