Sciweavers

1093 search results - page 24 / 219
» Clustering from Constraint Graphs
Sort
View
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
13 years 11 months ago
Clustering by weighted cuts in directed graphs
In this paper we formulate spectral clustering in directed graphs as an optimization problem, the objective being a weighted cut in the directed graph. This objective extends seve...
Marina Meila, William Pentney
ICDM
2010
IEEE
197views Data Mining» more  ICDM 2010»
13 years 7 months ago
D-LDA: A Topic Modeling Approach without Constraint Generation for Semi-defined Classification
: D-LDA: A Topic Modeling Approach without Constraint Generation for Semi-Defined Classification Fuzhen Zhuang, Ping Luo, Zhiyong Shen, Qing He, Yuhong Xiong, Zhongzhi Shi HP Labo...
Fuzhen Zhuang, Ping Luo, Zhiyong Shen, Qing He, Yu...
CORR
2007
Springer
129views Education» more  CORR 2007»
13 years 9 months ago
A Tutorial on Spectral Clustering
In recent years, spectral clustering has become one of the most popular modern clustering algorithms. It is simple to implement, can be solved efficiently by standard linear algeb...
Ulrike von Luxburg
EKAW
2006
Springer
14 years 1 months ago
Capturing Quantified Constraints in FOL, Through Interaction with a Relationship Graph
As new semantic web standards evolve to allow quantified rules in FOL, we need new ways to capture them from end users. We show how to do this against a graphic view of entities an...
Peter M. D. Gray, Graham J. L. Kemp
CP
2009
Springer
14 years 10 months ago
Constraint-Based Optimal Testing Using DNNF Graphs
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
Anika Schumann, Martin Sachenbacher, Jinbo Huang