Sciweavers

1887 search results - page 106 / 378
» Clustering with Local Restrictions
Sort
View
ICDE
2008
IEEE
158views Database» more  ICDE 2008»
15 years 11 months ago
CARE: Finding Local Linear Correlations in High Dimensional Data
Finding latent patterns in high dimensional data is an important research problem with numerous applications. Existing approaches can be summarized into 3 categories: feature selec...
Xiang Zhang, Feng Pan, Wei Wang
INFOCOM
2008
IEEE
15 years 4 months ago
Drive-By Localization of Roadside WiFi Networks
—We use a steerable beam directional antenna mounted on a moving vehicle to localize roadside WiFi access points (APs), located outdoors or inside buildings. Localizing APs is an...
Anand Prabhu Subramanian, Pralhad Deshpande, Jie G...
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
15 years 4 months ago
On the Lower Bound of Local Optimums in K-Means Algorithm
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
ICCBR
1997
Springer
15 years 2 months ago
Examining Locally Varying Weights for Nearest Neighbor Algorithms
Previous work on feature weighting for case-based learning algorithms has tended to use either global weights or weights that vary over extremely local regions of the case space. T...
Nicholas Howe, Claire Cardie
DAGSTUHL
2007
14 years 11 months ago
Discovering Knowledge from Local Patterns with Global Constraints
It is well known that local patterns are at the core of a lot of knowledge which may be discovered from data. Nevertheless, use of local patterns is limited by their huge number an...
Bruno Crémilleux, Arnaud Soulet