Filters








385,962 Hits in 3.8 sec

DETECTION OF BEHAVIOR PATTERNS OF INTEREST USING BIG DATA WHICH HAVE SPATIAL AND TEMPORAL ATTRIBUTES

R. W. La Valley, A. Usher, A. Cook
2017 ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences  
to find patterns of interest.  ...  This technique provides a foundation for reducing the data into bins that can yield new methods for pattern discovery and detection in Big Data.  ...  The ease of having multiple levels of precisions easily available without recalculating for each precision provides an ideal environment for the discovery of patterns of interest.  ... 
doi:10.5194/isprs-annals-iv-4-w2-31-2017 fatcat:bq3s2sjs4rbtrmnn7zw5agyh5u

Hierarchical control of false discovery rate for phase locking measures of EEG synchrony

Archana K. Singh, Steven Phillips
2010 NeuroImage  
Instead, we propose a novel application of a hierarchical FDR method, which subsumes multiple families, for detecting significant PLV effects.  ...  Standard methods for controlling Type I error, which treat all hypotheses as belonging to a single family, can fail to detect any significant discoveries.  ...  In our data, as the number of full-tree discoveries include a large proportion of level-3 discoveries, level-3 hFDR bound is smaller than full-tree hFDR bound.  ... 
doi:10.1016/j.neuroimage.2009.12.030 pmid:20006711 fatcat:ojcsiluhirfz5car7pdsvhlwyy

Multiple Data Source Discovery with Group Interaction Approach

Wu Hao
2013 Advanced Materials Research  
These patterns are useful in predicting associated behaviors at the attribute-value level.  ...  Therefore, this paper proposes a group interaction approach for multiple data source discovery. Group interactions include, such as rules, differences, and links between datasets.  ...  These techniques will enable efficient and automatic sharing of large databases between organizations. Therefore, there are three main research directions on multiple data source discovery.  ... 
doi:10.4028/www.scientific.net/amr.760-762.2141 fatcat:y325dppje5ae5gj2a2n3fi365a

Logic based Pattern Discovery using the Integral Logical Derivative Rule

Prasadh. K, Sutheer. T
2013 International Journal of Computer Applications  
An analytical and empirical result shows the lesser execution time with the efficient integral based pattern discovery of our proposed scheme.  ...  Problem Statement: To enhance the pattern discovery process, the multi-level proposional process work extends the pattern discovery process with coherent rule generation framework.  ...  The outcome revealed in the pattern implies that the proposed ILDR algorithm can obtain the multiple-level association rules under diverse integral logic in an easy and valuable way.  ... 
doi:10.5120/11377-6648 fatcat:d2jshydb75enlmh6ctcigkw4yy

FP-tree and COFI Based Approach for Mining of Multiple Level Association Rules in Large Databases [article]

Virendra Kumar Shrivastava, Parveen Kumar, K. R. Pardasani
2010 arXiv   pre-print
The discovery of multiple level association rules is very much useful in many applications.  ...  In most of the studies for multiple level association rule mining, the database is scanned repeatedly which affects the efficiency of mining process.  ...  There are possible to way to explore efficient discovery of multiple level association rules.  ... 
arXiv:1003.1821v1 fatcat:vl3y32dqxvakpmvbdqxcfzdxui

Towards a Framework for Knowledge Discovery [chapter]

Jeroen S. de Bruin, Joost N. Kok
2006 IFIP International Federation for Information Processing  
We propose a software architecture for such inductive databases, and extend this architecture to support the clustering of inductive databases and to make them suitable for data mining on the grid.  ...  Acknowledgements This work is part of the BioRange programme of the Netherlands Bioinformatics Centre (NBIC), which is supported by BSIK grant BSIK03013 through the Netherlands Genomics Initiative (NGI  ...  The efficiency of the data mining process also depends on the way that data is represented within the database, so a compromise must be made between efficient storage and efficient discovery.  ... 
doi:10.1007/978-0-387-34749-3_23 fatcat:kcz7zivntjgljnnlzacfsvz6hi

ANALYSIS OF UNI PATH AND MULTI PATH ROUTING PROTOCOLS IN MOBILE ADHOC NETWORKS

AVINASH GIRI, JITENDRA PRITHVIRAJ, ASHOK VERMA
2013 International Journal of Smart Sensor and Adhoc Network.  
The evaluation of all the protocols is carried out in terms of different scenarios using NS2.  ...  A MANET is an interconnection of mobile devices by wireless links, which forms a dynamic topology. Routing protocols play a vital role in transmission of data across the network.  ...  AOMDV discovers multiple paths between a source and destination to provide efficient fault tolerance by providing quicker and more efficient recovery from route failures in a dynamic network.  ... 
doi:10.47893/ijssan.2013.1163 fatcat:zbzshbpxqvakxbpcrcw6azzzo4

Mining Multiple Data Sources: Local Pattern Analysis

Shichao Zhang, Mohammed J. Zaki
2006 Data mining and knowledge discovery  
The above observations encourage the development of pattern discovery algorithms based on local patterns.  ...  databases in two steps: sequence clustering and consensus pattern discovery directly from each cluster through multiple alignments; and (3) a model is proposed to identify both high vote sequential patterns  ... 
doi:10.1007/s10618-006-0041-y fatcat:xw7f7d3rlvhtncwweq3vrm353q

An Empirical Research on Spatial Data Mining

2019 VOLUME-8 ISSUE-10, AUGUST 2019, REGULAR ISSUE  
The discussion shows that spatial data mining is a promising area of information discovery and can lead to extensive research and many challenging issues.  ...  based knowledge discovery are discussed.  ...  Database knowledge exploration is the discovery of necessary patterns from large databases and is combined with multiple fields such as machine learning, database systems, data visualization, analytics  ... 
doi:10.35940/ijitee.l1136.10812s219 fatcat:zp546xjq4fge5l5czo2vhpys2u

A parallel and incremental algorithm for efficient unique signature discovery on DNA databases

Hsiao Lee, Tzu-Fang Sheu, Chuan Tang
2010 BMC Bioinformatics  
Results: This work proposes two discovery algorithms -the consecutive multiple discovery (CMD) algorithm and the parallel and incremental signature discovery (PISD) algorithm.  ...  The PISD algorithm further increases discovery efficiency by applying parallel computing. The CMD algorithm is designed to discover implicit signatures efficiently.  ...  Acknowledgements The authors would like to thank the National Science Council of the Republic of China, Taiwan, for financially supporting this research under Grants 98-2218-E-126-001-MY2.  ... 
doi:10.1186/1471-2105-11-132 pmid:20230647 pmcid:PMC2848650 fatcat:haj3r26f2jfv5ngcvbkgj24kea

BicNET: Efficient Biclustering of Biological Networks to Unravel Non-Trivial Modules [chapter]

Rui Henriques, Sara C. Madeira
2015 Lecture Notes in Computer Science  
The discovery of dense biclusters in biological networks received an increasing attention in recent years.  ...  Results from the analysis of protein and gene interaction networks support the relevance and efficiency of BicNET.  ...  BicNET shows heightened efficiency levels.  ... 
doi:10.1007/978-3-662-48221-6_1 fatcat:k4owjebddvgzdhqgomn2xnfjw4

Mining Frequent Patterns with Counting Inference at Multiple Levels

Mittar Vishav, Ruchika Yadav, Deepika Sirohi
2010 International Journal of Computer Applications  
Mining association rules at multiple levels helps in finding more specific and relevant knowledge. While computing the number of frequency of an item we need to scan the given database many times.  ...  So we used counting inference approach for finding frequent itemsets at each concept levels which reduce the number of scan.  ...  pattern discovery techniques in knowledge discovery and data mining (KDD).  ... 
doi:10.5120/778-1100 fatcat:y2fynootuja5hivqa4fmhkrsdq

Effective and Innovative Approaches for Comparing Different Multilevel Association Rule Mining for Feature Extraction: A Review

Alisha S.Patel, Mohit Patel
2015 International Journal of Computer Applications  
Producing large number of candidate item sets and multiple scanning databases is main shortage of the Apriori algorithm.  ...  Its main goal is to find hidden information in or between levels of abstraction. It is mainly used for decision making for large data. It focuses on the customer relationship management.  ...  efficiency of association rules mining of the same level and across levels.  ... 
doi:10.5120/19212-1046 fatcat:fy2y6n5mjbgfvoxrigbwwaszmu

A Web-based Interactive Visual Graph Analytics Platform [article]

Nesreen K. Ahmed, Ryan A. Rossi
2015 arXiv   pre-print
At the heart of GraphVis lies a multi-level interactive network visualization and analytics engine that allows for real-time graph mining and exploration across multiple levels of granularity simultaneously  ...  The structure, properties, and patterns of the network are computed automatically and can be instantly explored in real-time.  ...  For instance, the neighborhood of a node can be highlighted as well as its micro-level statistics and properties (Figure 3) . Multiple visual representations of the graph data are also provided.  ... 
arXiv:1502.00354v1 fatcat:szfbkfjy3fgqjpsymyyyqfkjoe

Review of the TEIRESIAS-Based Tools of the IBM Bioinformatics and Pattern Discovery Group

Anthony P. Burgard, Gregory L. Moore, Costas D. Maranas
2001 Metabolic Engineering  
Pattern discovery techniques identify ''interesting'' patterns of events (e.g., amino acids, nucleotides, gene expression levels, etc.) that appear a number of times above a threshold in a particular set  ...  An example of the application of TEIRESIAS to a (6 × 10) matrix is shown in Fig. 2 . The output is a list of patterns composed of multiple numeric intervals.  ... 
doi:10.1006/mben.2001.0195 pmid:11676564 fatcat:r3bmyndlarcwbcgi7u7uoey3fy
« Previous Showing results 1 — 15 out of 385,962 results