Lihi Dery

Dr. Lihi Dery

orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2019 in Expert Systems with Applications
Verified
Journal Article
Closed access
HWHavi Werbin-Ofir
Havi Werbin-Ofir
LDLihi Dery
Lihi Dery
ESErez Shmueli
Erez Shmueli

1 September 2014 in Information Sciences
Verified
Journal Article
Closed access
LDLihi Dery
Lihi Dery
Meir KalechMeir Kalech
Meir Kalech
LRLior Rokach
Lior Rokach
BSBracha Shapira
Bracha Shapira

6 August 2016 in Group Decision and Negotiation
Verified
Journal Article
Closed access
PDF file
OLOfrit Lesser
Ofrit Lesser
LDLihi Dery
Lihi Dery
Meir KalechMeir Kalech
Meir Kalech
YEYuval Elovici
Yuval Elovici

25 September 2020 in IEEE Access
Verified
Journal Article
Open access
LDLihi Dery
Lihi Dery
ESErez Shmueli
Erez Shmueli
Label ranking tasks are concerned with the problem of ranking a finite set of labels for each instance according to their relevance. Boosting is a well-known and reliable ensemble technique that was shown to often outperform other learning algorithms. While boosting algorithms were developed for a multitude of machine learning tasks, label ranking tasks were overlooked. Herein, we present a novel boosting algorithm, BoostLR, that was specifically designed for label ranking tasks. Similarly to other boosting algorithms, BoostLR, proceeds in rounds, where in each round, a single weak model is trained over a sampled set of instances. Instances that were identified as harder to predict in the current round, receive a higher (boosted) weight, and therefore also a higher probability to be included in the sample of the forthcoming round. Extensive evaluation of our proposed algorithm on 24 semi-synthetic and real-world label ranking datasets concludes that our algorithm significantly outperforms the current state-of-the-art label ranking methods.

7 October 2024 in Journal of Scheduling
Verified
Journal Article
Open access
PDF file
SKShai Krigman
Shai Krigman
Tal GrinshpounTal Grinshpoun
Tal Grinshpoun
LDLihi Dery
Lihi Dery
Earth observation satellites (EOS) are satellites equipped with optical sensors that orbit the Earth to take photographs of particular areas at the request of users. With the development of space technology, the number of satellites has increased continuously. Yet still, the number of satellites cannot meet the explosive growth of applications. Thus, scheduling solutions are required to satisfy requests and obtain high observation efficiency. While the literature on multi-satellite scheduling is rich, most solutions are centralized algorithms. However, due to their cost, EOS systems are often co-funded by several agents (e.g., countries, companies, or research institutes). Central solutions require that these agents share their requests for observations with others. To date, there has yet to be a solution for EOS scheduling that protects the private information of the interested parties. In this study, we model the EOS scheduling problem as a distributed constraint optimization problem (DCOP). This modeling enables the generation of timetables for the satellites in a distributed manner without a priori sharing users’ private information with some central authority. For solving the resulting DCOP, we use and compare the results of two different local search algorithms—Distributed Stochastic Algorithm and Maximum Gain Message—which are known to produce efficient solutions in a timely manner. The modeling and solving of the resulting DCOP constitute our new solution method, which we term Distributed Satellite Timetable Solver (DSTS). Experimental evaluation reveals that the DSTS method provides solutions of higher quality than a commonly used centralized greedy algorithm and is comparable to an additional centralized algorithm that we propose.

1 November 2016 in Expert Systems with Applications
Verified
Journal Article
Closed access
LDLihi Dery
Lihi Dery
Meir KalechMeir Kalech
Meir Kalech
LRLior Rokach
Lior Rokach
BSBracha Shapira
Bracha Shapira