• ETRI Journal
• /
• v.29 no.3
• /
• pp.336-352
• /
• 2007

Sequential pattern mining has become an essential task with broad applications. Most sequential pattern mining algorithms use a minimum support threshold to prune the combinatorial search space. This strategy provides basic pruning; however, it cannot mine correlated sequential patterns with similar support and/or weight levels. If the minimum support is low, many spurious patterns having items with different support levels are found; if the minimum support is high, meaningful sequential patterns with low support levels may be missed. We present a new algorithm, weighted interesting sequential (WIS) pattern mining based on a pattern growth method in which new measures, sequential s-confidence and w-confidence, are suggested. Using these measures, weighted interesting sequential patterns with similar levels of support and/or weight are mined. The WIS algorithm gives a balance between the measures of support and weight, and considers correlation between items within sequential patterns. A performance analysis shows that WIS is efficient and scalable in weighted sequential pattern mining.

• The KIPS Transactions:PartD
• /
• v.17D no.4
• /
• pp.253-258
• /
• 2010

Traditional frequent pattern mining considers equal profit/weight value of every item. Weighted Frequent Pattern (WFP) mining becomes an important research issue in data mining and knowledge discovery by considering different weights for different items. Existing algorithms in this area are based on fixed weight. But in our real world scenarios the price/weight/importance of a pattern may vary frequently due to some unavoidable situations. Tracking these dynamic changes is very necessary in different application area such as retail market basket data analysis and web click stream management. In this paper, we propose a novel concept of dynamic weight and an algorithm DWFPM (dynamic weighted frequent pattern mining). Our algorithm can handle the situation where price/weight of a pattern may vary dynamically. It scans the database exactly once and also eligible for real time data processing. To our knowledge, this is the first research work to mine weighted frequent patterns using dynamic weights. Extensive performance analyses show that our algorithm is very efficient and scalable for WFP mining using dynamic weights.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.2
• /
• pp.137-144
• /
• 2013

A sequential pattern mining is finding out frequent patterns from the data set in time order. In this field, a dynamic weighted sequential pattern mining is applied to a computing environment that changes depending on the time and it can be utilized in a variety of environments applying changes of dynamic weight. In this paper, we propose a new sequence data mining method to explore the stream data by applying the dynamic weight. This method reduces the candidate patterns that must be navigated by using the dynamic weight according to the relative time sequence, and it can find out frequent sequence patterns quickly as the data input and output using a hash structure. Using this method reduces the memory usage and processing time more than applying the existing methods. We show the importance of dynamic weighted mining through the comparison of different weighting sequential pattern mining techniques.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.2 no.3
• /
• pp.210-214
• /
• 2002

Association rule mining is an exploratory learning task to discover some hidden dependency relationships among items in transaction data. Quantitative association rules denote association rules with both categorical and quantitative attributes. There have been several works on quantitative association rule mining such as the application of fuzzy techniques to quantitative association rule mining, the generalized association rule mining for quantitative association rules, and importance weight incorporation into association rule mining fer taking into account the users interest. This paper introduces a new method for generalized fuzzy quantitative association rule mining with importance weights. The method uses fuzzy concept hierarchies fer categorical attributes and generalization hierarchies of fuzzy linguistic terms fur quantitative attributes. It enables the users to flexibly perform the association rule mining by controlling the generalization levels for attributes and the importance weights f3r attributes.

• Journal of Digital Contents Society
• /
• v.17 no.2
• /
• pp.81-88
• /
• 2016

The general frequent pattern mining considers frequency and support of items. To extract useful information, it is necessary to consider frequency and weight of items that reflects the changing of user interest as time passes. The suitable services considering time or location is requested by user so that the weighted mining method is necessary. We propose a method of weighted frequent pattern mining based on service ontology. The weight considering time and location is given to service items and it is applied to association rule mining method. The extracted rule is combined with stored service rule and it is based on timely service to offer for user.

• Safety and Health at Work
• /
• v.8 no.1
• /
• pp.89-93
• /
• 2017

Background: Rates of overweight and obese Australians are high and continue to rise, putting a large proportion of the population at risk of chronic illness. Examining characteristics associated with preference for a work-based weight-loss program will enable employers to better target programs to increase enrolment and benefit employees' health and fitness for work. Methods: A cross-sectional survey was undertaken at two Australian mining sites. The survey collected information on employee demographics, health characteristics, work characteristics, stages of behavior change, and preference for workplace assistance with reaching a healthy weight. Results: A total of 897 employees participated; 73.7% were male, and 68% had a body mass index in the overweight or obese range. Employees at risk of developing obesity-related chronic illnesses (based on high body mass index) were more likely to report preference for weight management assistance than lower risk employees. This indicates that, even in the absence of workplace promotion for weight management, some at risk employees want workplace assistance. Employees who were not aware of a need to change their current nutrition or physical activity behaviors were less likely to seek assistance. This indicates that practitioners need to communicate the negative effects of excess weight and promote the benefits of a healthy lifestyle to increase the likelihood of weight management. Conclusion: Weight management programs should provide information, motivation. and trouble-shooting assistance to meet the needs of at-risk mining employees, including those who are attempting to change and maintain behaviors to achieve a healthy weight and be suitably fit for work.

• Journal of Information Processing Systems
• /
• v.6 no.1
• /
• pp.79-90
• /
• 2010

A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. The continuous characteristic of streaming data necessitates the use of algorithms that require only one scan over the stream for knowledge discovery. Data mining over data streams should support the flexible trade-off between processing time and mining accuracy. In many application areas, mining frequent itemsets has been suggested to find important frequent itemsets by considering the weight of itemsets. In this paper, we present an efficient algorithm WSFI (Weighted Support Frequent Itemsets)-Mine with normalized weight over data streams. Moreover, we propose a novel tree structure, called the Weighted Support FP-Tree (WSFP-Tree), that stores compressed crucial information about frequent itemsets. Empirical results show that our algorithm outperforms comparative algorithms under the windowed streaming model.

• Geomechanics and Engineering
• /
• v.19 no.3
• /
• pp.255-268
• /
• 2019

Taking top-coal caving mining face (TCCMF) as research object, this paper considers the combination of top-coal and immediate roof as cushion layer to build the solution model of support resistance based on the theory of elastic foundation beam. Meanwhile, the physical and mechanical properties of coal-rock combination influencing on strata behaviors is explored. The results illustrate that the subsidence of main roof in coal wall increases and the first weighting interval decreases with the increase of top-coal and immediate roof thicknesses as well as the decrease of top-coal and immediate roof elastic modulus. Moreover, the overlying strata reflecting on support has negative and positive relationship with top-coal thickness and immediate roof thickness, respectively. However, elastic modulus has limit influence on the dead weight of top-coal and immediate roof. As a result, it has similar roles on the increase of total support resistance and overlying strata reflecting on support in the limit range of roof control distance. In view of sensitive analysis causing the change of total support resistance, it can be regards as the rank of three components as immediate roof weight > overlying strata reflecting on support > top coal weight. Finally, combined with the monitoring data of support resistance in Qingdong 828, the validity of support resistance determined based on elastic foundation beam is demonstrated, and this method can be recommended to adopt for support type selecting in TCCMF.

• Journal of the Korean Mathematical Society
• /
• v.61 no.2
• /
• pp.207-226
• /
• 2024

In this paper, the weighted L^p boundedness of multilinear commutators and multilinear iterated commutators generated by the multilinear singular integral operators with generalized kernels and BMO functions is established, where the weight is multiple weight. Our results are generalizations of the corresponding results for multilinear singular integral operators with standard kernels and Dini kernels under certain conditions.

• International Journal of Computer Science & Network Security
• /
• v.22 no.7
• /
• pp.352-358
• /
• 2022

Text mining is an important process used for analyzing the data collected from different sources like videos, audio, social media, and so on. The tools like Natural Language Processing (NLP) are mostly used in real-time applications. In the earlier research, text mining approaches were implemented using long-short memory (LSTM) networks. In this paper, text mining is performed using average-stochastic gradient descent weight-dropped (AWD)-LSTM techniques to obtain better accuracy and performance. The proposed model is effectively demonstrated by considering the internet movie database (IMDB) reviews. To implement the proposed model Python language was used due to easy adaptability and flexibility while dealing with massive data sets/databases. From the results, it is seen that the proposed LSTM plus weight dropped plus embedding model demonstrated an accuracy of 88.36% as compared to the previous models of AWD LSTM as 85.64. This result proved to be far better when compared with the results obtained by just LSTM model (with 85.16%) accuracy. Finally, the loss function proved to decrease from 0.341 to 0.299 using the proposed model