The multiple instance regression problem has become a hot research topic recently. There are several approaches to the multiple instance regression problem, such as Salience, Citation KNN, and MI-ClusterRegress. All of these solutions work in batch mode during the training step. However, in practice, examples usually arrive in sequence. Therefore, the training step cannot be accomplished once. In this paper, an online multiple instance regression method ＂OnlineMIR＂ is proposed. OnlineMIR can not only predict the label of a new bag, but also update the current regression model with the latest arrived bag. The experimental results show that OnlineMIR achieves good performances on both synthetic and real data sets.
An improved fruit fly optimization algorithm( iFOA) is proposed for solving the lot-streaming flow-shop scheduling problem( LSFSP) with equal-size sub-lots. In the proposed iFOA,a solution is encoded as two vectors to determine the splitting of jobs and the sequence of the sub-lots simultaneously. Based on the encoding scheme,three kinds of neighborhoods are developed for generating new solutions. To well balance the exploitation and exploration,two main search procedures are designed within the evolutionary search framework of the iFOA,including the neighborhood-based search( smell-vision-based search) and the global cooperation-based search. Finally,numerical testing results are provided,and the comparisons demonstrate the effectiveness of the proposed iFOA for solving the LSFSP.
