2018 · 14 citations · 32 references
ComputingData ScienceBig Data AnalyticsData MiningMobile ComputingDimension ReductionDimensionality ReductionMobility Pattern AnalysisMobility PatternsTransportation AnalyticsTransportation NetworksComplexityCurse Of DimensionalityDimensionality Reduction For Large DataHigh-dimensional Data MiningLarge-scale Data ProcessingLinear ComplexityMobility Data AnalysisTransport Mode
High-dimensional data mining is challenging due to the "curse of dimensionality". Hubness reduction counters one particular aspect of the dimensionality curse, but suffers from quadratic algorithmic complexity. We present approximate hubness reduction methods with linear complexity in time and space, thus enabling hubness reduction for large data for the first time. Furthermore, we introduce a new hubness measure especially suited for large data, which is, in addition, readily interpretable. Experiments on synthetic and real-world data show that the approximations come at virtually no cost in accuracy in comparison with full hubness reduction. Finally, we demonstrate improved transport mode detection in massive mobility data collected with mobile devices as concrete research application. All methods are made publicly available in a free open source software package.
32
Chih-Chung Chang, Chih‐Jen Lin · ACM Transactions on Intelligent Systems and Technology · 2011 · 41.3K citations
UCI Machine Learning Repository
Arthur Asuncion · Medical Entomology and Zoology · 2007 · 24.4K citations
k-means++: the advantages of careful seeding
David Arthur, Sergei Vassilvitskii · 2007 · 6.3K citations
Piotr Indyk, Rajeev Motwani · 1998 · 4.2K citations · Full text