Wyniki wyszukiwania - BazTech

1

Srilatha P., Manjula R.

Journal of Telecommunications and Information Technology

|

2016

|

nr 2

87--94

EN

Social networking sites have gained much popularity in the recent years. With millions of people connected virtually generate loads of data to be analyzed to infer meaningful associations among links. Link prediction algorithm is one such problem, wherein existing nodes, links and their attributes are analyzed to predict the possibility of potential links, which are likely to happen over a period of time. In this survey, the local structure based link prediction algorithms existing in literature with their features and also the possibility of future research directions is reported and discussed. This survey serves as a starting point for beginners interested in understanding link prediction or similarity index algorithms in general and local structure based link prediction algorithms in particular.

2

Rough Inclusion Functions and Similarity Indices

Gomolińska A., Wolski M.

Fundamenta Informaticae

|

2014

|

Vol. 133, nr 2/3

149--163

EN

Rough inclusion functions are mappings considered in rough set theory with which one can measure the degree of inclusion of a set (information granule) in a set (information granule) in line with rough mereology. On the other hand, similarity indices are mappings used in cluster analysis with which one can compare clusterings, and clustering methods with respect to similarity. In this article we show that a large number of similarity indices, known from the literature, can be generated by three simple rough inclusion functions, the standard rough inclusion function included.

3

Effect of shelterbelts on adjoining cultivated fields : Patrolling intensity of carabid beetles (Carabidae) and spiders (Araneae)

Kajak A., Oleszczuk M.

Polish Journal of Ecology

|

2004

|

Vol. 52, nr 2

155-172

EN

The impact of wooded shelterbelts on the patrolling intensity (number of patrolling individuals per trap, per day (NP) - activity density) of spiders and ground beetles was investigated by using pitfall traps placed in parallel rows in shelterbelt centres, along margins of wood and field, and in open wheat fields at a distance of 10 and 50 m from trees. In the shelterbelt - managed areas the biomass of patrolling (BP) arthropods (ground beetles and spiders) was lower inside the fields (F10, F50) than at the field margins and in the shelterbelts. The BP and individual weight increased with the age of strips. However, in the control field with no wood in the vicinity, the BP of carabid beetles was as high as inside the shelterbelts. The highest similarity between the shelterbelts and the field (BP, Morisita's similarity index, diversity index H', individual weight) was found in the field adjoining the youngest (aged 2 years) shelterbelt. It is concluded that similarity between permanent and cultivated ecosystems is important for successful exchange of individuals between them. In the field adjacent to young shelterbelt and in the field with no woods in the vicinity the aeronautic, agrobiont species prevail. In the fields adjacent to older shelterbelts colonization by large body-size species, characteristic for permanent ecosystems was found.

4

Data granulation through optimization of similarity measure

Bargiela A., Pedrycz W., Hirota K.

Archives of Control Sciences

|

2002

|

Vol. 12, no. 4

469-491

EN

We introduce a logic-driven clustering in which prototypes are formed and evaluated in a sequential manner. The way of revealing a structure in data is realized by maximizing a certain performance index (objective function) that takes into consideration an overall level of matching and a similarity level between the prototypes. It is shown how the relevance of the prototypes translates into their granularity. The clustering method helps identify and quantify anisotropy of the feature space. We also show how each prototype is equipped with its own weight vector describing the anisotropy property and thus implying some ranking of the features in the data space.