scholarly journals A Data-Driven Based Dynamic Rebalancing Methodology for Bike Sharing Systems

2021 ◽  
Vol 11 (15) ◽  
pp. 6967
Author(s):  
Marco Cipriano ◽  
Luca Colomba ◽  
Paolo Garza
Keyword(s):  
Decision Making ◽  
Pattern Mining ◽  
Frequent Pattern Mining ◽  
Real Data ◽  
Frequent Pattern ◽  
Data Driven ◽  
System Usability ◽  
Bike Sharing ◽  
Data Driven Approach

Mobility in cities is a fundamental asset and opens several problems in decision making and the creation of new services for citizens. In the last years, transportation sharing systems have been continuously growing. Among these, bike sharing systems became commonly adopted. There exist two different categories of bike sharing systems: station-based systems and free-floating services. In this paper, we concentrate our analyses on station-based systems. Such systems require periodic rebalancing operations to guarantee good quality of service and system usability by moving bicycles from full stations to empty stations. In particular, in this paper, we propose a dynamic bicycle rebalancing methodology based on frequent pattern mining and its implementation. The extracted patterns represent frequent unbalanced situations among nearby stations. They are used to predict upcoming critical statuses and plan the most effective rebalancing operations using an entirely data-driven approach. Experiments performed on real data of the Barcelona bike sharing system show the effectiveness of the proposed approach.

scholarly journals Ranking Biomedical Annotations with Annotator’s Semantic Relevancy

2014 ◽  
Vol 2014 ◽  
pp. 1-11
Author(s):  
Aihua Wu
Keyword(s):  
Pattern Mining ◽  
Frequent Pattern Mining ◽  
Frequent Pattern ◽  
Semantic Relationship ◽  
Critical Problem ◽  
Data Set ◽  
Relational Information ◽  
Common Features ◽  
Data User

Biomedical annotation is a common and affective artifact for researchers to discuss, show opinion, and share discoveries. It becomes increasing popular in many online research communities, and implies much useful information. Ranking biomedical annotations is a critical problem for data user to efficiently get information. As the annotator’s knowledge about the annotated entity normally determines quality of the annotations, we evaluate the knowledge, that is, semantic relationship between them, in two ways. The first is extracting relational information from credible websites by mining association rules between an annotator and a biomedical entity. The second way is frequent pattern mining from historical annotations, which reveals common features of biomedical entities that an annotator can annotate with high quality. We propose a weighted and concept-extended RDF model to represent an annotator, a biomedical entity, and their background attributes and merge information from the two ways as the context of an annotator. Based on that, we present a method to rank the annotations by evaluating their correctness according to user’s vote and the semantic relevancy between the annotator and the annotated entity. The experimental results show that the approach is applicable and efficient even when data set is large.

An Adaptive Data Distribution Through Tree Rules in Frequent Pattern Mining

2018 ◽  
pp. 300-305
Keyword(s):  
Information Sharing ◽  
Pattern Mining ◽  
Data Distribution ◽  
Frequent Pattern Mining ◽  
Frequent Pattern ◽  
General Development ◽  
Secure Information ◽  
Evaluation Parameters ◽  
Secure Information Sharing

Information sharing among the associations is a general development in a couple of zones like business headway and exhibiting. As bit of the touchy principles that ought to be kept private may be uncovered and such disclosure of delicate examples may impacts the advantages of the association that have the data. Subsequently the standards which are delicate must be secured before sharing the data. In this paper to give secure information sharing delicate guidelines are bothered first which was found by incessant example tree. Here touchy arrangement of principles are bothered by substitution. This kind of substitution diminishes the hazard and increment the utility of the dataset when contrasted with different techniques. Examination is done on certifiable dataset. Results shows that proposed work is better as appear differently in relation to various past strategies on the introduce of evaluation parameters.

Learning and Synchronized Privacy Preserving Frequent Pattern Mining

2011 ◽  
Vol 22 (8) ◽  
pp. 1749-1760
Author(s):  
Yu-Hong GUO ◽  
Yun-Hai TONG ◽  
Shi-Wei TANG ◽  
Leng-Dong WU
Keyword(s):  
Pattern Mining ◽  
Frequent Pattern Mining ◽  
Privacy Preserving ◽  
Frequent Pattern

scholarly journals Genotype Pattern Mining for Pairs of Interacting Variants Underlying Digenic Traits

Genes ◽  
2021 ◽  
Vol 12 (8) ◽  
pp. 1160
Author(s):  
Atsuko Okazaki ◽  
Sukanya Horpaopan ◽  
Qingrun Zhang ◽  
Matthew Randesi ◽  
Jurg Ott
Keyword(s):  
Null Hypothesis ◽  
Pattern Mining ◽  
Genetic Diseases ◽  
Frequent Pattern Mining ◽  
Case Control ◽  
Frequent Pattern ◽  
Permutation Testing ◽  
Case Control Studies ◽  
P Values ◽  
Dna Variants

Some genetic diseases (“digenic traits”) are due to the interaction between two DNA variants, which presumably reflects biochemical interactions. For example, certain forms of Retinitis Pigmentosa, a type of blindness, occur in the presence of two mutant variants, one each in the ROM1 and RDS genes, while the occurrence of only one such variant results in a normal phenotype. Detecting variant pairs underlying digenic traits by standard genetic methods is difficult and is downright impossible when individual variants alone have minimal effects. Frequent pattern mining (FPM) methods are known to detect patterns of items. We make use of FPM approaches to find pairs of genotypes (from different variants) that can discriminate between cases and controls. Our method is based on genotype patterns of length two, and permutation testing allows assigning p-values to genotype patterns, where the null hypothesis refers to equal pattern frequencies in cases and controls. We compare different interaction search approaches and their properties on the basis of published datasets. Our implementation of FPM to case-control studies is freely available.

scholarly journals Frequent Pattern Mining Using Db-Scan Algorithm.

2021 ◽  
Vol 1916 (1) ◽  
pp. 012054
Author(s):  
M Kavitha Margret ◽  
A Ponni ◽  
A Priyanka
Keyword(s):  
Pattern Mining ◽  
Frequent Pattern Mining ◽  
Frequent Pattern

Customized frequent patterns mining algorithms for enhanced Top-Rank-K frequent pattern mining

2021 ◽  
Vol 169 ◽  
pp. 114530
Author(s):  
Areej Ahmad Abdelaal ◽  
Sa'ed Abed ◽  
Mohammad Al-Shayeji ◽  
Mohammad Allaho
Keyword(s):  
Pattern Mining ◽  
Frequent Pattern Mining ◽  
Frequent Pattern ◽  
Frequent Patterns ◽  
Mining Algorithms
Sign in / Sign up

Export Citation Format

Share Document