Filters








19,550 Hits in 3.8 sec

Process discovery using in-database minimum self distance abstractions

Alifah Syamsiyah, Sander J. J. Leemans
2020 Proceedings of the 35th Annual ACM Symposium on Applied Computing  
Minimum Self Distance Abstraction. Let L ⊆ E * be an event log over E ⊆ U E .  ...  In this paper, we exploited another abstraction to extend the class of processes that can be discovered: the Minimum Self Distance (MSD) abstraction.  ... 
doi:10.1145/3341105.3373846 dblp:conf/sac/SyamsiyahL20 fatcat:5ibvoda63na3tmzil7zj5vcn74

A study on data mining behavior, challenges and methods

2017 International Journal of Latest Trends in Engineering and Technology  
To maintain these data forms multiple database systems or storage Abstract: Information processing is having the greater significance for business organizations to take the management and financial decisions  ...  This kind of unified model increases the capability of self learning and generation of new pattern in a running system.  ...  The database information is required to load in the temporary memory before processing. A larger difference exist between the overall database size and the processing memory size.  ... 
doi:10.21172/1.841.40 fatcat:qzq6z3xidreplecgo5mmivkaae

Neural networks in data mining

AVeselý
2012 Agricultural Economics (AGRICECON)  
In data mining, new methods besides statistical are used. These new methods have their origin in artificial intelligence.  ...  How to gather, store and retrieve data is studied in database theory.  ...  CONCLUSION Knowledge discovery in database is the nontrivial process. Many different methods of data mining are used at present.  ... 
doi:10.17221/5427-agricecon fatcat:thveaikcd5ebdeccigb4aftktu

Efficient Pattern Generation using Declat Algorithm Based on Association Rule Mining in Educational Data Mining

2020 International Journal of Engineering and Advanced Technology  
The output of each student is measured from the database and must be sufficiently accurate to withstand changes in the academic record.  ...  This paper uses a declat algorithm to create patterns or delete effective patterns. Such patterns help to illustrate a growing student's success.  ...  This algorithm uses a database vertical. The horizontal database cannot be used. If the horizontal database is available. The database does not have to be scanned repeatedly.  ... 
doi:10.35940/ijeat.c5399.029320 fatcat:lzgy7hvylbcrxemsxjl5r4qo2m

SELF-EVALUATION FRAMEWORK FOR SEPARATION ESTIMATION FROM SCREENS TO ENSURE EYES PROTECTION UTILIZING IMAGE PROCESSING

Naveen Raj Y
2020 JOURNAL OF MECHANICS OF CONTINUA AND MATHEMATICAL SCIENCES  
Then face can be detected and recognized using image processing. Finally, the distance from monitor to face via web camera is calculated.  ...  If the distance is minimum to pre-define threshold value means, alert will be automatically generated and intimated to users without using any sensors.  ...  This system can be useful to all aged peoples in various applications such as gaming applications, project works and so on.  ... 
doi:10.26782/jmcms.2020.05.00017 fatcat:gfatnw5ve5c2bpnikebaijz4pm

Finding the Most Descriptive Substructures in Graphs with Discrete and Numeric Labels [chapter]

Michael Davis, Weiru Liu, Paul Miller
2013 Lecture Notes in Computer Science  
Most frequent substructure discovery algorithms ignore numeric attributes; in this paper we show how they can be used to improve search performance and discrimination.  ...  We explore the relationship between graph structure and the distribution of attribute values and propose an outlier-detection step, which is used as a constraint during substructure discovery.  ...  ahead of its official release in ELKI.  ... 
doi:10.1007/978-3-642-37382-4_10 fatcat:hvz3v7p3orbwnofe5dv5je7mre

Finding the most descriptive substructures in graphs with discrete and numeric labels

Michael Davis, Weiru Liu, Paul Miller
2013 Journal of Intelligent Information Systems  
Most frequent substructure discovery algorithms ignore numeric attributes; in this paper we show how they can be used to improve search performance and discrimination.  ...  We explore the relationship between graph structure and the distribution of attribute values and propose an outlier-detection step, which is used as a constraint during substructure discovery.  ...  ahead of its official release in ELKI.  ... 
doi:10.1007/s10844-013-0299-7 fatcat:eqrepgrfi5bi3pwcoiol6ygura

Characterisation of Academic Journal Publications Using Text Mining Techniques

Adebola K. Ojo, Adesesan B. Adeyemo
2017 Journal of Computer Sciences and Applications  
The highly rated journals were clustered using Self-Organising Maps (SOM) method with attribute weights in each cluster.  ...  The text-miner software developed was used to crawl and download the abstracts of papers and their bibliometric information from the articles selected from these journal articles.  ...  Minimum of two characters and maximum of twenty-five characters were used in filtering the total length.  ... 
doi:10.12691/jcsa-5-2-1 fatcat:qn2n3jnisfbfzhanfh23uexen4

Substructure Discovery Using Minimum Description Length and Background Knowledge [article]

D. J. Cook, L. B. Holder
1994 arXiv   pre-print
In addition to the minimum description length principle, other background knowledge can be used by SUBDUE to guide the search towards more appropriate substructures.  ...  We describe a new version of our SUBDUE substructure discovery system based on the minimum description length principle.  ...  Future work will combine structural discovery with discovery of concepts using a linearbased representation such as AutoClass (Cheeseman, Kelly, Self, Stutz, Taylor, & Freeman, 1988) .  ... 
arXiv:cs/9402102v1 fatcat:52rm54iq5raetkwwjtxljnhc44

Substructure Discovery Using Minimum Description Length and Background Knowledge

D. J. Cook, L. B. Holder
1994 The Journal of Artificial Intelligence Research  
In addition to the minimum description length principle, other background knowledge can be used by SUBDUE to guide the search towards more appropriate substructures.  ...  We describe a new version of our SUBDUE substructure discovery system based on the minimum description length principle.  ...  Future work will combine structural discovery with discovery of concepts using a linearbased representation such as AutoClass (Cheeseman, Kelly, Self, Stutz, Taylor, & Freeman, 1988) .  ... 
doi:10.1613/jair.43 fatcat:xfxnddsun5hqbldfpqn4wz4si4

Towards a Unifying View of QoS-Enhanced Web Service Description and Discovery Approaches

Dessislava Petrova-Antonova, Sylvia Ilieva
2009 Electronic Proceedings in Theoretical Computer Science  
This motivated us to research current approaches presenting complete solutions for QoS enabled web service description, publication and discovery.  ...  The number of web services increased vastly in the last years.  ...  Then the algorithm finds the web service with the minimum Euclidean distance.  ... 
doi:10.4204/eptcs.2.8 fatcat:3vvawuh5trctzkdszh62lxiseu

Topic Discovery Algorithm Based on Mutual Information and Label Clustering under Dynamic Social Networks

Lin Cui, Dechang Pi, Caiyin Wang
2016 International Journal of Database Theory and Application  
In this paper, a method for clustering label words based on mutual information analysis is presented to find the current topic.  ...  However, LPA algorithm has the uncertainty and the randomness, which affects the accuracy and the stability of the topic discovery.  ...  Output: K topic label clustering to meet the minimum standard of variance.  ... 
doi:10.14257/ijdta.2016.9.5.17 fatcat:ihu63cjqkzff3csztglekr3uke

Autonomous data-driven design of inorganic materials with AFLOW [article]

Corey Oses, Cormac Toher, Stefano Curtarolo
2018 arXiv   pre-print
design rule discovery, and the identification of candidate functional materials.  ...  In combination with standardized parameter sets, the wealth of data is ideal for training machine learning algorithms, which have already been employed for property prediction, descriptor development,  ...  For near-hull structures, the energetic distance from the minimum energy surface is treated as a metric for synthesizability, as only small perturbations in temperature or pressure may be needed for it  ... 
arXiv:1803.05035v2 fatcat:764e6uog3nezbgcgmnc7y2p7zm

A Review of Subsequence Time Series Clustering

Seyedjamal Zolhavarieh, Saeed Aghabozorgi, Ying Wah Teh
2014 The Scientific World Journal  
One of the useful fields in the domain of subsequence time series clustering is pattern recognition. To improve this field, a sequence of time series data is used.  ...  Subsequence time series clustering is used in different fields, such as e-commerce, outlier detection, speech recognition, biological systems, DNA recognition, and text mining.  ...  In the context of artificial neural network (ANN), one of the unsupervised algorithms which are used for maps is self-organizing map (SOM). A self-organizing map includes nodes or neurons.  ... 
doi:10.1155/2014/312521 pmid:25140332 pmcid:PMC4130317 fatcat:ptmtjuq77rdhjpr4g2rhwvh4xa

Towards Autonomic Service Discovery A Survey and Comparison

Michael Rambold, Holger Kasinger, Florian Lautenbacher, Bernhard Bauer
2009 2009 IEEE International Conference on Services Computing  
For these purposes, in this paper we define prime criteria that have to be fulfilled for an autonomic service discovery.  ...  Following the idea of Autonomic Computing, which similarly aims at automating processes and workflows to a high degree, service composition and discovery have to proceed autonomously, which will on the  ...  SQL queries with focus on the vector distance are used to search the database for a link to UDDI registry entries. [31] also uses a vector space model with syntactical information retrieval concepts.  ... 
doi:10.1109/scc.2009.59 dblp:conf/IEEEscc/RamboldKLB09 fatcat:liehvrs2m5ahxnikgqaehwtr6m
« Previous Showing results 1 — 15 out of 19,550 results