List of street view services
Google Street View is the most comprehensive street view service in the world. It provides street view for more than 85 countries worldwide. The Mapillary project collects crowdsourced images from its users, which are licensed under a CC BYSA li ...
Hitta.se
Hitta.se is a Swedish search engine that offers telephone directory, addresses and maps. The site was founded in June 2004. In February 2005, The Website Hitta.SES of the parent company Alta Teleadress information holding AB was bought I Hierta, ...
ImmersiVision
ImmersiVision Interactive Technologies Inc. is a Whistler, British Columbia, Canada based company, founded in early 2004, whose primarily revenue source was the production of immersive virtual reality. The product is similar to Google Streetview. ...
NORC (web service)
NORC was a street view website introduced in 2009 for Central and Eastern Europe. The site provided 360degree panoramas from various cities and locations in Austria, Czech Republic, Hungary, Poland, Romania, Russia, and Slovakia. It is owned by ...
Affinity propagation
In statistics and data mining, affinity propagation is a clustering algorithm based on the concept of "message passing" between data points. Unlike clustering algorithms such as k means or k medoids, affinity propagation does not require the nu ...
BIRCH
BIRCH is an unsupervised data mining algorithm used to perform hierarchical clustering over particularly large datasets. An advantage of BIRCH is its ability to incrementally and dynamically cluster incoming, multidimensional metric data points ...
Canopy clustering algorithm
The canopy clustering algorithm is an unsupervised preclustering algorithm introduced by Andrew McCallum, Kamal Nigam and Lyle Ungar in 2000. It is often used as preprocessing step for the Kmeans algorithm or the Hierarchical clustering algorit ...
Clusterweighted modeling
In data mining, clusterweighted modeling is an algorithmbased approach to nonlinear prediction of outputs from inputs based on density estimation using a set of models that are each notionally appropriate in a subregion of the input space. Th ...
CURE algorithm
CURE is an efficient data clustering algorithm for large databases. Compared with Kmeans clustering it is more robust to outliers and able to identify clusters having nonspherical shapes and size variances.
Data stream clustering
In computer science, data stream clustering is defined as the clustering of data that arrive continuously such as telephone records, multimedia data, financial transactions etc. Data stream clustering is usually studied as a streaming algorithm a ...
DBSCAN
Densitybased spatial clustering of applications with noise is a data clustering algorithm proposed by Martin Ester, HansPeter Kriegel, Jorg Sander and Xiaowei Xu in 1996. It is a densitybased clustering nonparametric algorithm: given a set of ...
FLAME clustering
Fuzzy clustering by Local Approximation of MEmberships is a data clustering algorithm that defines clusters in the dense parts of a dataset and performs cluster assignment solely based on the neighborhood relationships among objects. The key feat ...
Fuzzy clustering
Fuzzy clustering is a form of clustering in which each data point can belong to more than one cluster. Clustering or cluster analysis involves assigning data points to clusters such that the elements of the same cluster are as similar as possible ...
Hoshen–Kopelman algorithm
The Hoshen–Kopelman algorithm is a simple and efficient algorithm for labeling clusters on a grid, where the grid is a regular network of cells, with the cells being either occupied or unoccupied. This algorithm is based on a wellknown unionfin ...
K qflats
In data mining and machine learning, k {\displaystyle k} q {\displaystyle q} flats algorithm is an iterative method which aims to partition m {\displaystyle m} observations into k {\displaystyle k} clusters where each cluster is close to a q {\d ...
Kmeans clustering
k means clustering is a method of vector quantization, originally from signal processing, that is popular for cluster analysis in data mining. k means clustering aims to partition n observations into k clusters in which each observation belongs ...
Kmeans++
In data mining, k means++ is an algorithm for choosing the initial values for the k means clustering algorithm. It was proposed in 2007 by David Arthur and Sergei Vassilvitskii, as an approximation algorithm for the NPhard k means problem  a ...
Kmedians clustering
In statistics and data mining, k medians clustering is a cluster analysis algorithm. It is a variation of k means clustering where instead of calculating the mean for each cluster to determine its centroid, one instead calculates the median. Th ...
Kmedoids
The k medoids or partitioning around medoids algorithm is a clustering algorithm reminiscent to the k means algorithm. Both the k means and k medoids algorithms are partitional and both attempt to minimize the distance between points labeled ...
Lowenergy adaptive clustering hierarchy
Lowenergy adaptive clustering hierarchy is a TDMAbased MAC protocol which is integrated with clustering and a simple routing protocol in wireless sensor networks. The goal of LEACH is to lower the energy consumption required to create and maint ...
Nearestneighbor chain algorithm
In the theory of cluster analysis, the nearestneighbor chain algorithm is an algorithm that can speed up several methods for agglomerative hierarchical clustering. These are methods that take a collection of points as input, and create a hierarc ...
OPTICS algorithm
Ordering points to identify the clustering structure is an algorithm for finding densitybased clusters in spatial data. It was presented by Mihael Ankerst, Markus M. Breunig, HansPeter Kriegel and Jorg Sander. Its basic idea is similar to DBSCA ...
Pitman–Yor process
In probability theory, a Pitman–Yor process denoted PY, is a stochastic process whose sample path is a probability distribution. A random sample from this process is an infinite discrete probability distribution, consisting of an infinite set of ...
Quantum clustering
Quantum clustering, is a data clustering algorithm accomplished by substituting each point in a given dataset with a Gaussian. The width of the Gaussian is a sigma value, a hyperparameter which can be manually defined and manipulated to suit the ...
Singlelinkage clustering
In statistics, singlelinkage clustering is one of several methods of hierarchical clustering. It is based on grouping clusters in bottomup fashion, at each step combining two clusters that contain the closest pair of elements not yet belonging ...
SUBCLU
SUBCLU is an algorithm for clustering highdimensional data by Karin Kailing, HansPeter Kriegel and Peer Kroger. It is a subspace clustering algorithm that builds on the densitybased clustering algorithm DBSCAN. SUBCLU can find clusters in axis ...
Wards method
In statistics, Wards method is a criterion applied in hierarchical cluster analysis. Wards minimum variance method is a special case of the objective function approach originally presented by Joe H. Ward, Jr. Ward suggested a general agglomerativ ...
Balanced clustering
Balanced clustering is a special case of clustering where, in the strictest sense, cluster sizes are constrained to ⌊ n k ⌋ {\displaystyle \lfloor {n \over k}\rfloor } or ⌈ n k ⌉ {\displaystyle \lceil {n \over k}\rceil }, where n {\displaystyle n ...
Dasguptas objective
In the study of hierarchical clustering, Dasguptas objective is a measure of the quality of a clustering, defined from a similarity measure on the elements to be clustered. It is named after Sanjoy Dasgupta, who formulated it in 2016. Its key pro ...
Davies–Bouldin index
The Davies–Bouldin index is a metric for evaluating clustering algorithms. This is an internal evaluation scheme, where the validation of how well the clustering has been done is made using quantities and features inherent to the dataset. This ha ...
Dunn index
The Dunn index is a metric for evaluating clustering algorithms. This is part of a group of validity indices including the Davies–Bouldin index or Silhouette index, in that it is an internal evaluation scheme, where the result is based on the clu ...
Fowlkes–Mallows index
Fowlkes–Mallows index is an external evaluation method that is used to determine the similarity between two clusterings. This measure of similarity could be either between two hierarchical clusterings or a clustering and a benchmark classificatio ...
Hopkins statistic
The Hopkins statistic is a way of measuring the cluster tendency of a data set. It belongs to the family of sparse sampling tests. It acts as a statistical hypothesis test where the null hypothesis is that the data is generated by a Poisson point ...
Rand index
The Rand index or Rand measure in statistics, and in particular in data clustering, is a measure of the similarity between two data clusterings. A form of the Rand index may be defined that is adjusted for the chance grouping of elements, this is ...
Silhouette (clustering)
Silhouette refers to a method of interpretation and validation of consistency within clusters of data. The technique provides a succinct graphical representation of how well each object has been classified. The silhouette value is a measure of ho ...
Binomial process
Let P {\displaystyle P} be a probability distribution and n {\displaystyle n} be a fixed natural number. Let X 1, X 2, …, X n {\displaystyle X_{1},X_{2},\dots,X_{n}} be i.i.d. random variables with distribution P {\displaystyle P}, so X i ∼ P {\d ...
Determinantal point process
In mathematics, a determinantal point process is a stochastic point process, the probability distribution of which is characterized as a determinant of some function. Such processes arise as important tools in random matrix theory, combinatorics, ...
Index of dispersion
In probability theory and statistics, the index of dispersion, dispersion index, coefficient of dispersion, relative variance, or variancetomean ratio, like the coefficient of variation, is a normalized measure of the dispersion of a probabilit ...
Mixed binomial process
A mixed binomial process is a special point process in probability theory. They naturally arise from restrictions of Poisson processes bounded intervals.
Nutransform
In the theory of stochastic processes, a νtransform is an operation that transforms a measure or a point process into a different point process. Intuitively the νtransform randomly relocates the points of the point process, with the type of rel ...
Simple point process
Let S {\displaystyle S} be lcscH and let S {\displaystyle {\mathcal {S}}} be the σ {\displaystyle \sigma } algebra consisting of all relatively compact subsets of S {\displaystyle S}. A point process ξ {\displaystyle \xi }, interpreted as random ...
Toponymy of England
The toponymy of England, like the English language itself, derives from various linguistic origins. Modern interpretations are apt to be inexact: many English toponyms have been corrupted and broken down over the years, due to changes in language ...
Regis (place)
Regis, Latin for "of the king", occurs in numerous English place names. The name usually recalls the historical ownership of lands or manors by the Crown. In other places it honours royal associations rather than ownership. The "Regis" form was o ...
Utqiagvik, Alaska
Utqiagvik, officially the City of Utqiagvik, formerly known as Barrow, is the largest city and the borough seat of the North Slope Borough in the U.S. state of Alaska and is located north of the Arctic Circle. It is one of the northernmost public ...
Georgetown street renaming
The Georgetown street renaming occurred as a result of an 1895 act of the United States Congress that ended even the nominal independence of Georgetown from Washington, D.C. The Act required, inter alia, that the street names in Georgetown be cha ...
Almberg
The 1.139metrehigh Almberg lies about 20 kilometres northeast of Freyung near the border between Germany and Czechia. Its mountainsides are mainly used for skiing. On its eastern side is Mitterfirmiansreut, a village whose main focus is winter ...
Breitenauriegel
The Breitenauriegel is a mountain in the Bavarian Forest of Germany. Mountain 1.116 m above sea level, high NHN and rises from the crest of the Vorderer Bavarian forest near Bischofsmais and neighboring peaks GeiSkopf and Dreitannenriegel. On top ...
Brotjacklriegel
Seen from the River Danube, the Brotjacklriegel is the first high mountain in the Bavarian Forest. It is 1.011 m above NHN and lies in the county of FreyungGrafenau in the German federal state of Bavaria. It is a symbol of the Sonnenwald region ...
Dreisesselberg (Bavarian Forest)
The Dreisesselberg is located in the eastern part of Lower Bavaria in the county of FreyungGrafenau. It rises southeast of the village of Haidmuhle and northeast of the village of Neureichenau. The Czech border is 370 metres SouthEast from the ...
Dreitannenriegel
The Dreitannenriegel is a mountain, 1.090.2 m above sea level, in the Bavarian Forest. In the mountain rises from the top of the front Bavarian forest high above the Lower Bavarian district of Deggendorf city and lies in the municipality of Grafl ...
page 201

2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401

Einodriegel 

Enzian (Bavarian Forest) 

Eschenberg (Kirchdorf im Wald) 

GeiSkopf 

GeiSriegel 

Grandelberg 

GroSer Falkenstein 

GroSer Rachel 

Hochficht 

Hoher Bogen 

Osser 

Plockenstein 

Mount Paraw 

Tochal 
List of streets named after Sun Yatsen 

Coverage of Google Street View 

Annapurna Massif 

Cho Oyu 

Dhaulagiri 

Lhotse 

Lhotse Middle 

Lhotse Shar 

Makalu 

Manaslu 

Nanga Parbat 

Shishapangma 

South Summit (Mount Everest) 

Broad Peak 

Gasherbrum I 

Gasherbrum II 

Comephorus 

Cottocomephorus 

Baikal yellowfin 

Khuzhir Airport 

Ogoy Island 

Olkhon Island 
Ushkan Islands 

Bellingshausen Sea 
Frecker Ridge 

RiiserLarsen Sea 

Ross Sea 

Weddell Sea 

Arctic Circle (organization) 
The Structure and Biology of Arctic F .. 
Acodontaster conspicuus 

Colossal squid 

Falsimargarita gemma 

Labidiaster annulatus 
Laternula elliptica 

Odontaster validus 
Paramoera walkeri 
Praealtus 

Psychroteuthis glacialis 

Sterechinus neumayeri 
Tritoniella 

Turquets octopus 

PacificAntarctic Ridge 

HMS Caicos (K505) 
Adirondack High Peaks 

High Peaks Wilderness Area 
Adirondack Trail Improvement Society 

Allen Mountain (New York) 

Armstrong Mountain (Keene Valley, New .. 

Basin Mountain (New York) 

Big Slide Mountain (New York) 

Blake Peak 

Cliff Mountain (New York) 

Mount Colden 

Mount Colvin 

Couchsachraga Peak 

Dial Mountain 

Dix Mountain 

Dix Mountain Wilderness Area 

Dix Range 

South Dix 

Donaldson Mountain 

Mount Emmons (New York) 

Esther Mountain 

Giant Mountain 

Gray Peak (New York) 

Great Range 

Mount Haystack 

Hough Peak 

MacIntyre Mountains 

Macomb Mountain 

Mount Marshall (New York) 

Nippletop 

Nye Mountain 

Panther Peak 

Grace Peak 

Phelps Mountain (New York) 

Porter Mountain 

Mount Redfield 

Rocky Peak Ridge 

Saddleback Mountain (Keene, New York) 

Santanoni Peak 

Sawteeth (New York) 

Seward Mountain (New York) 

Seymour Mountain (Franklin County, Ne .. 

Mount Skylight 