Sciweavers

5595 search results - page 345 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
MDAI
2007
Springer
16 years 26 days ago
Lindig's Algorithm for Concept Lattices over Graded Attributes
Formal concept analysis (FCA) is a method of exploratory data analysis. The data is in the form of a table describing relationship between objects (rows) and attributes (columns), ...
Radim Belohlávek, Bernard De Baets, Jan Out...
CIBB
2008
15 years 8 months ago
Stability and Performances in Biclustering Algorithms
Abstract. Stability is an important property of machine learning algorithms. Stability in clustering may be related to clustering quality or ensemble diversity, and therefore used ...
Maurizio Filippone, Francesco Masulli, Stefano Rov...
182
Voted
FOCS
2000
IEEE
15 years 11 months ago
On Clusterings - Good, Bad and Spectral
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is shown...
Ravi Kannan, Santosh Vempala, Adrian Vetta
GLOBECOM
2010
IEEE
15 years 4 months ago
Maximization of Data Gathering in Clustered Wireless Sensor Networks
In this paper, we investigate the maximization of the amount of gathered data in a clustered wireless sensor network (WSN). The amount of gathered data is maximized by (1) choosing...
Tianqi Wang, Wendi Rabiner Heinzelman, Alireza Sey...
IJSNET
2007
100views more  IJSNET 2007»
15 years 6 months ago
Fault tolerant topology control for one-to-all communications in symmetric wireless networks
: This paper introduces the problem of fault tolerant topology control for one-to-all communications in symmetric wireless networks. We investigate two algorithms to address the pr...
Feng Wang 0002, Kuai Xu, My T. Thai, Ding-Zhu Du