منابع مشابه
Link Proximity Analysis - Clustering Websites by Examining Link Proximity
This research-in-progress paper presents a new approach called Link Proximity Analysis (LPA) for identifying related web pages based on link analysis. In contrast to current techniques, which ignore intra-page link analysis, the one put forth here examines the relative positioning of links to each other within websites. The approach uses the fact that a clear correlation between the proximity o...
متن کاملProximity Mining: Finding Proximity using Sensor Data History
Emerging ubiquitous and pervasive computing applications often need to know where things are physically located. To meet this need, many locationsensing systems have been developed, but none of the systems for the indoor environment have been widely adopted. In this paper we propose Proximity Mining, a new approach to build location information by mining sensor data. The Proximity Mining does n...
متن کاملSemantic Proximity Search on Heterogeneous Graph by Proximity Embedding
Many real-world networks have a rich collection of objects. The semantics of these objects allows us to capture different classes of proximities, thus enabling an important task of semantic proximity search. As the core of semantic proximity search, we have to measure the proximity on a heterogeneous graph, whose nodes are various types of objects. Most of the existing methods rely on engineeri...
متن کاملProximity Point Properties for Admitting Center Maps
In this work we investigate a class of admitting center maps on a metric space. We state and prove some fixed point and best proximity point theorems for them. We obtain some results and relevant examples. In particular, we show that if $X$ is a reflexive Banach space with the Opial condition and $T:Crightarrow X$ is a continuous admiting center map, then $T$ has a fixed point in $X.$ Also, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nordicom Review
سال: 2000
ISSN: 2001-5119
DOI: 10.1515/nor-2017-0374