Wikipedia

User:Danilo Eidy/sandbox/KeyGraph

< User:Danilo Eidy/sandbox

KeyGraph new article content ...


File:KeyGraph.jpg
KeyGraph: Clusters and Hubs shown with a metaphor of Islands and Bridges

KeyGraph is a method of processing data arrays and visualizing in a network graph. KeyGraph uses a genetic algorithm [1] and processes building blocks to generate a solution to hard problems and create network graph. The method identifies clusters of associated elements of the data and hubbing elements that associate clusters, revealing stable patterns and rare elements with high connectivity in a network graph. Applied in various fields, KeyGraph summarizes groups of data and rare and impactful data for chance discovery. Some examples of data arrays are POS data, Bag-Of-Words, Relational Databases, network data, and others.


The Ohsawa's KeyGraph Method

edit

The KeyGraph method consists of 2 major steps: 1) Clustering Highly frequent co-occurrent elements, and 2) Hubbing clusters with infrequent co-occurrent elements.

Step 1) Clustering Elements that frequently co-occur in arrays of data, will be extracted and pair wisely associated to each other. Elements with multiple associations will form clusters in a network graph, where the element is represented as a node and the association is represented as an edge. The associations between elements in clusters represent stable associations that repeatedly occur in arrays of data.

Step 2) Hubbing Elements that infrequently co-occur in arrays of data, will be extracted if they co-occur with at least one element of two different clusters. In the network graph, Hubbing elements are represented between clusters pair wisely associated with elements of two or more clusters with edges. Due to the connectivity among clusters, Hubbing elements are considered key nodes in the network graph. Hubbing elements represent chances in the interpretation of the data. Due to its rarity and connectivity, it suggests to bee an unexplored and potential element in the data.


Some Applications

edit

KeyGraph and Language

edit

In Computational Linguistics, the text is composed of arrays of linguistic data, where documents are decomposed into paragraphs, paragraphs into sentences, sentences into words and, as arrays, forms bags of words. When KeyGraph is applied to text [2], it generates semantic fields in clusters of textual data and key terms that reveal semantic relationships among semantic fields[3][4]. For example, a collection of documents of various topics is used with KeyGraph. The method will gather highly frequent terms and generate clusters of terms in nodes, linked by edges. Unfrequent terms will link clusters when they occur with terms of the different clusters.


KeyGraph and Events

edit

In Sciences, events are the objects of investigation of causal relationships of facts in the world. Sequences and co-occurrences of events are largely used to explain hypotheses in scientific terms [5][6]. When KeyGraph is applied to events, it generates correlated events in clusters of facts and rare events that reveal latent causality among events[7]. For example, let a collection of events be set in arrays in periods of time. The method will gather events with facts that frequently occur in the same period and generate clusters of co-occurrent events. Infrequent events will link clusters when they recur in different periods of time with events of different clusters.


KeyGraph and Behavior

edit

In Psychology and Business, human behavior is the object of study to understand human as an individual, in society and how to make decisions [8][9]. When KeyGraph is applied to behavioral data, it generates patterns of activities and unfrequent behaviors that reveal abnormalities or constrained decisions. For example, let supermarket's baskets in Point-Of-Sales (POS) data be arrays in each consumers' behavior. The method will associate products that are commonly purchased together and generate common baskets [10]. Eventually, infrequently purchased products will show in common baskets, revealing an unusual behavior of the consumer but still associated with common baskets. The classic example of beer and diaper association would appear as a common association within a cluster in KeyGraph. In advantage, KeyGraph method shows the big picture and emergent associations of products, for example, the emerging consumption of new products or special products that trigger the addition of products from different common baskets.


KeyGraph and Other Networks

edit

Networks can also be considered arrays of data, where nodes and links can be arranged in groups according to their connectivity, such as Hypertext networks, described as arrays of hyperlinks in a documents, Social networks as arrays of friends of each person, Electrical networks as arrays of electrical components, street network as arrays of street in a pathway, and so on. In Sociology and social psychology, collective behavior is defined in groups of people. Configuring collective behavior in social networks, KeyGraph reveals key persons such as influencers in weak tie theory. Also called bridges, this hubbing person connects closed social networks represented in clusters.


KeyGraph and Innovation

edit

The versatility of applications of KeyGraph in different fields allows its applications that often require interdisciplinary approaches, such as creativity, innovation, political discussions, business strategies, and other hard problems. In creativity studies, KeyGraph supports thinking out of the box, stimulating individuals with visual information and constraints[11]. Consolidated information in clusters helps individuals to retrieve their memory from their own knowledge, while hubbing terms bring awareness of relevant pieces of information that may not be directly retrieved but can be connected by active cognition and form new ideas[12]. When applied to business, KeyGraph supports essential processes of innovation, such as creativity in product or service design[13][14][15][16][17], and business and market strategies[18][19][20][21][22][23][24]. Associated with Innovators Marketplace method, It stimulates individuals in the ideation and exploration processes of innovation.


Other applications

edit

As a tool for discoveries in a complex context, considering multiple data, KeyGraph has being applied to risk prediction, such as earthquakes[25][26][27][28], and terrorism [29], helping by increasing awareness on unpredictable, latent and hidden factors that may be relevant in risk prevention plans. Another application is the political speech analysis, where analyzer consider semantic relationships in the KeyGraph to interpret consistency, frequency, and dominance of ideas in political speeches [30] and delineate social streams [31].


References

edit
  1. ^ Goldberg, D. E., Sastry, K., & Ohsawa, Y. (2003). Discovering deep building blocks for competent genetic algorithms using chance discovery via keygraphs. In Chance Discovery (pp. 276-301). Springer, Berlin, Heidelberg.
  2. ^ Ohsawa, Y., Benson, N. E., & Yachida, M. (1998, April). KeyGraph: Automatic indexing by co-occurrence graph based on building construction metaphor. In Proceedings IEEE International Forum on Research and Technology Advances in Digital Libraries-ADL'98- (pp. 12-18). IEEE.
  3. ^ Matsuo, Y., Ohsawa, Y., & Ishizuka, M. (2001, November). Keyworld: Extracting keywords from document s small world. In International Conference on Discovery Science (pp. 271-281). Springer, Berlin, Heidelberg.
  4. ^ Palshikar, G. K. (2007, December). Keyword extraction from a single document using centrality measures. In International Conference on Pattern Recognition and Machine Intelligence (pp. 503-510). Springer, Berlin, Heidelberg.
  5. ^ Ohsawa, Y. (2003). KeyGraph: visualized structure among event clusters. In Chance Discovery (pp. 262-275). Springer, Berlin, Heidelberg.
  6. ^ Ohsawa, Y. (2002). KeyGraph as risk explorer in earthquake–sequence. Journal of contingencies and crisis management, 10(3), 119-128.
  7. ^ Goda, S., & Ohsawa, Y. (2007). Estimation of chain reaction bankruptcy structure by chance discovery method—With time order method and directed KeyGraph. Journal of Systems Science and Systems Engineering, 16(4), 489-498.
  8. ^ Ohsawa, Y. (2002). Chance discoveries for making decisions in complex real world. New generation computing, 20(2), 143-163.
  9. ^ Ohsawa, Y., & Usui, M. (2006). Creative marketing as application of chance discovery. In Chance discoveries in real world decision making (pp. 253-271). Springer, Berlin, Heidelberg.
  10. ^ Emoto, M. (2015, November). Extraction of Preference of Recipe Providers and Users on Recipe-Sharing Websites. In 2015 IEEE International Conference on Data Mining Workshop (ICDMW) (pp. 694-697). IEEE.
  11. ^ Llorà, X., Goldberg, D. E., Ohsawa, Y., Matsumura, N., Washida, Y., Tamura, H., ... & Ohnishi, K. (2006). Innovation and creativity support via chance discovery, genetic algorithms, and data mining. New Mathematics and Natural Computation, 2(01), 85-100.
  12. ^ Wang, H., Ohsawa, Y., Hu, X., & Xu, F. (2015). Idea discovery: a context-awareness dynamic system approach for computational creativity. In Smart Modeling and Simulation for Complex Systems (pp. 99-111). Springer, Tokyo.
  13. ^ Horie, K., Ohsawa, Y., & Okazaki, N. (2006). Products designed on scenario maps using pictorial KeyGraph. WSEAS Transactions on Information Science and Applications, 3(7), 1324-1331.
  14. ^ Wang, H., Ohsawa, Y., & Nishihara, Y. (2011). A system method to elicit innovative knowledge based on chance discovery for innovative product design. International Journal of Knowledge and Systems Science (IJKSS), 2(3), 1-13.
  15. ^ Wang, H., Ohsawa, Y., & Nishihara, Y. (2012). Innovation support system for creative product design based on chance discovery. Expert Systems with Applications, 39(5), 4890-4897.
  16. ^ Lee, S., Kim, M. S., Park, Y., & Kim, C. (2016). Identification of a technological chance in product-service system using KeyGraph and text mining on business method patents. International Journal of Technology Management, 70(4), 239-256.
  17. ^ Wang, H., & Ohsawa, Y. (2013). Data-driven innovation technologies for smarter business from innovators’ market game to ichance creativity support system. In Advances in Chance Discovery (pp. 107-125). Springer, Berlin, Heidelberg.
  18. ^ Wang, H., & Ohsawa, Y. (2011). iChance: a web-based innovation support system for business intelligence. International Journal of Organizational and Collective Intelligence (IJOCI), 2(4), 48-61. [19] Hsu, F. C., Lee, H., & Chi, T. H. (2006, October). Discovering hidden blue ocean strategy with keygraph machine. In 9th Joint International Conference on Information Sciences (JCIS-06). Atlantis Press.
  19. ^ USUI, M., & OHSAWA, Y. Chance Discovery in Textile Market.
  20. ^ Tamura, H., Washida, Y., & Yoshikawa, M. (2004). Chances and Marketing: On-line Conversation Analysis for Creative Scenario Discussion.
  21. ^ Hayashi, T., & Ohsawa, Y. (2016, August). Preliminary Case Study about Analysis Scenarios and Actual Data Analysis in the Market of Data. In 2nd European Workshop on Chance Discovery and Data Synthesis (EWCDDS16) (p. 42).
  22. ^ Wang, H., & Ohsawa, Y. A Scenario-Based System Approach for Idea Discovery in Market Innovation.
  23. ^ Hatanaka, H., & Abe, A. (2015). What type of information and scheme does the data market need?. Procedia Computer Science, 60, 1309-1317.
  24. ^ Lin, M. H., Hong, C. F., & Jao, K. Y. (2008, October). Visualization of the user's preference using multi-values analysis. In 2008 IEEE International Conference on Systems, Man and Cybernetics (pp. 307-311). IEEE.
  25. ^ Ohsawa, Y., & Yachida, M. (1999, December). Discover risky active faults by indexing an earthquake sequence. In International Conference on Discovery Science (pp. 208-219). Springer, Berlin, Heidelberg.
  26. ^ Ohsawa, Y. (2002). KeyGraph as risk explorer in earthquake–sequence. Journal of contingencies and crisis management, 10(3), 119-128.
  27. ^ Ohsawa, Y. (2003). KeyGraph: visualized structure among event clusters. In Chance Discovery (pp. 262-275). Springer, Berlin, Heidelberg.
  28. ^ Ohsawa, Y. (2003). Detection of earthquake risks with keygraph. In Chance Discovery (pp. 339-350). Springer, Berlin, Heidelberg.
  29. ^ Nitta, K. (2007). Chance Discovery with Data Crystallization: Discovering Unobservable Events. TOKYO INST OF TECH YOKOHAMA (JAPAN).
  30. ^ Romero-Frías, E., & Arroyo-Machado, W. (2018). Policy labs in Europe: political innovation, structure and content analysis on Twitter. El profesional de la información (EPI), 27(6), 1181-1192.
  31. ^ Sayyadi, H., Hurst, M., & Maykov, A. (2009, March). Event detection and tracking in social streams. In Third International AAAI Conference on Weblogs and Social Media.


Retrieved from "https://en.wikipedia.org/w/index.php?title=User:Danilo_Eidy/sandbox/KeyGraph&oldid=903520000"