Sciweavers

1492 search results - page 238 / 299
» Geometric Clustering Using the Information Bottleneck Method
Sort
View
ICDM
2006
IEEE
183views Data Mining» more  ICDM 2006»
15 years 3 months ago
Accelerating Newton Optimization for Log-Linear Models through Feature Redundancy
— Log-linear models are widely used for labeling feature vectors and graphical models, typically to estimate robust conditional distributions in presence of a large number of pot...
Arpit Mathur, Soumen Chakrabarti
EDBTW
2006
Springer
15 years 1 months ago
NaviMoz: Mining Navigational Patterns in Portal Catalogs
Abstract. Portal Catalogs is a popular means of searching for information on the Web. They provide querying and browsing capabilities on data organized in a hierarchy, on a categor...
Eleni G. Christodoulou, Theodore Dalamagas, Timos ...
ICVGIP
2004
14 years 11 months ago
Probabilistic Measures for Motion Segmentation
The first contribution of this paper is a probabilistic approach for measuring motion similarity for point sequences. While most motion segmentation algorithms are based on a rank...
Venu Madhav Govindu
WWW
2010
ACM
15 years 4 months ago
Relational duality: unsupervised extraction of semantic relations between entities on the web
Extracting semantic relations among entities is an important first step in various tasks in Web mining and natural language processing such as information extraction, relation de...
Danushka Bollegala, Yutaka Matsuo, Mitsuru Ishizuk...
NN
1998
Springer
177views Neural Networks» more  NN 1998»
14 years 9 months ago
Soft vector quantization and the EM algorithm
The relation between hard c-means (HCM), fuzzy c-means (FCM), fuzzy learning vector quantization (FLVQ), soft competition scheme (SCS) of Yair et al. (1992) and probabilistic Gaus...
Ethem Alpaydin