MKT 6009 Marketing Internship (0 semester credit hours) Student gains experience and improves skills through appropriate developmental work assignments in a real business environment. Student must identify and submit specific business learning objectives at the beginning of the semester. The student must demonstrate exposure to the managerial perspective via involvement or observation. At semester end, student prepares an oral or poster presentation, or a written paper reflecting on the work experience. Student performance is evaluated by the work supervisor. Pass/Fail only. Prerequisites: (MAS 6102 or MBA major) and department consent required. (0-0) S MKT 6244 Digital Marketing Strategy (2 semester credit hours) Executive Education Course. The course explores three distinct areas within marketing and sales namely, digital marketing, traditional sales prospecting, and executive sales organization and strategy. The continuing convergence of the digital marketing and sales funnels has created a strategic continuum from digital lead generation to digital sales. The course identifies the current composition of this digital continuum while providing opportunities to evaluate sales and marketing digital strategies. Prerequisites: MKT 6301 and instructor consent required. (2-0) Y MKT 6301 (SYSM 6318) Marketing Management (3 semester credit hours) Overview of marketing management methods, principles and concepts including product, pricing, promotion and distribution decisions as well as segmentation, targeting and positioning. (3-0) S MKT 6309 Marketing Data Analysis and Research (3 semester credit hours) Methods employed in market research and data analysis to understand consumer behavior, customer journeys, and markets so as to enable better decision-making. Topics include understanding different sources of data, survey design, experiments, and sampling plans. The course will cover the techniques used for market sizing estimation and forecasting. In addition, the course will cover the foundational concepts and techniques used in data visualization and \"story-telling\" for clients and management. Corequisites: MKT 6301 and OPRE 6301. (3-0) Y MKT 6310 Consumer Behavior (3 semester credit hours) An exposition of the theoretical perspectives of consumer behavior along with practical marketing implication. Study of psychological, sociological and behavioral findings and frameworks with reference to consumer decision-making. Topics will include the consumer decision-making model, individual determinants of consumer behavior and environmental influences on consumer behavior and their impact on marketing. Prerequisite: MKT 6301. (3-0) Y MKT 6321 Interactive and Digital Marketing (3 semester credit hours) Introduction to the theory and practice of interactive and digital marketing. Topics covered include: online-market research, consumer behavior, conversion metrics, and segmentation considerations; ecommerce, search and display advertising, audiences, search engine marketing, email, mobile, video, social networks, and the Internet of Things. (3-0) T MKT 6322 Internet Business Models (3 semester credit hours) Topics to be covered are: consumer behavior on the Internet, advertising on the Internet, competitive strategies, market research using the Internet, brand management, managing distribution and supply chains, pricing strategies, electronic payment systems, and developing virtual organizations. Further, students learn auction theory, web content design, and clickstream analysis. Prerequisite: MKT 6301. (3-0) Y MKT 6323 Database Marketing (3 semester credit hours) Techniques to analyze, interpret, and utilize marketing databases of customers to identify a firm's best customers, understanding their needs, and targeting communications and promotions to retain such customers. Topics

Marketing for management.

http://science.sciencemag.org/content/sci/201/4359/899.2.full.pdf

Phenomenology of perception.

Deep learning has revolutionized many machine learning tasks in recent years, ranging from image classification and video processing to speech recognition and natural language understanding. The data in these tasks are typically represented in the Euclidean space. However, there is an increasing number of applications, where data are generated from non-Euclidean domains and are represented as graphs with complex relationships and interdependency between objects. The complexity of graph data has imposed significant challenges on the existing machine learning algorithms. Recently, many studies on extending deep learning approaches for graph data have emerged. In this article, we provide a comprehensive overview of graph neural networks (GNNs) in data mining and machine learning fields. We propose a new taxonomy to divide the state-of-the-art GNNs into four categories, namely, recurrent GNNs, convolutional GNNs, graph autoencoders, and spatial–temporal GNNs. We further discuss the applications of GNNs across various domains and summarize the open-source codes, benchmark data sets, and model evaluation of GNNs. Finally, we propose potential research directions in this rapidly growing field.

/pdf/a-comprehensive-survey-on-graph-neural-networks-4lw9i4v183.pdf

A Comprehensive Survey on Graph Neural Networks

Lots of learning tasks require dealing with graph data which contains rich relation information among elements. Modeling physics systems, learning molecular fingerprints, predicting protein interface, and classifying diseases demand a model to learn from graph inputs. In other domains such as learning from non-structural data like texts and images, reasoning on extracted structures (like the dependency trees of sentences and the scene graphs of images) is an important research topic which also needs graph reasoning models. Graph neural networks (GNNs) are neural models that capture the dependence of graphs via message passing between the nodes of graphs. In recent years, variants of GNNs such as graph convolutional network (GCN), graph attention network (GAT), graph recurrent network (GRN) have demonstrated ground-breaking performances on many deep learning tasks. In this survey, we propose a general design pipeline for GNN models and discuss the variants of each component, systematically categorize the applications, and propose four open problems for future research.

Graph Neural Networks: A Review of Methods and Applications

Networks evolve continuously over time with the addition, deletion, and changing of links and nodes. Although many networks contain this type of temporal information, the majority of research in network representation learning has focused on static snapshots of the graph and has largely ignored the temporal dynamics of the network. In this work, we describe a general framework for incorporating temporal information into network embedding methods. The framework gives rise to methods for learning time-respecting embeddings from continuous-time dynamic networks. Overall, the experiments demonstrate the effectiveness of the proposed framework and dynamic network embedding approach as it achieves an average gain of 11.9% across all methods and graphs. The results indicate that modeling temporal dependencies in graphs is important for learning appropriate and meaningful network representations.

Continuous-Time Dynamic Network Embeddings

Graph-structured data arise naturally in many different application domains. By representing data as graphs, we can capture entities (i.e., nodes) as well as their relationships (i.e., edges) with each other. Many useful insights can be derived from graph-structured data as demonstrated by an ever-growing body of work focused on graph mining. However, in the real-world, graphs can be both large—with many complex patterns—and noisy, which can pose a problem for effective graph mining. An effective way to deal with this issue is to incorporate “attention” into graph mining solutions. An attention mechanism allows a method to focus on task-relevant parts of the graph, helping it to make better decisions. In this work, we conduct a comprehensive and focused survey of the literature on the emerging field of graph attention models. We introduce three intuitive taxonomies to group existing work. These are based on problem setting (type of input and output), the type of attention mechanism used, and the task (e.g., graph classification, link prediction). We motivate our taxonomies through detailed examples and use each to survey competing approaches from a unique standpoint. Finally, we highlight several challenges in the area and discuss promising directions for future work.

Attention Models in Graphs: A Survey

This paper describes a general framework for learning Higher-Order Network Embeddings (HONE) from graph data based on network motifs. The HONE framework is highly expressive and flexible with many interchangeable components. The experimental results demonstrate the effectiveness of learning higher-order network representations. In all cases, HONE outperforms recent embedding methods that are unable to capture higher-order structures with a mean relative gain in AUC of 19% (and up to 75% gain) across a wide variety of networks and embedding methods.

Higher-order Network Representation Learning

Graph-structured data arise naturally in many different application domains. By representing data as graphs, we can capture entities (i.e., nodes) as well as their relationships (i.e., edges) with each other. Many useful insights can be derived from graph-structured data as demonstrated by an ever-growing body of work focused on graph mining. However, in the real-world, graphs can be both large - with many complex patterns - and noisy which can pose a problem for effective graph mining. An effective way to deal with this issue is to incorporate "attention" into graph mining solutions. An attention mechanism allows a method to focus on task-relevant parts of the graph, helping it to make better decisions. In this work, we conduct a comprehensive and focused survey of the literature on the emerging field of graph attention models. We introduce three intuitive taxonomies to group existing work. These are based on problem setting (type of input and output), the type of attention mechanism used, and the task (e.g., graph classification, link prediction, etc.). We motivate our taxonomies through detailed examples and use each to survey competing approaches from a unique standpoint. Finally, we highlight several challenges in the area and discuss promising directions for future work.

The success of deep convolutional neural networks in the domains of computer vision and speech recognition has led researchers to investigate generalizations of the said architecture to graph-structured data. A recently-proposed method called Graph Convolutional Networks has been able to achieve state-of-the-art results in the task of node classification. However, since the proposed method relies on localized first-order approximations of spectral graph convolutions, it is unable to capture higher-order interactions between nodes in the graph. In this work, we propose a motif-based graph attention model, called Motif Convolutional Networks, which generalizes past approaches by using weighted multi-hop motif adjacency matrices to capture higher-order neighborhoods. A novel attention mechanism is used to allow each individual node to select the most relevant neighborhood to apply its filter. We evaluate our approach on graphs from different domains (social networks and bioinformatics) with results showing that it is able to outperform a set of competitive baselines on the semi-supervised node classification task. Additional results demonstrate the usefulness of attention, showing that different higher-order neighborhoods are prioritized by different kinds of nodes.

https://dl.acm.org/doi/pdf/10.1145/3357384.3357880

Eunyee Koh

Papers

Continuous-Time Dynamic Network Embeddings

Attention Models in Graphs: A Survey

Higher-order Network Representation Learning

Attention Models in Graphs: A Survey

Graph Convolutional Networks with Motif-based Attention