Sciweavers

4009 search results - page 69 / 802
» Clustering on Complex Graphs
Sort
View
ICDM
2008
IEEE
122views Data Mining» more  ICDM 2008»
15 years 6 months ago
Nonnegative Matrix Factorization for Combinatorial Optimization: Spectral Clustering, Graph Matching, and Clique Finding
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
Chris H. Q. Ding, Tao Li, Michael I. Jordan
ICPR
2008
IEEE
15 years 6 months ago
A new clustering approach based on graph partitioning for navigation patterns mining
We present a study of the web based user navigation patterns mining and propose a novel approach for clustering of user navigation patterns. The approach is based on the graph par...
Mehrdad Jalali, Norwati Mustapha, Ali Mamat, Nasir...
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
14 years 12 months ago
The Linear Complexity of a Graph
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In th...
David L. Neel, Michael E. Orrison
WEBI
2004
Springer
15 years 5 months ago
Using Semantic Graphs in Clustering Process : Enhance Information Level
In this paper, we particularly focused our attention on how to enhance expressivity of ontologies when used as organized space values in a catalogue request process. Using the Wis...
Jean-Sébastien Brunner, Isabelle Berrien
IBPRIA
2007
Springer
15 years 6 months ago
Locating and Segmenting 3D Deformable Objects by Using Clusters of Contour Fragments
Abstract. This paper presents a new approach to the problem of simultaneous location and segmentation of object in images. The main emphasis is done on the information provided by ...
Manuel J. Marín-Jiménez, Nicolas P&e...