Determining Weighted, Utility-Based Time Variant Association Rules Using Frequent Pattern Tree
Introduction: The present research was conducted at Birla Institute of Technology, off Campus in Noida, India, in 2017.Methods: To assess the efficiency of the proposed approach for information mining a method and an algorithm were proposed for mining time-variant weighted, utility-based association...
- Autores:
-
Gupta, Pankaj
Bhushan Sagar, Bharat
- Tipo de recurso:
- Article of journal
- Fecha de publicación:
- 2018
- Institución:
- Universidad Cooperativa de Colombia
- Repositorio:
- Repositorio UCC
- Idioma:
- eng
- OAI Identifier:
- oai:repository.ucc.edu.co:20.500.12494/9442
- Acceso en línea:
- https://revistas.ucc.edu.co/index.php/in/article/view/2228
https://hdl.handle.net/20.500.12494/9442
- Palabra clave:
- Rights
- openAccess
- License
- Copyright (c) 2018 Journal of Engineering and Education
id |
COOPER2_71e45cbf56fabfde9e29d6a8de9603cf |
---|---|
oai_identifier_str |
oai:repository.ucc.edu.co:20.500.12494/9442 |
network_acronym_str |
COOPER2 |
network_name_str |
Repositorio UCC |
repository_id_str |
|
dc.title.eng.fl_str_mv |
Determining Weighted, Utility-Based Time Variant Association Rules Using Frequent Pattern Tree |
dc.title.spa.fl_str_mv |
Determinación de las reglas de asociación de variables de tiempo ponderadas basadas en utilidades mediante la aplicación de un árbol de patrones frecuentes |
dc.title.por.fl_str_mv |
Determinação das regras de associação de variáveis de tempo ponderadas baseadas em utilidades mediante a aplicação de uma árvore de padrões frequentes |
title |
Determining Weighted, Utility-Based Time Variant Association Rules Using Frequent Pattern Tree |
spellingShingle |
Determining Weighted, Utility-Based Time Variant Association Rules Using Frequent Pattern Tree |
title_short |
Determining Weighted, Utility-Based Time Variant Association Rules Using Frequent Pattern Tree |
title_full |
Determining Weighted, Utility-Based Time Variant Association Rules Using Frequent Pattern Tree |
title_fullStr |
Determining Weighted, Utility-Based Time Variant Association Rules Using Frequent Pattern Tree |
title_full_unstemmed |
Determining Weighted, Utility-Based Time Variant Association Rules Using Frequent Pattern Tree |
title_sort |
Determining Weighted, Utility-Based Time Variant Association Rules Using Frequent Pattern Tree |
dc.creator.fl_str_mv |
Gupta, Pankaj Bhushan Sagar, Bharat |
dc.contributor.author.none.fl_str_mv |
Gupta, Pankaj Bhushan Sagar, Bharat |
description |
Introduction: The present research was conducted at Birla Institute of Technology, off Campus in Noida, India, in 2017.Methods: To assess the efficiency of the proposed approach for information mining a method and an algorithm were proposed for mining time-variant weighted, utility-based association rules using fp-tree.Results: A method is suggested to find association rules on time-oriented frequency-weighted, utility-based data, employing a hierarchy for pulling-out item-sets and establish their association.Conclusions: The dimensions adopted while developing the approach compressed a large time-variant dataset to a smaller data structure at the same time fp-tree was kept away from the repetitive dataset, which finally gave us a noteworthy advantage in articulations of time and memory use.Originality: In the current period, high utility recurrent-pattern pulling-out is one of the mainly noteworthy study areas in time-variant information mining due to its capability to account for the frequency rate of item-sets and assorted utility rates of every item-set. This research contributes to maintain it at a corresponding level, which ensures to avoid generating a big amount of candidate-sets, which ensures further development of less execution time and search spaces.Limitations: The research results demonstrated that the projected approach was efficient on tested datasets with pre-defined weight and utility calculations. |
publishDate |
2018 |
dc.date.accessioned.none.fl_str_mv |
2019-05-14T21:07:54Z |
dc.date.available.none.fl_str_mv |
2019-05-14T21:07:54Z |
dc.date.none.fl_str_mv |
2018-05-01 |
dc.type.none.fl_str_mv |
Artículo |
dc.type.coar.fl_str_mv |
http://purl.org/coar/resource_type/c_2df8fbb1 |
dc.type.coar.none.fl_str_mv |
http://purl.org/coar/resource_type/c_6501 |
dc.type.coarversion.none.fl_str_mv |
http://purl.org/coar/version/c_970fb48d4fbd8a85 |
dc.type.driver.none.fl_str_mv |
info:eu-repo/semantics/article |
dc.type.redcol.none.fl_str_mv |
http://purl.org/redcol/resource_type/ART |
dc.type.version.none.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
format |
http://purl.org/coar/resource_type/c_6501 |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
https://revistas.ucc.edu.co/index.php/in/article/view/2228 10.16925/.v14i0.2228 |
dc.identifier.uri.none.fl_str_mv |
https://hdl.handle.net/20.500.12494/9442 |
url |
https://revistas.ucc.edu.co/index.php/in/article/view/2228 https://hdl.handle.net/20.500.12494/9442 |
identifier_str_mv |
10.16925/.v14i0.2228 |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
https://revistas.ucc.edu.co/index.php/in/article/view/2228/2355 https://revistas.ucc.edu.co/index.php/in/article/view/2228/2520 |
dc.rights.none.fl_str_mv |
Copyright (c) 2018 Journal of Engineering and Education http://creativecommons.org/licenses/by-nc-nd/4.0/ |
dc.rights.accessrights.none.fl_str_mv |
info:eu-repo/semantics/openAccess |
dc.rights.coar.none.fl_str_mv |
http://purl.org/coar/access_right/c_abf2 |
rights_invalid_str_mv |
Copyright (c) 2018 Journal of Engineering and Education http://creativecommons.org/licenses/by-nc-nd/4.0/ http://purl.org/coar/access_right/c_abf2 |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.eng.fl_str_mv |
Universidad Cooperativa de Colombia |
dc.source.eng.fl_str_mv |
Ingeniería Solidaria; Vol 14 No 25 (2018): special issue; 1-11 |
dc.source.spa.fl_str_mv |
Ingeniería Solidaria; Vol. 14 Núm. 25 (2018): special issue; 1-11 |
dc.source.por.fl_str_mv |
Ingeniería Solidaria; v. 14 n. 25 (2018): special issue; 1-11 |
dc.source.none.fl_str_mv |
2357-6014 1900-3102 |
institution |
Universidad Cooperativa de Colombia |
repository.name.fl_str_mv |
Repositorio Institucional Universidad Cooperativa de Colombia |
repository.mail.fl_str_mv |
bdigital@metabiblioteca.com |
_version_ |
1814246716199665664 |
spelling |
Gupta, PankajBhushan Sagar, Bharat2018-05-012019-05-14T21:07:54Z2019-05-14T21:07:54Zhttps://revistas.ucc.edu.co/index.php/in/article/view/222810.16925/.v14i0.2228https://hdl.handle.net/20.500.12494/9442Introduction: The present research was conducted at Birla Institute of Technology, off Campus in Noida, India, in 2017.Methods: To assess the efficiency of the proposed approach for information mining a method and an algorithm were proposed for mining time-variant weighted, utility-based association rules using fp-tree.Results: A method is suggested to find association rules on time-oriented frequency-weighted, utility-based data, employing a hierarchy for pulling-out item-sets and establish their association.Conclusions: The dimensions adopted while developing the approach compressed a large time-variant dataset to a smaller data structure at the same time fp-tree was kept away from the repetitive dataset, which finally gave us a noteworthy advantage in articulations of time and memory use.Originality: In the current period, high utility recurrent-pattern pulling-out is one of the mainly noteworthy study areas in time-variant information mining due to its capability to account for the frequency rate of item-sets and assorted utility rates of every item-set. This research contributes to maintain it at a corresponding level, which ensures to avoid generating a big amount of candidate-sets, which ensures further development of less execution time and search spaces.Limitations: The research results demonstrated that the projected approach was efficient on tested datasets with pre-defined weight and utility calculations.Introducción: la presente investigación se realizó en el Birla Institute of Technology, fuera del campus en Noida, India, en 2017.Métodos: para evaluar la eficacia del enfoque propuesto para la minería de información, se propusieron un método y un algoritmo para minar las reglas de asociación basadas en la utilidad ponderada en el tiempo usando un árbol de patrones frecuentes (fp).Resultados: se sugiere un método para encontrar reglas de asociación en datos basados en la utilidad ponderada en frecuencia orientada al tiempo, que emplea una jerarquía para extraer conjuntos de elementos y establecer su asociación.Conclusiones: las dimensiones adoptadas al desarrollar el enfoque comprimieron un gran conjunto de datos de variante de tiempo hasta alcanzar una estructura de datos más pequeña. A su vez, el árbol fp se mantuvo alejado del conjunto de datos repetitivos, lo que finalmente generó una ventaja considerable en tiempo y uso de memoria.Originalidad: en la actualidad, la extracción de patrones recurrentes de alta utilidad es una de las áreas de estudio más desarrollada en la minería de información con respecto a la variable temporal debido a su capacidad de dar cuenta de la frecuencia de los conjuntos de elementos y las tasas de servicios varios de cada conjunto de elementos. Esta investigación contribuye a mantener el estudio sobre el tema a un buen nivel, lo que permite evitar generar una gran cantidad de conjuntos posibles, y por ende garantiza mayor desarrollo en menores tiempos de ejecución y espacios de búsqueda.Limitaciones: Los resultados de la investigación demostraron que la aproximación fue eficiente en conjuntos de datos probados con cálculos predefinidos de peso y utilidad.Introdução: esta pesquisa foi realizada no Instituto Birla de Tecnologia e Ciência, fora do campus, em Noida, na Índia, em 2017. Métodos: para avaliar a eficácia do enfoque proposto para mineração de informação, foram propostos um método e um algoritmo para minerar as regras de associação baseadas na utilidade ponderada no tempo usando uma árvore de padrões frequentes (fp).Resultados: é recomendado um método para encontrar regras de associação nos dados baseados na utilidade ponderada em frequência orientada ao tempo, que emprega uma hierarquia para extrair conjuntos de elementos e estabelecer a associação entre eles.Conclusões: as dimensões utilizadas ao desenvolver o enfoque comprimiram um grande conjunto de dados de variante de tempo até alcançar uma estrutura de dados menor, enquanto isso, a árvore fp se manteve distante do conjunto de dados repetitivos, o que finalmente gerou uma vantagem considerável em tempo e uso de memória.Originalidade: na atualidade, a extração de padrões recorrentes de alta utilidade é uma das áreas de estudo mais desenvolvidas na mineração de informação com respeito à variável temporal, devido a sua capacidade de dar conta da frequência dos conjuntos de elementos e das taxas de serviços vários de cada conjunto de elementos. Esta pesquisa ajuda a manter o estudo desse tema em um nível avançado, o que garante evitar gerar uma grande quantidade de conjuntos possíveis e, dessa forma, um maior desenvolvimento em um menor tempo de execução e espaço de busca.Limitações: os resultados da pesquisa demonstraram que a aproximação foi eficiente em conjuntos de dados provados com cálculos predefinidos de peso e utilidade.application/pdfengUniversidad Cooperativa de Colombiahttps://revistas.ucc.edu.co/index.php/in/article/view/2228/2355https://revistas.ucc.edu.co/index.php/in/article/view/2228/2520Copyright (c) 2018 Journal of Engineering and Educationhttp://creativecommons.org/licenses/by-nc-nd/4.0/info:eu-repo/semantics/openAccesshttp://purl.org/coar/access_right/c_abf2Ingeniería Solidaria; Vol 14 No 25 (2018): special issue; 1-11Ingeniería Solidaria; Vol. 14 Núm. 25 (2018): special issue; 1-11Ingeniería Solidaria; v. 14 n. 25 (2018): special issue; 1-112357-60141900-3102Determining Weighted, Utility-Based Time Variant Association Rules Using Frequent Pattern TreeDeterminación de las reglas de asociación de variables de tiempo ponderadas basadas en utilidades mediante la aplicación de un árbol de patrones frecuentesDeterminação das regras de associação de variáveis de tempo ponderadas baseadas em utilidades mediante a aplicação de uma árvore de padrões frequentesArtículohttp://purl.org/coar/resource_type/c_6501http://purl.org/coar/resource_type/c_2df8fbb1http://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articlehttp://purl.org/redcol/resource_type/ARTinfo:eu-repo/semantics/publishedVersionPublication20.500.12494/9442oai:repository.ucc.edu.co:20.500.12494/94422024-07-16 13:23:01.892metadata.onlyhttps://repository.ucc.edu.coRepositorio Institucional Universidad Cooperativa de Colombiabdigital@metabiblioteca.com |