Sciweavers

151 search results - page 25 / 31
» A Nonuniform Algorithm for the Hidden Number Problem in Subg...
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Co-clustering as multilinear decomposition with sparse latent factors
The K-means clustering problem seeks to partition the columns of a data matrix in subsets, such that columns in the same subset are ‘close’ to each other. The co-clustering pr...
Evangelos E. Papalexakis, Nicholas D. Sidiropoulos
KAIS
2011
129views more  KAIS 2011»
13 years 2 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis
ICASSP
2008
IEEE
14 years 2 months ago
Discriminative training by iterative linear programming optimization
In this paper, we cast discriminative training problems into standard linear programming (LP) optimization. Besides being convex and having globally optimal solution(s), LP progra...
Brian Mak, Benny Ng
IJCNN
2006
IEEE
14 years 1 months ago
Online Training of a Generalized Neuron with Particle Swarm Optimization
— Neural networks are used in a wide number of fields including signal and image processing, modeling and control and pattern recognition. Some of the most common type of neural ...
Raveesh Kiran, Sandhya R. Jetti, Ganesh K. Venayag...
ICCS
2007
Springer
14 years 1 months ago
Detecting Invisible Relevant Persons in a Homogeneous Social Network
Abstract. An algorithm to detect invisible relevant persons in a homogeneous social network is studied with computer simulation. The network is effective as a model for contempora...
Yoshiharu Maeno, Kiichi Ito, Yukio Ohsawa