The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Association Rule Mining is an important data mining technique and Maximal frequent item sets mining is an essential step in the process of Association rule. Here presented is BM-MFI, a new algorithm based on matrix, for mining maximal frequent item sets. Its basic idea is trans-forming the event database into matrix database by operating the rows and columns of matrix to compress the data-base. Using...
Many image processing and computer vision problems can be solved as quadratic programs in the nonnegative cone. This paper develops a provably convergent multiplicative update that has a simple form and is amenable to fine-grained data parallelism. Classic algorithms for deblurring, matrix factorization, and tomography are recovered as special cases. This paper also demonstrates applications to super-resolution,...
Doppler radar is an important tool for weather research, forecasting, and severe weather warnings. The most basic radar applications use a single radar field which in polar coordinates. However, single radar covers an area with a set of restrictions and individual characteristics. Such restrictions include a finite coverage area, spatial and temporal gaps in radar data coverage, and sensitivity to...
This paper proposes a maximal frequent itemsets mining algorithm BFI-MFI (Based on Frequent Itemset for maximal frequent itemsets). A maximal frequent itemset in frequent itemsets can be confirmed through detecting whether exiting their superset. This algorithm provides a new method, which improve the mining efficiency.
An optimized decision tree algorithm based on rough sets model is proposed. Firstly the most popular decision tree algorithms, which are based rough sets model, usually partition examples too detailed to avoid the negative impact caused by a few special examples on decision tree because of the classification accuracy. The inhibitory factors are put forward in the forming process of the algorithm to...
Recently, with the constant development of application of high-dimensional data query, the index-based nearest neighbor retrieval has greatly improved the efficiency and accuracy of retrieval. The approximate nearest neighbor query is proposed and applied to get high performance to ease the curse of dimensionality to a certain extent. However, the heuristic pruning method may prune many local optimal...
Rainwater is a traditional water resource and today taken on a new look because of the world-wide water crisis. The current paper demonstrates the outcomes of the research on the feasibility of rainwater use in high-rise residential envelopes for four Australian cities of Melbourne, Sydney, Perth and Darwin. Different climate patterns and various levels of water demand management measures have been...
The technology of real-time reliable multicast over a best-effort service network has become more popular recently. In this paper, a new technique is introduced that integrates word interleaving, forward error correction (FEC) and automatic repeat request (ARQ) to mitigate the error and loss effects encountered in wired and wireless Internet applications. For multicast video sessions spanning tens...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.